Submission #106530

#TimeUsernameProblemLanguageResultExecution timeMemory
106530username원 고르기 (APIO18_circle_selection)C++14
49 / 100
3070 ms286228 KiB
#pragma GCC optimize("O3") #include<bits/stdc++.h> #define int int64_t//int_fast64_t using namespace std; typedef pair<int,int> pii; typedef vector<int> VI; #define REP(i,j,k) for(int i=(j);i<(k);++i) #define pb emplace_back #define F first #define S second #define endl '\n' // #define __debug #ifdef __debug #define IOS (void)0 #define de(...) cerr<<__VA_ARGS__ #define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);} #else #define IOS cin.tie(0),cout.tie(0),ios_base::sync_with_stdio(false) #define de(...) (void)0 #define ar(...) (void)0 #endif /***********************************default***********************************/ #define f2(x) ((x)*(x)) const int maxn=3e5+9,inf=1ll<<60,bl=3e9; struct C{int x,y,r,id;}a[maxn]; int n,rmv[maxn],res[maxn]; unordered_map<int,VI>mp; list<int>ls; main(){ IOS; cin>>n; REP(i,0,n)cin>>a[i].x>>a[i].y>>a[i].r,a[i].id=i; sort(a,a+n,[](C x,C y){return x.r==y.r?x.id<y.id:x.r>y.r;}); int k=inf; REP(i,0,n){ if(rmv[i])continue; if(2*a[i].r<k){ k=a[i].r; mp.clear(); REP(j,0,n){ if(!rmv[j]){ mp[a[j].x/k*bl+a[j].y/k].pb(j); } } } int xx=a[i].x/k,yy=a[i].y/k; REP(x,xx-2,xx+3)REP(y,yy-2,yy+3){ auto&tls=mp[x*bl+y]; for(auto it=tls.begin();it!=tls.end();++it){ if(rmv[*it])continue; C c=a[*it]; if(f2(a[i].x-c.x)+f2(a[i].y-c.y)<=f2(a[i].r+c.r)){ res[c.id]=a[i].id; rmv[*it]=1; } } } } REP(i,0,n)cout<<res[i]+1<<" "; }

Compilation message (stderr)

circle_selection.cpp:30:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
#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...