QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#695537 | #9462. Safest Buildings | 333zhan | WA | 1ms | 3612kb | C++20 | 1.0kb | 2024-10-31 20:14:31 | 2024-10-31 20:14:44 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int inf = 1E18;
void solve () {
int n, R, r;
cin >> n >> R >> r;
int minn = inf;
vector <int> x (n), y (n);
for (int i = 0; i < n; i ++) {
cin >> x[i] >> y[i];
minn = min (minn, x[i] * x[i] + y[i] * y[i]);
}
vector <int> p;
if (r * 2 >= R) {
for (int i = 0; i < n; i ++) {
if (x[i] * x[i] + y[i] * y[i] == minn) {
p.push_back (i);
}
}
} else {
for (int i = 0; i < n; i ++) {
if (x[i] * x[i] + y[i] * y[i] + r * r <= R * R) {
p.push_back (i);
}
}
}
cout << p.size () << '\n';
for (auto x : p) {
cout << x + 1 << " \n"[x == p.back ()];
}
}
signed main () {
ios::sync_with_stdio (false);
cin.tie (nullptr);
int T = 1;
cin >> T;
while (T --) {
solve ();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
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: 3580kb
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 8 1 2 3 4 5 6 7 8 13 1 2 3 4 5 6 7 8 9 10 11 12 13 5 1 2 4 5 6 1 5 1 9 1 11 1 5 1 29 1 5 1 29 56 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 26 1 2 3 4 5 7 8 9 10 11 12 14...
result:
wrong answer 7th words differ - expected: '4', found: '8'