QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#692207 | #9462. Safest Buildings | ucup-team5217# | WA | 1ms | 3772kb | C++23 | 1.0kb | 2024-10-31 14:04:24 | 2024-10-31 14:04:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 5050;
int n, R, r;
int x[N], y[N];
void solve() {
scanf("%d%d%d", &n, &R, &r);
r = 2 * r;
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &x[i], &y[i]);
}
int minn = 1e9;
for (int i = 1; i <= n; ++i) {
minn = min(minn, x[i] * x[i] + y[i] * y[i]);
}
vector<int> ans;
if (r <= R && minn <= (R - r) * (R - r)) {
for (int i = 1; i <= n; ++i) {
if (x[i] * x[i] + y[i] * y[i] <= (R - r) * (R - r)) {
ans.emplace_back(i);
}
}
}
else {
for (int i = 1; i <= n; ++i) {
if (x[i] * x[i] + y[i] * y[i] == minn) {
ans.emplace_back(i);
}
}
}
printf("%lu\n", ans.size());
for (int i = 0; i + 1 < ans.size(); ++i) {
printf("%d ", ans[i]);
}
printf("%d\n", ans[ans.size() - 1]);
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
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: 3748kb
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 1 5 1 9 1 11 1 5 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 35 37 38 41 43 45 48 1 29 1 14 1 14 1 13 ...
result:
wrong answer 22nd words differ - expected: '6', found: '1'