QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#635675 | #9462. Safest Buildings | ucup-team1264# | WA | 1ms | 3652kb | C++20 | 1.3kb | 2024-10-12 20:34:24 | 2024-10-12 20:34:25 |
Judging History
answer
// https://www.youtube.com/watch?v=CrymicX875M
// Angel of mercy
// How did you move me
// Why am I on my feet again
#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;
void solve() {
int n, R, r; cin >> n >> R >> r;
vector<int> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
vector<double> dist(n);
for (int i = 0; i < n; i++) {
dist[i] = max<double>(hypot(x[i], y[i]), 2 * r - R);
}
double eps = 1e-9;
vector<int> ans;
for (int i = 0; i < n; i++) {
if (ans.empty() || dist[i] < dist[ans.back()] - eps) {
ans = {i};
} else if (abs(dist[i] - dist[ans.back()]) < eps) {
ans.push_back(i);
}
}
// if (r == R) {
// ans.resize(n);
// iota(ans.begin(), ans.end(), 0);
// }
int m = ans.size();
cout << m << "\n";
for (int i = 0; i < m; i++) {
cout << ans[i] + 1 << " \n"[i == m - 1];
}
}
#undef int
// Make bold hypotheses and verify carefully
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int t = 1;
cin >> t;
while (t--) {
solve();
};
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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: 3652kb
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 1 3 1 12 1 1 6 2 4 5 7 13 14 7 1 3 4 5 6 7 9 1 11 9 1 2 3 4 5 6 7 8 9 1 29 1 5 1 29 1 33 1 21 1 35 9 2 8 11 16 29 37 38 55 62 21 1 2 3 4 7 8 9 12 14 17 18 20 22 23 24 27 28 31 33 34 36 7 4 8 12 13 14 15 18 3 4 8 13 20 2 5 8 10 12 14 17 25 31 32 34 35 36 39 43 44 46 47 54 55 11 2 4 8 11...
result:
wrong answer 7th words differ - expected: '4', found: '1'