| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 103188 | E869120 | Circle selection (APIO18_circle_selection) | C++14 | 3073 ms | 13652 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
#pragma warning (disable: 4996)
long long N, X[1 << 18], Y[1 << 18], R[1 << 18], score[1 << 18];
bool used[1 << 18];
long long dist(int p1, int p2) {
return (X[p1] - X[p2]) * (X[p1] - X[p2]) + abs(Y[p1] - Y[p2]) * abs(Y[p1] - Y[p2]);
}
int main() {
scanf("%lld", &N);
for (int i = 1; i <= N; i++) scanf("%lld%lld%lld", &X[i], &Y[i], &R[i]);
while (true) {
int maxn = -1, id = -1;
for (int i = 1; i <= N; i++) {
if (used[i] == true) continue;
if (maxn < R[i]) { maxn = R[i]; id = i; }
}
if (id == -1) break;
for (int i = 1; i <= N; i++) {
if (used[i] == true) continue;
if (dist(id, i) <= (R[i] + R[id]) * (R[i] + R[id])) { used[i] = true; score[i] = id; }
}
}
for (int i = 1; i <= N; i++) {
if (i >= 2) printf(" ");
printf("%lld", score[i]);
}
printf("\n");
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
