#include <bits/stdc++.h>
template <class T>
using Vec = std::vector<T>;
using ll = long long;
constexpr ll sq(const ll x) {
return x * x;
}
int main() {
int N;
std::cin >> N;
Vec<ll> X(N), Y(N), R(N);
for (int i = 0; i < N; ++i) {
std::cin >> X[i] >> Y[i] >> R[i];
}
Vec<int> order(N);
std::iota(order.begin(), order.end(), 0);
std::stable_sort(order.begin(), order.end(), [&](const int i, const int j) {
return R[i] > R[j];
});
Vec<int> ans(N, -1);
if (N <= 5000) {
for (const auto x: order) {
if (ans[x] == -1) {
ans[x] = x;
for (int i = 0; i < N; ++i) {
if (ans[i] == -1 and sq(X[i] - X[x]) + sq(Y[i] - Y[x]) <= sq(R[i] + R[x])) {
ans[i] = x;
}
}
}
}
}
else {
std::set<std::pair<ll, int>> set;
for (int i = 0; i < N; ++i) {
set.emplace(X[i] - R[i], i);
set.emplace(X[i] + R[i], i);
}
for (const auto x: order) {
if (ans[x] == -1) {
ans[x] = x;
while (true) {
auto itr = set.lower_bound(std::make_pair(X[x] - R[x], 0));
if (itr == set.end() or itr -> first > X[x] + R[x]) {
break;
}
const auto i = itr -> second;
ans[i] = x;
set.erase(std::make_pair(X[i] - R[i], i));
set.erase(std::make_pair(X[i] + R[i], i));
}
}
}
}
for (int i = 0; i < N; ++i) {
std::cout << ans[i] + 1 << " \n"[i + 1 == N];
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
292 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
292 KB |
Output is correct |
16 |
Correct |
2 ms |
332 KB |
Output is correct |
17 |
Correct |
2 ms |
332 KB |
Output is correct |
18 |
Correct |
2 ms |
332 KB |
Output is correct |
19 |
Correct |
8 ms |
564 KB |
Output is correct |
20 |
Correct |
8 ms |
568 KB |
Output is correct |
21 |
Correct |
8 ms |
588 KB |
Output is correct |
22 |
Correct |
58 ms |
580 KB |
Output is correct |
23 |
Correct |
58 ms |
580 KB |
Output is correct |
24 |
Correct |
60 ms |
576 KB |
Output is correct |
25 |
Correct |
58 ms |
564 KB |
Output is correct |
26 |
Correct |
65 ms |
572 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1252 ms |
50580 KB |
Output is correct |
2 |
Correct |
1210 ms |
50508 KB |
Output is correct |
3 |
Correct |
1235 ms |
50336 KB |
Output is correct |
4 |
Correct |
1206 ms |
50552 KB |
Output is correct |
5 |
Correct |
963 ms |
50392 KB |
Output is correct |
6 |
Correct |
988 ms |
53472 KB |
Output is correct |
7 |
Correct |
954 ms |
53500 KB |
Output is correct |
8 |
Correct |
953 ms |
53468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
316 ms |
17712 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1028 ms |
50104 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
292 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
292 KB |
Output is correct |
16 |
Correct |
2 ms |
332 KB |
Output is correct |
17 |
Correct |
2 ms |
332 KB |
Output is correct |
18 |
Correct |
2 ms |
332 KB |
Output is correct |
19 |
Correct |
8 ms |
564 KB |
Output is correct |
20 |
Correct |
8 ms |
568 KB |
Output is correct |
21 |
Correct |
8 ms |
588 KB |
Output is correct |
22 |
Correct |
58 ms |
580 KB |
Output is correct |
23 |
Correct |
58 ms |
580 KB |
Output is correct |
24 |
Correct |
60 ms |
576 KB |
Output is correct |
25 |
Correct |
58 ms |
564 KB |
Output is correct |
26 |
Correct |
65 ms |
572 KB |
Output is correct |
27 |
Incorrect |
24 ms |
2112 KB |
Output isn't correct |
28 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
292 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
292 KB |
Output is correct |
16 |
Correct |
2 ms |
332 KB |
Output is correct |
17 |
Correct |
2 ms |
332 KB |
Output is correct |
18 |
Correct |
2 ms |
332 KB |
Output is correct |
19 |
Correct |
8 ms |
564 KB |
Output is correct |
20 |
Correct |
8 ms |
568 KB |
Output is correct |
21 |
Correct |
8 ms |
588 KB |
Output is correct |
22 |
Correct |
58 ms |
580 KB |
Output is correct |
23 |
Correct |
58 ms |
580 KB |
Output is correct |
24 |
Correct |
60 ms |
576 KB |
Output is correct |
25 |
Correct |
58 ms |
564 KB |
Output is correct |
26 |
Correct |
65 ms |
572 KB |
Output is correct |
27 |
Correct |
1252 ms |
50580 KB |
Output is correct |
28 |
Correct |
1210 ms |
50508 KB |
Output is correct |
29 |
Correct |
1235 ms |
50336 KB |
Output is correct |
30 |
Correct |
1206 ms |
50552 KB |
Output is correct |
31 |
Correct |
963 ms |
50392 KB |
Output is correct |
32 |
Correct |
988 ms |
53472 KB |
Output is correct |
33 |
Correct |
954 ms |
53500 KB |
Output is correct |
34 |
Correct |
953 ms |
53468 KB |
Output is correct |
35 |
Correct |
1 ms |
204 KB |
Output is correct |
36 |
Incorrect |
316 ms |
17712 KB |
Output isn't correct |
37 |
Halted |
0 ms |
0 KB |
- |