CSP2020-09
CSP202009-1 称检测点查询


1 // 2 // main.cpp 3 // CSP202009-1 称检测点查询 4 // 5 // Created by sylvia on 2021/11/14. 6 // Copyright © 2021 apple. All rights reserved. 7 // 8 9 #include <iostream> 10 #include <math.h> 11 #include <algorithm> 12 using namespace std; 13 #define LL long long 14 int n,x,y,xx,yy; 15 int num1,num2,num3; 16 LL dist1=0x3f3f3f3f,dist2=0x3f3f3f3f,dist3=0x3f3f3f3f; 17 int main() { 18 cin>>n>>x>>y; 19 int i=1; 20 while(i<=n){ 21 cin>>xx>>yy; 22 LL tmp=pow(x-xx,2)+pow(y-yy,2); 23 if (tmp<dist1) { 24 dist3=dist2; 25 num3=num2; 26 num2=num1; 27 num1=i; 28 dist2=dist1; 29 dist1=tmp; 30 }else if (tmp<dist2){ 31 dist3=dist2; 32 dist2=tmp; 33 num3=num2; 34 num2=i; 35 }else if(tmp<dist3){ 36 dist3=tmp; 37 num3=i; 38 } 39 i++; 40 } 41 cout<<num1<<endl<<num2<<endl<<num3<<endl; 42 return 0; 43 }
CSP202009-2 风险人群筛查




再次感叹这次的csp题是真的简单,可惜没有赶上好时候哎qwq
1 // 2 // main.cpp 3 // CSP202009-2 风险人群筛查 4 // 5 // Created by sylvia on 2021/11/14. 6 // Copyright © 2021 apple. All rights reserved. 7 // 8 9 #include <iostream> 10 #include <math.h> 11 #include <algorithm> 12 #include <string.h> 13 using namespace std; 14 #define M 100000+5 15 int n,k,t,x,y,xx,yy,a,b; 16 int flag,num1=0,num2=0; 17 int judge(int a,int b){ 18 if (a<=xx&&b<=yy&&a>=x&&b>=y) return 1; 19 else return 0; 20 } 21 int main() { 22 cin>>n>>k>>t>>x>>y>>xx>>yy; 23 for (int i=1;i<=n;i++){ 24 flag=0; 25 int tmp=0; 26 for (int j=1;j<=t;j++){ 27 cin>>a>>b; 28 if(judge(a,b)) tmp++; 29 else tmp=0; 30 flag=max(flag,tmp); 31 } 32 flag=max(flag,tmp); 33 if (flag>=1) num1++; 34 if(flag>=k) num2++; 35 } 36 cout<<num1<<endl<<num2<<endl; 37 return 0; 38 }

浙公网安备 33010602011771号