QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #632846 | #9462. Safest Buildings | ucup-team5052# | AC ✓ | 1ms | 3648kb | C++14 | 590b | 2024-10-12 14:03:33 | 2024-10-12 14:03:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int x[110],y[110],p[110];
int d2(int i){return x[i]*x[i]+y[i]*y[i];}
int main() {
std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T;
cin>>T;
while(T--)
{
int n,R,r;
cin>>n>>R>>r;
for(int i=1;i<=n;i++) cin>>x[i]>>y[i];
iota(p+1,p+n+1,1);
sort(p+1,p+n+1,[](int i,int j){return d2(i)<d2(j);});
int m=1;
while(m<n && d2(p[m])==d2(p[m+1])) m++;
while(m<n && d2(p[m+1])<=(R-2*r)*(R-2*r)) m++;
sort(p+1,p+m+1);
cout<<m<<"\n";
for(int i=1;i<=m;i++) cout<<p[i]<<" \n"[i==m];
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3648kb
input:
2 3 10 5 3 4 3 5 3 6 3 10 4 -7 -6 4 5 5 4
output:
1 1 2 2 3
result:
ok 5 tokens
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
100 6 100 50 42 -31 -66 7 13 84 94 13 51 -14 -18 9 12 100 50 -78 56 -56 -64 -22 54 -41 14 -14 55 21 -83 75 21 -51 56 -31 74 -34 79 22 -37 1 -12 14 100 50 15 71 -44 41 -56 78 -48 22 42 -2 -70 28 51 -34 49 -31 -36 67 63 70 34 9 27 -33 36 -93 -52 -19 8 100 14 21 89 67 60 -12 -3 24 -37 -51 14 -30 8 -75 ...
output:
1 6 1 12 1 11 4 3 4 5 6 7 1 4 6 8 9 12 13 1 1 6 2 4 5 7 13 14 7 1 3 4 5 6 7 9 1 11 9 1 2 3 4 5 6 7 8 9 1 29 1 5 1 29 47 1 2 3 4 5 6 7 9 10 11 12 14 17 18 19 21 22 24 25 26 27 28 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 50 51 52 53 54 55 56 2 21 29 20 1 5 6 7 10 13 14 18 21 25 26 30 33 3...
result:
ok 1674 tokens
Extra Test:
score: 0
Extra Test Passed