Submission #106508

#TimeUsernameProblemLanguageResultExecution timeMemory
106508bert30702Circle selection (APIO18_circle_selection)C++17
7 / 100
3088 ms21308 KiB
#include <bits/stdc++.h> #define pii pair<int, int> #define F first #define S second #define X real() #define Y imag() using namespace std; typedef complex<long double> C; const int MX = 3e5 + 100; const double EPS = 1e-5; struct circle { C p; int r, i; } v[MX]; int ans[MX]; bool touch(int a, int b) { return !ans[v[b].i] and abs(v[b].p - v[a].p) + EPS <= v[a].r + v[b].r; } main () { srand(time(0)); int n; cin >> n; for(int i = 1; i <= n; i ++) { int x, y, r; cin >> x >> y >> r; v[i] = {{x, y}, r, i}; } int ang = rand(); for(int i = 1; i <= n; i ++) v[i].p *= C{cos(ang), sin(ang)}; sort(v + 1, v + 1 + n, [](circle a, circle b) { return a.p.X < b.p.X; }); priority_queue<pair<int, pii> > pq; for(int i = 1; i <= n; i ++) pq.push({v[i].r, {-v[i].i, -i}}); while(pq.size()) { int p = -pq.top().S.S; pq.pop(); if(ans[v[p].i]) continue; for(int i = max(1, p - 5000); i <= min(n, p + 5000); i ++) { if(touch(p, i)) ans[v[i].i] = v[p].i; } } for(int i = 1; i <= n; i ++) cout << ans[i] << ' '; }

Compilation message (stderr)

circle_selection.cpp:16:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:21:23: warning: narrowing conversion of 'x' from 'int' to 'long double' inside { } [-Wnarrowing]
   v[i] = {{x, y}, r, i};
                       ^
circle_selection.cpp:21:23: warning: narrowing conversion of 'y' from 'int' to 'long double' inside { } [-Wnarrowing]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...