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 = 5010;
const int oo = 2e9;
int x[N], y[N], r[N], n, mrk[N];
ll sqr(ll x){ return (x * x);}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("in.txt","r",stdin);
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i] >> r[i];
fill(mrk, mrk + n, -1);
int kol = n;
for (; kol > 0; ){
int nom = -1, mx = -1;
for (int i = 0; i < n; i++){
if (mrk[i] >= 0) continue;
if (r[i] > mx){
mx = r[i];
nom = i;
}
}
for (int i = 0; i < n; i++){
if (mrk[i] >= 0) continue;
ll cur = sqr(x[i] - x[nom]) + sqr(y[i] - y[nom]) - sqr(r[i] + r[nom]);
if (cur <= 0){
mrk[i] = nom;
kol--;
}
}
}
for (int i = 0; i < n; i++)
cout << mrk[i] + 1 << " ";
return 0;
}
# | 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... |