//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 3e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int N;
vi X(MX),Y(MX),R(MX);
bool check(int i, int j){
return (X[i]-X[j])*(X[i]-X[j]) + (Y[i]-Y[j])*(Y[i]-Y[j])
<= (R[i]+R[j])*(R[i]+R[j]);
}
int32_t main() {
boost; IO();
cin>>N;
FOR(i,0,N) cin>>X[i]>>Y[i]>>R[i];
set<int> s; FOR(i,0,N) s.insert(i);
int ans[N];
while(!s.empty()){
int mx=0,i=INF;
for(auto c: s){
if(ckmax(mx,R[c])) i=c;
else if(R[c]==mx) ckmin(i,c);
}
vi vec;
for(auto c: s) if(check(i,c)) vec.pb(c);
dbgv(vec);
for(auto x: vec){
s.erase(x);
ans[x]=i;
}
}
FOR(i,0,N) cout << ans[i]+1 << ' '; cout << endl;
return 0;
}
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Multisets are shit
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/
Compilation message
circle_selection.cpp: In function 'int32_t main()':
circle_selection.cpp:29:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
29 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^~~
circle_selection.cpp:97:5: note: in expansion of macro 'FOR'
97 | FOR(i,0,N) cout << ans[i]+1 << ' '; cout << endl;
| ^~~
circle_selection.cpp:97:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
97 | FOR(i,0,N) cout << ans[i]+1 << ' '; cout << endl;
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7404 KB |
Output is correct |
2 |
Correct |
5 ms |
7404 KB |
Output is correct |
3 |
Correct |
5 ms |
7404 KB |
Output is correct |
4 |
Correct |
5 ms |
7404 KB |
Output is correct |
5 |
Correct |
5 ms |
7404 KB |
Output is correct |
6 |
Correct |
6 ms |
7404 KB |
Output is correct |
7 |
Correct |
5 ms |
7404 KB |
Output is correct |
8 |
Correct |
5 ms |
7404 KB |
Output is correct |
9 |
Correct |
5 ms |
7404 KB |
Output is correct |
10 |
Correct |
6 ms |
7404 KB |
Output is correct |
11 |
Correct |
5 ms |
7404 KB |
Output is correct |
12 |
Correct |
6 ms |
7404 KB |
Output is correct |
13 |
Correct |
6 ms |
7404 KB |
Output is correct |
14 |
Correct |
6 ms |
7660 KB |
Output is correct |
15 |
Correct |
5 ms |
7404 KB |
Output is correct |
16 |
Correct |
6 ms |
7532 KB |
Output is correct |
17 |
Correct |
6 ms |
7436 KB |
Output is correct |
18 |
Correct |
6 ms |
7680 KB |
Output is correct |
19 |
Correct |
9 ms |
7916 KB |
Output is correct |
20 |
Correct |
9 ms |
8044 KB |
Output is correct |
21 |
Correct |
9 ms |
7916 KB |
Output is correct |
22 |
Correct |
275 ms |
7788 KB |
Output is correct |
23 |
Correct |
283 ms |
7788 KB |
Output is correct |
24 |
Correct |
293 ms |
7908 KB |
Output is correct |
25 |
Correct |
291 ms |
7908 KB |
Output is correct |
26 |
Correct |
274 ms |
7908 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
236 ms |
32980 KB |
Output is correct |
2 |
Correct |
268 ms |
33724 KB |
Output is correct |
3 |
Correct |
289 ms |
33292 KB |
Output is correct |
4 |
Correct |
240 ms |
33100 KB |
Output is correct |
5 |
Execution timed out |
3024 ms |
28516 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7404 KB |
Output is correct |
2 |
Execution timed out |
3040 ms |
15844 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3037 ms |
29468 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7404 KB |
Output is correct |
2 |
Correct |
5 ms |
7404 KB |
Output is correct |
3 |
Correct |
5 ms |
7404 KB |
Output is correct |
4 |
Correct |
5 ms |
7404 KB |
Output is correct |
5 |
Correct |
5 ms |
7404 KB |
Output is correct |
6 |
Correct |
6 ms |
7404 KB |
Output is correct |
7 |
Correct |
5 ms |
7404 KB |
Output is correct |
8 |
Correct |
5 ms |
7404 KB |
Output is correct |
9 |
Correct |
5 ms |
7404 KB |
Output is correct |
10 |
Correct |
6 ms |
7404 KB |
Output is correct |
11 |
Correct |
5 ms |
7404 KB |
Output is correct |
12 |
Correct |
6 ms |
7404 KB |
Output is correct |
13 |
Correct |
6 ms |
7404 KB |
Output is correct |
14 |
Correct |
6 ms |
7660 KB |
Output is correct |
15 |
Correct |
5 ms |
7404 KB |
Output is correct |
16 |
Correct |
6 ms |
7532 KB |
Output is correct |
17 |
Correct |
6 ms |
7436 KB |
Output is correct |
18 |
Correct |
6 ms |
7680 KB |
Output is correct |
19 |
Correct |
9 ms |
7916 KB |
Output is correct |
20 |
Correct |
9 ms |
8044 KB |
Output is correct |
21 |
Correct |
9 ms |
7916 KB |
Output is correct |
22 |
Correct |
275 ms |
7788 KB |
Output is correct |
23 |
Correct |
283 ms |
7788 KB |
Output is correct |
24 |
Correct |
293 ms |
7908 KB |
Output is correct |
25 |
Correct |
291 ms |
7908 KB |
Output is correct |
26 |
Correct |
274 ms |
7908 KB |
Output is correct |
27 |
Correct |
12 ms |
8476 KB |
Output is correct |
28 |
Correct |
13 ms |
8476 KB |
Output is correct |
29 |
Correct |
12 ms |
8476 KB |
Output is correct |
30 |
Correct |
1165 ms |
8268 KB |
Output is correct |
31 |
Correct |
1154 ms |
8324 KB |
Output is correct |
32 |
Correct |
1165 ms |
8272 KB |
Output is correct |
33 |
Correct |
84 ms |
17128 KB |
Output is correct |
34 |
Correct |
80 ms |
16984 KB |
Output is correct |
35 |
Correct |
88 ms |
16812 KB |
Output is correct |
36 |
Execution timed out |
3047 ms |
15468 KB |
Time limit exceeded |
37 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7404 KB |
Output is correct |
2 |
Correct |
5 ms |
7404 KB |
Output is correct |
3 |
Correct |
5 ms |
7404 KB |
Output is correct |
4 |
Correct |
5 ms |
7404 KB |
Output is correct |
5 |
Correct |
5 ms |
7404 KB |
Output is correct |
6 |
Correct |
6 ms |
7404 KB |
Output is correct |
7 |
Correct |
5 ms |
7404 KB |
Output is correct |
8 |
Correct |
5 ms |
7404 KB |
Output is correct |
9 |
Correct |
5 ms |
7404 KB |
Output is correct |
10 |
Correct |
6 ms |
7404 KB |
Output is correct |
11 |
Correct |
5 ms |
7404 KB |
Output is correct |
12 |
Correct |
6 ms |
7404 KB |
Output is correct |
13 |
Correct |
6 ms |
7404 KB |
Output is correct |
14 |
Correct |
6 ms |
7660 KB |
Output is correct |
15 |
Correct |
5 ms |
7404 KB |
Output is correct |
16 |
Correct |
6 ms |
7532 KB |
Output is correct |
17 |
Correct |
6 ms |
7436 KB |
Output is correct |
18 |
Correct |
6 ms |
7680 KB |
Output is correct |
19 |
Correct |
9 ms |
7916 KB |
Output is correct |
20 |
Correct |
9 ms |
8044 KB |
Output is correct |
21 |
Correct |
9 ms |
7916 KB |
Output is correct |
22 |
Correct |
275 ms |
7788 KB |
Output is correct |
23 |
Correct |
283 ms |
7788 KB |
Output is correct |
24 |
Correct |
293 ms |
7908 KB |
Output is correct |
25 |
Correct |
291 ms |
7908 KB |
Output is correct |
26 |
Correct |
274 ms |
7908 KB |
Output is correct |
27 |
Correct |
236 ms |
32980 KB |
Output is correct |
28 |
Correct |
268 ms |
33724 KB |
Output is correct |
29 |
Correct |
289 ms |
33292 KB |
Output is correct |
30 |
Correct |
240 ms |
33100 KB |
Output is correct |
31 |
Execution timed out |
3024 ms |
28516 KB |
Time limit exceeded |
32 |
Halted |
0 ms |
0 KB |
- |