제출 #971556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
971556		irmuun	원 고르기 (APIO18_circle_selection)	C++17	7 / 100	3085 ms	1048576 KiB

circle_selection

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

const ll N=3e5+5;
ll n;
ll x[N],y[N],r[N];
vector<ll>adj[N],ans(N,0);
vector<bool>used(N,0);

ll dist(ll i,ll j){
    return abs(x[i]-x[j])*abs(x[i]-x[j])+abs(y[i]-y[j])*abs(y[i]-y[j]);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin>>n;
    set<pair<ll,ll>>st;
    for(ll i=1;i<=n;i++){
        cin>>x[i]>>y[i]>>r[i];
        st.insert({-r[i],i});
    }
    for(ll i=1;i<=n;i++){
        for(ll j=i+1;j<=n;j++){
            if(dist(i,j)<=(r[i]+r[j])*(r[i]+r[j])){
                adj[i].pb(j);
                adj[j].pb(i);
            }
        }
    }
    while(!st.empty()){
        ll i=st.begin()->ss;
        st.erase(st.begin());
        if(ans[i]>0) continue;
        ans[i]=i;
        for(ll j:adj[i]){
            if(ans[j]==0) ans[j]=i;
        }
    }
    for(ll i=1;i<=n;i++){
        cout<<ans[i]<<' ';
    }
}

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