#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}
void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
_print(H);
if(sizeof...(T)) cerr<<",";
else cerr<<"\"]";
dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct dt {
ll x,y,r;
int idx;
bool intersect(const dt &aa) {
return abs(aa.x-x)<=r+aa.r;
// return (x-aa.x)*(x-aa.x)+(y-aa.y)*(y-aa.y)<=(r+aa.r)*(r+aa.r);
}
bool operator<(const dt &aa) {
return r<aa.r;
}
};
bool operator>(const dt &aa,const dt &bb) {
if(aa.r==bb.r) return aa.x<bb.x;
return aa.r>bb.r;
}
bool same[5010][5010];
int main () {
ios::sync_with_stdio(false); cin.tie(0);
int n; cin>>n;
vector<dt> a(n),a2(n);
for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y>>a[i].r,a[i].idx=i;
a2=a;
sort(all(a),greater<dt>());
sort(all(a2),[&](const dt &l,const dt &r) {
return (l.x-l.r)<(r.x-r.r);
});
vector<int> toA(n),toA2(n);
vector<int> ans(n,-1);
for(int i=0;i<n;i++) {
toA[a[i].idx]=i;
toA2[a2[i].idx]=i;
}
for(int i=0;i<n;i++) {
int idx=a[i].idx;
int idx2=toA2[idx];
int u=a2[idx2].idx;
assert(u==idx);
if(ans[u]!=-1) continue;
ans[u]=u;
int l=idx2-1,r=idx2+1;
while(l>=0 and a2[idx2].intersect(a2[l])) {
int v=a2[l].idx;
if(ans[v]!=-1) break;
ans[v]=u; l--;
}
while(r<n and a2[idx2].intersect(a2[r])) {
int v=a2[r].idx;
// if(!i) debug(r,v);
if(ans[v]!=-1) break;
ans[v]=u; r++;
}
// if(!i) {
// cout<<"#"<<a2[idx2].x<<" "<<a2[idx2].y<<" "<<a2[idx2].r<<endl;
// cout<<"#"<<a2[r].x<<" "<<a2[r].y<<" "<<a2[r].r<<endl;
// }
// debug(idx2,r,a2[idx2].intersect(a2[r]));
// debug(i,l,r);
}
for(int i=0;i<n;i++) cout<<ans[i]+1<<" "; cout<<endl;
}
Compilation message
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:95:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
95 | for(int i=0;i<n;i++) cout<<ans[i]+1<<" "; cout<<endl;
| ^~~
circle_selection.cpp:95:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
95 | for(int i=0;i<n;i++) cout<<ans[i]+1<<" "; cout<<endl;
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
213 ms |
24716 KB |
Output is correct |
| 2 |
Incorrect |
219 ms |
31364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
241 ms |
24604 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
