제출 #1190592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190592		Malix	원 고르기 (APIO18_circle_selection)	C++20	7 / 100	3094 ms	15432 KiB

circle_selection

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<ll,ll,ll> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
// ios::sync_with_stdio(0);
// cin.tie(0);
    int n;cin>>n;
    vector<ti> a(n);
    vector<pair<ll,int>> b(n);
    REP(i,0,n){
        ll x,y,z;cin>>x>>y>>z;
        a[i]={x,y,z};
        b[i]={z,-i};
    }
    vi ans(n);
    REP(i,0,n)ans[i]=i;
    sort(b.begin(),b.end());
    reverse(b.begin(),b.end());
    REP(i,0,n){
        int p=-b[i].S;
        if(ans[p]!=p)continue;
        REP(j,0,n)if(j!=p&&ans[j]==j){
            ll x=get<0>(a[p])-get<0>(a[j]);
            x=x*x;
            ll y=get<1>(a[p])-get<1>(a[j]);
            y=y*y;
            ll z=get<2>(a[p])+get<2>(a[j]);
            z=z*z;
            if(x+y<=z)ans[j]=p;
        }
    }
    REP(i,0,n)cout<<ans[i]+1<<" ";
}

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