# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381140 | rainboy | Circle selection (APIO18_circle_selection) | C11 | 3053 ms | 14228 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 <stdio.h>
#define N 300000
int main() {
static int xx[N], yy[N], rr[N], pp[N];
static char used[N];
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d%d%d", &xx[i], &yy[i], &rr[i]);
while (1) {
int i_;
i_ = -1;
for (i = 0; i < n; i++)
if (!used[i] && (i_ == -1 || rr[i_] < rr[i]))
i_ = i;
if (i_ == -1)
break;
for (i = 0; i < n; i++) {
long long x = xx[i] - xx[i_], y = yy[i] - yy[i_], r = rr[i] + rr[i_];
if (!used[i] && x * x + y * y <= r * r)
used[i] = 1, pp[i] = i_;
}
}
for (i = 0; i < n; i++)
printf("%d ", pp[i] + 1);
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... |