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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
int n, a[N][3], par[N];
ll dist(int a, int b, int x, int y){
return ((x - a) * (x - a) + (y - b) * (y - b));
}
int main(){
cin >> n;
for (int i = 1; i <= n; i ++)
for (int j = 0; j < 3; j ++)
cin >> a[i][j];
if (n <= 5000){
while (1){
int mx = -1;
for (int i = 1; i <= n; i ++)
if (!par[i] and (mx == -1 or a[i][2] > a[mx][2]))
mx = i;
if (mx == -1) break;
for (int i = 1; i <= n; i ++)
if (!par[i] and dist(a[i][0], a[i][1], a[mx][0], a[mx][1]) <= (a[i][2] + a[mx][2]) * (a[i][2] + a[mx][2]))
par[i] = mx;
}
for (int i = 1; i <= n; i ++)
cout << par[i] << " ";
cout << endl;
}
}
# | 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... |