제출 #253001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253001		infinite_iq	원 고르기 (APIO18_circle_selection)	C++14	0 / 100	10 ms	896 KiB

circle_selection

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll mod=987654321;
const ld Pi=acos(-1);
int n ;
pair < pi , pi > a [5009] ;
int done [5009] , p [5009] ;    
bool cmp ( pair < pi , pi > x , pair < pi , pi > y ) {
        if ( x .fi.fi == y .fi.fi ) {
                return x .fi.se < y .fi.se ;
        }
        return x .fi.fi > y .fi.fi ;
}
int main () {
        cin >> n ;
        for ( int i = 0 ; i < n ; i ++ ) {
                cin >> a [i] .se.fi >> a [i] .se.se >> a [i] .fi.fi ;
                a [i] .fi.se = i ;
        }
        sort ( a , a + n , cmp ) ;
        for ( int i = 0 ; i < n ; i ++ ) {
                if ( done [i] ) C ;
                int x1 = a [i] .se.fi , y1 = a [i] .se.se , r1 = a [i] .fi.fi , id1 = a [i] .fi.se ;
                for ( int j = i ; j < n ; j ++ ) {
                        if ( done [j] ) C ;
                        int x2 = a [j] .se.fi , y2 = a [j] .se.se , r2 = a [j] .fi.fi , id2 = a [j] .fi.se ;
                        if ( ( r1 + r2 ) * ( r1 + r2 ) >= ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ) ) {
                                p [id2] = id1 ;
                                done [j] = 1 ;
                        }
                }
        }
        for ( int i = 0 ; i < n ; i ++ )
                cout << p [i] + 1 << " " ;
        cout << endl ;
}

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