제출 #440119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
440119		KULIKOLD	원 고르기 (APIO18_circle_selection)	C++17	0 / 100	3083 ms	6724 KiB

circle_selection

//#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int xx;
#define int ll
#define endl '\n'
const int DIM = 1E5+7;
const int INF = 1E9;
struct node{
    ll x,y,r,pos;
} A[DIM];
int P[DIM],ans[DIM];
bool mc(const node &a,const node &b){
    if (a.r==b.r){
        return a.pos<b.pos;
    }
    return a.r>b.r;
}
ll can(const node &a,const node &b){
    return ll(a.r+b.r)*(a.r+b.r)>=ll(a.x-b.x)*(a.x-b.x)+ll(a.y-b.y)*(a.y-b.y);
}
int solve(){
    int n;
    cin>>n;
    for(int i = 1;i<=n;++i){
        cin>>A[i].x>>A[i].y>>A[i].r;
        A[i].pos = i;
    }
    sort(A+1,A+1+n,mc);
    for(int i = 1;i<=n;++i){
        if (P[i])
            continue;
        P[i] = i;
        ans[A[i].pos] = A[i].pos;
        for(int j = i+1;j<=n;++j)
            if (can(A[i],A[j]))
                P[j] = i,ans[A[j].pos] = A[i].pos;
    }
    for(int i = 1;i<=n;++i)
        cout<<ans[i]<<' ';
    cout<<endl;
    return 1;
}

xx main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

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