//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;
constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;
random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());
template<typename T>
bool assign_max(T& a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template<typename T>
bool assign_min(T& a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename T>
T square(T a) {
return a * a;
}
template<>
struct std::hash<pair<ll, ll>> {
ll operator() (pair<ll, ll> p) const {
return ((__int128)p.first * MOD + p.second) % INF64;
}
};
struct circle {
ll x, y, r, id;
circle(ll x = 0, ll y = 0, ll r = 0, ll id = 0): x(x), y(y), r(r), id(id) {}
bool operator<(const circle c2) const {
return c2.r < r;
}
bool check(circle c2) {
return square(x - c2.x) + square(y - c2.y) <= square(r + c2.r);
}
};
struct segment_tree {
vector<set<pair<ll, ll>>> tree;
ll size;
segment_tree(ll n) {
size = 1;
while (size < n) {
size *= 2;
}
tree.resize(size * 2);
}
void insert(ll x, ll y, ll id) {
insert(1, 0, size, x, y, id);
}
void insert(ll v, ll l, ll r, ll x, ll y, ll id) {
if (x < l || r <= x) {
return;
}
tree[v].insert(make_pair(y, id));
if (r - l == 1) {
return;
}
ll mid = (l + r) / 2;
insert(v * 2, l, mid, x, y, id);
insert(v * 2 + 1, mid, r, x, y, id);
}
void erase(ll x, ll y, ll id) {
erase(1, 0, size, x, y, id);
}
void erase(ll v, ll l, ll r, ll x, ll y, ll id) {
if (x < l || r <= x) {
return;
}
tree[v].erase(make_pair(y, id));
if (r - l == 1) {
return;
}
ll mid = (l + r) / 2;
erase(v * 2, l, mid, x, y, id);
erase(v * 2 + 1, mid, r, x, y, id);
}
void get(ll l, ll r, ll nl, ll nr, vector<ll>& ans) {
get(1, 0, size, l, r + 1, nl, nr, ans);
}
void get(ll v, ll l, ll r, ll ql, ll qr, ll nl, ll nr, vector<ll>& ans) {
if (ql <= l && r <= qr) {
auto it = tree[v].lower_bound(make_pair(nl, 0));
while (it != tree[v].end() && it->first <= nr) {
ans.emplace_back(it->second);
it++;
}
return;
}
if (qr <= l || r <= ql) {
return;
}
ll mid = (l + r) / 2;
get(v * 2, l, mid, ql, qr, nl, nr, ans);
get(v * 2 + 1, mid, r, ql, qr, nl, nr, ans);
}
};
void solve() {
ll n;
cin >> n;
vector<circle> all(n);
for (ll i = 0; i < n; i++) {
cin >> all[i].x >> all[i].y >> all[i].r;
all[i].id = i;
}
stable_sort(all.begin(), all.end());
vector<ll> ans(n, -1);
vector<vector<pair<ll, ll>>> points(n);
set<ll> allx;
for (ll i = 0; i < n; i++) {
points[i].emplace_back(all[i].x - all[i].r, all[i].y - all[i].r);
points[i].emplace_back(all[i].x - all[i].r, all[i].y + all[i].r);
points[i].emplace_back(all[i].x + all[i].r, all[i].y - all[i].r);
points[i].emplace_back(all[i].x + all[i].r, all[i].y + all[i].r);
allx.insert(all[i].x - all[i].r);
allx.insert(all[i].x + all[i].r);
}
map<ll, ll> zip;
ll lst = 0;
for (auto i : allx) {
zip[i] = lst;
lst++;
}
segment_tree st(lst);
for (ll i = 0; i < n; i++) {
for (auto&[x, y] : points[i]) {
x = zip[x];
st.insert(x, y, i);
}
}
exit(1);
for (ll i = 0; i < n; i++) {
if (ans[all[i].id] == -1) {
vector<ll> na;
st.get(points[i][0].first, points[i][2].first, points[i][0].second, points[i][1].second, na);
for (auto j : na) {
if (ans[all[j].id] == -1) {
if (all[i].check(all[j])) {
ans[all[j].id] = all[i].id;
for (auto[x, y] : points[j]) {
st.erase(x, y, j);
}
} else {
exit(1);
}
}
}
}
}
for (auto i : ans) {
cout << i + 1 << ' ';
}
cout << '\n';
}
int main() {
if (IS_FILE) {
freopen("", "r", stdin);
freopen("", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
if (IS_TEST_CASES) {
cin >> t;
}
for (ll i = 0; i < t; i++) {
solve();
}
}
Compilation message
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:182:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
182 | freopen("", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~
circle_selection.cpp:183:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
183 | freopen("", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
0 ms |
344 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3070 ms |
590664 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
0 ms |
344 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3069 ms |
554164 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
0 ms |
344 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
0 ms |
344 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
