# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
983349 | vjudge1 | Circle selection (APIO18_circle_selection) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
#define int long long
using namespace std;
int n, i, j, k, x[300001], y[300001], r[300001], ans[300001];
bool u[300001];
multiset<pair<int, int>> ms, mss;
long double dist(long double x1, long double y1, long double x2, long double y2) {
return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}
bool inter(int i, int j) {
return (r[i] + r[j]) * (r[i] + r[j]) >= dist(x[i], y[i], x[j], y[j]);
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
cin >> n;
bool subtask2 = 1;
for (i = 1; i <= n; i++) {
cin >> x[i] >> y[i] >> r[i];
ms.insert({r[i], -i});
//y[i] = 0;
if (y[i] != 0) {
subtask2 = 0;
}
}
for (i = 1; i <= n; i++) {
if (ms.empty()) break;
k = -(*ms.rbegin()).second;
ms.erase(prev(ms.end()));
ans[k] = k;
for (auto j : ms) {
if (inter(k, -j.second)) {
ans[-j.second] = k;
}
else mss.insert(j);
}
ms = mss;
mss.clear();
} //
for (i = 1; i <= n; i++) cout << ans[i] << " ";
}