#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define itr ::iterator
typedef pair<int,int> pii;
const int MAX=4e5;
const int INF=1e12;
set<int> st;
vector< vector<pii> > vec(MAX);
int N,mnx,mny,X[MAX],Y[MAX],R[MAX],par[MAX],block[MAX][2];
bool ok(int F,int S)
{
if((X[F]-X[S])*(X[F]-X[S])+(Y[F]-Y[S])*(Y[F]-Y[S])>(R[F]+R[S])*(R[F]+R[S]))
return false;
return true;
}
signed main()
{
ios_base::sync_with_stdio(false);
/*cin.tie(0);
cout.tie(0);*/
/* input
11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1
*/
mnx=INF;
mny=INF;
cin>>N;
for(int A=1;A<=N;A++)
{
cin>>X[A]>>Y[A]>>R[A];
mnx=min(mnx,X[A]);
mnx=min(mnx,Y[A]);
}
for(int A=1;A<=N;A++)
{
X[A]-=mnx;
Y[A]-=mnx;
block[A][0]=X[A]/R[A];
block[A][1]=Y[A]/R[A];
vec[block[A][1]].pb(mp(block[A][0],A));
st.insert(block[A][1]);
}
for(auto A:st)
sort(vec[A].begin(),vec[A].end());
for(int A=1;A<=N;A++)
{
if(par[A])
continue;
par[A]=A;
for(int B=A+1;B<=N;B++)
if(ok(A,B) and (par[B]==0))
par[B]=A;
continue;
for(int B=block[A][1]-2;B<=block[A][1]+2;B++)
{
if(B<0)
continue;
if(vec[B].empty())
continue;
pii lol=mp(block[A][0]-2,0);
for(vector<pii> itr it=vec[B].begin();it!=vec[B].end();it++)
{
if(par[it->second])
continue;
if(ok(A,it->second))
par[it->second]=A;
}
}
}
for(int A=1;A<=N;A++)
cout<<par[A]<<" ";
return 0;
}
Compilation message
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:72:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(int B=A+1;B<=N;B++)
^~~
circle_selection.cpp:75:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
continue;
^~~~~~~~
circle_selection.cpp:82:8: warning: variable 'lol' set but not used [-Wunused-but-set-variable]
pii lol=mp(block[A][0]-2,0);
^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9720 KB |
Output is correct |
2 |
Correct |
11 ms |
9832 KB |
Output is correct |
3 |
Correct |
10 ms |
9912 KB |
Output is correct |
4 |
Correct |
11 ms |
9984 KB |
Output is correct |
5 |
Correct |
10 ms |
9984 KB |
Output is correct |
6 |
Incorrect |
11 ms |
10036 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
248 ms |
30196 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
11 ms |
30196 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3041 ms |
35356 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9720 KB |
Output is correct |
2 |
Correct |
11 ms |
9832 KB |
Output is correct |
3 |
Correct |
10 ms |
9912 KB |
Output is correct |
4 |
Correct |
11 ms |
9984 KB |
Output is correct |
5 |
Correct |
10 ms |
9984 KB |
Output is correct |
6 |
Incorrect |
11 ms |
10036 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9720 KB |
Output is correct |
2 |
Correct |
11 ms |
9832 KB |
Output is correct |
3 |
Correct |
10 ms |
9912 KB |
Output is correct |
4 |
Correct |
11 ms |
9984 KB |
Output is correct |
5 |
Correct |
10 ms |
9984 KB |
Output is correct |
6 |
Incorrect |
11 ms |
10036 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |