QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#631620 | #9462. Safest Buildings | ucup-team2279# | AC ✓ | 1ms | 3840kb | C++20 | 439b | 2024-10-12 09:14:18 | 2024-10-12 09:14:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n,R,r,mi=1e9;
cin>>n>>R>>r;
int t=r*2-R;
vector<int> ans;
for(int i=1,x,y;i<=n;i++){
cin>>x>>y;
int d=max(x*x+y*y,t*t);
if(d==mi) ans.push_back(i);
if(d<mi) mi=d,ans={i};
}
cout<<ans.size()<<"\n";
for(int x:ans) cout<<x<<" ";
cout<<"\n";
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int t;
cin>>t;
while(t--) solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3840kb
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: 3820kb
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