제출 #552808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
552808		zaneyu	원 고르기 (APIO18_circle_selection)	C++14	100 / 100	2147 ms	59024 KiB

circle_selection

/*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
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;

#define ld long double
#define pii pair<ll,ll>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
int MOD=2;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}

int n;
pair<pii,ll> arr[maxn];
int x[maxn],y[maxn],ans[maxn];
int blk=1e9;
map<pii,vector<int>> mp;
bool del[maxn];
inline bool inter(int a,int b){
    ll d=(arr[a].f.s-arr[b].f.s)*(arr[a].f.s-arr[b].f.s)+(arr[a].f.f-arr[b].f.f)*(arr[a].f.f-arr[b].f.f);
    return d<=(arr[a].s+arr[b].s)*(arr[a].s+arr[b].s);
}
void rebuild(){
    mp.clear();
    REP(i,n){
        if(del[i]) continue;
        x[i]=arr[i].f.f/blk;
        y[i]=arr[i].f.s/blk;
        mp[{x[i],y[i]}].pb(i);
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n;
    set<int> s;
    vector<pii> vv;
    REP(i,n) cin>>arr[i].f.f>>arr[i].f.s>>arr[i].s,vv.pb({arr[i].s,-i});
    sort(ALL(vv));
    reverse(ALL(vv));
    rebuild();
    REP(asd,n){
        int i=-vv[asd].s;
        if(del[i]) continue;
        if(blk>2*arr[i].s){
            blk=arr[i].s;
            rebuild();
        }
        for(int j=x[i]-2;j<=x[i]+2;j++){
            for(int k=y[i]-2;k<=y[i]+2;k++){
                if(!mp.count({j,k})) continue;
                vector<int> nw;
                for(int x:mp[{j,k}]){
                    if(inter(x,i)){
                        del[x]=1;
                        ans[x]=i;
                    }
                    else nw.pb(x);
                }
                mp[{j,k}]=nw;
            }
        }
    }
    REP(i,n){
        cout<<ans[i]+1<<' ';
    }
} 

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 15 / 15
• Subtask 4: 23 / 23
• Subtask 5: 30 / 30
• Subtask 6: 13 / 13