QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#634979 | #9462. Safest Buildings | ucup-team3659# | AC ✓ | 1ms | 3680kb | C++20 | 668b | 2024-10-12 18:32:50 | 2024-10-12 18:32:51 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
int x[5005],y[5005];
int r1,r2;
const int inf=0x3f3f3f3f3f3f3f3f;
void test()
{
cin>>n>>r1>>r2;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i];
int d=r1-r2-r2;
d=d*d;
int minn=inf;
for(int i=1;i<=n;i++)
minn=min(minn,x[i]*x[i]+y[i]*y[i]);
minn=max(minn,d);
vector<int> v;
for(int i=1;i<=n;i++)
if(x[i]*x[i]+y[i]*y[i]<=minn)
v.push_back(i);
cout<<v.size()<<"\n";
for(int x:v)
cout<<x<<" ";
cout<<"\n";
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
for(int i=1;i<=t;i++)
test();
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
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: 1ms
memory: 3680kb
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 2...
result:
ok 1674 tokens
Extra Test:
score: 0
Extra Test Passed