제출 #1173427

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

circle_selection

#include "bits/stdc++.h"

using namespace std;
 
#define ll long long
#define SZ(s) (int)s.size()

const int N = 5e5 + 5;
const int M = 1e9 + 7;

bool check(ll x, ll y, ll r, ll x1, ll y1, ll r1) {
    return ((abs(x-x1) * abs(x-x1) + abs(y-y1) * abs(y-y1)) <= ((r + r1) * (r + r1)));
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int n;
    cin >> n;
    vector <int> x(n+1), y(n+1), r(n+1);
    for(int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i] >> r[i];
    }
    vector <int> vis(n+1, 0);
    while(1) {
        int k = 0, r1 = 0;
        for(int i = 1; i <= n; i++) {
            if(!vis[i]) {
                if(r[i] > r1) {
                    k = i;
                    r1 = r[i];
                }
            }
        }
        if(k == 0) break;
        for(int i = 1; i <= n; i++) {
            if(!vis[i]) {
                if(check(x[i], y[i], r[i], x[k], y[k], r[k])) {
                    vis[i] = k;
                }
            }
        }
    }

    for(int i = 1; i <= n; i++) {
        cout << vis[i] << ' ';
    }

    return 0;
}

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