| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 291318 | 2020-09-05T05:43:26 Z | blue | Circle selection (APIO18_circle_selection) | C++11 | 0 ms | 0 KB |
#include <iostream>
#include <vector>
using namespace std;
long long sq(long long a)
{
return a*a;
}
//7 pts: n <= 5000
long long main()
{
long long n;
cin >> n;
long long x[n+1], y[n+1], r[n+1];
for(long long i = 1; i <= n; i++) cin >> x[i] >> y[i] >> r[i];
vector<long long> kill(n+1, 0);
long long c;
r[0] = 0;
while(1)
{
c = 0;
for(long long i = 1; i <= n; i++) if(!kill[i] && r[i] > r[c]) c = i;
//cout << c << ' ';
if(!c) break;
for(long long i = 1; i <= n; i++)
if(!kill[i] && sq(x[i] - x[c]) + sq(y[i] - y[c]) <= sq(r[i] + r[c]))
kill[i] = c;
}
for(long long i = 1; i <= n; i++) cout << kill[i] << ' ';
cout << '\n';
}