QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #636385 | #9462. Safest Buildings | ucup-team191# | WA | 1ms | 3800kb | C++23 | 896b | 2024-10-12 23:40:13 | 2024-10-12 23:40:13 |
Judging History
answer
#include <cstdio>
#include <string>
#include <iostream>
#include <vector>
#include <algorithm>
#define PB push_back
using namespace std;
typedef pair < int, int > pii;
int main(){
int T; scanf("%d", &T);
for(;T--;) {
int n, r, R; scanf("%d%d%d", &n, &R, &r);
vector < pii > v;
for(int i = 1;i <= n;i++) {
int x, y; scanf("%d%d", &x, &y);
v.PB({x * x + y * y, i});
}
sort(v.begin(), v.end());
int ans = 0;
int crit = abs(R - 2 * r);
if(crit >= 0 && v[0].first <= crit * crit) {
for(pii x : v) ans += x.first <= crit * crit;
printf("%d\n", ans);
for(pii x : v) if(x.first <= crit * crit) printf("%d ", x.second);
printf("\n");
} else {
for(pii x : v) ans += x.first == v[0].first;
printf("%d\n", ans);
for(pii x : v) if(x.first == v[0].first) printf("%d ", x.second);
printf("\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3796kb
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: 0ms
memory: 3800kb
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 6 4 5 7 12 4 13 9 1 6 8 1 1 6 5 7 2 13 14 4 7 9 1 3 7 4 6 5 1 11 9 5 2 1 8 9 4 3 7 6 1 29 1 5 1 29 47 33 25 48 45 7 18 43 19 2 27 32 17 38 54 3 14 12 56 22 41 28 36 34 44 6 47 21 55 37 9 11 26 52 24 46 4 10 1 51 40 39 30 31 53 5 35 50 2 21 29 20 35 26 45 7 10 33 5 48...
result:
wrong answer 9th words differ - expected: '4', found: '6'