QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#706897 | #9462. Safest Buildings | propane# | WA | 1ms | 3644kb | C++20 | 1017b | 2024-11-03 13:52:35 | 2024-11-03 13:52:35 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
int main(){
#ifdef LOCAL
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
#endif
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
int T;
cin >> T;
while(T--){
int n, R, r;
cin >> n >> R >> r;
LL t = (R - r) * (R - r);
LL mn = 1e18;
vector<int> ans;
for(int i = 0; i < n; i++){
LL x, y;
cin >> x >> y;
LL d2 = x * x + y * y;
if (d2 <= t){
d2 = -1;
}
if (d2 < mn){
ans = {i + 1};
mn = d2;
}
else if (d2 == mn){
ans.push_back(i + 1);
}
}
cout << ans.size() << '\n';
for(int i = 0; i < ans.size(); i++){
cout << ans[i] << " \n"[i + 1 == ans.size()];
}
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3528kb
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: 1ms
memory: 3644kb
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'