QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #674455 | #9462. Safest Buildings | ucup-team1338# | WA | 2ms | 3988kb | C++20 | 674b | 2024-10-25 15:52:57 | 2024-10-25 15:52:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5005;
ll dis[maxn];
void solve() {
int n;cin>>n;
ll R,r;cin>>R>>r;
R-=r;
ll mdis=1e18;
for(int i=1;i<=n;i++) {
ll x,y;cin>>x>>y;
dis[i]=max(R*R,x*x+y*y);
mdis=min(mdis,dis[i]);
}
vector<int> ans;
for(int i=1;i<=n;i++) {
if(mdis==dis[i]) ans.push_back(i);
}
printf("%d\n",ans.size());
//for(auto x:ans) printf("%d ",x);
for(int i=0;i<ans.size()-1;i++) printf("%d ",ans[i]);
printf("%d\n",ans.back());
}
int main() {
int t;cin>>t;
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
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: -100
Wrong Answer
time: 2ms
memory: 3988kb
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 3 4 11 12 3 5 11 12 6 3 4 5 6 7 8 9 1 3 4 6 8 9 11 12 13 2 1 5 3 2 5 7 1 9 1 11 1 5 15 5 8 10 13 14 21 22 23 25 26 28 29 33 36 37 6 4 5 12 13 16 28 16 18 20 29 30 31 38 39 49 53 58 64 67 69 71 72 73 51 1 2 3 4 5 6 7 9 10 11 12 13 14 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 35 36 37 38 ...
result:
wrong answer 3rd words differ - expected: '1', found: '3'