제출 #698796

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

circle_selection

#include "bits/stdc++.h"
#define ll long long
using namespace std;
const ll mod = 1000000007;

signed main () {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("cowland.in","r",stdin);
    // freopen("cowland.out","w",stdout);

    int n;
    cin >> n;
    vector<pair<int, pair<int, int>>> v;
    int rr[n];
    for(int i = 0; i < n; i++) {
        int x, y, r;
        cin >> x >> y >> r;
        rr[i] = r;
        v.push_back({x - r, {0, i}});
        v.push_back({x + r, {1, i}});
    }
    sort(v.begin(), v.end());
    priority_queue<pair<int, int>> pq;
    int ans[n];
    for(int i = 0; i < n; i++)
        ans[i] = -1;
    bool b[n] = {};
    for(int i = n * 2 - 1; i >= 0; i--) {
        if(v[i].second.first == 0) {
            if(!pq.empty())
                ans[v[i].second.second] = pq.top().second + 1;
            pq.push({rr[v[i].second.second], v[i].second.second});
        }
        else {
            b[v[i].second.second] = 1;
            while(!pq.empty() && (b[pq.top().second] || ans[pq.top().second]))
                b[pq.top().second] = 0, pq.pop();
        }
    }
    for(int i = 0; i < n * 2; i++) {
        if(v[i].second.first == 0) {
            if(!pq.empty())
            ans[v[i].second.second] = pq.top().second + 1;
            pq.push({rr[v[i].second.second], v[i].second.second});
        }
        else {
            b[v[i].second.second] = 1;
            while(!pq.empty() && (b[pq.top().second] || ans[pq.top().second]))
            b[pq.top().second] = 0, pq.pop();
        }
    }
    for(int i = 0; i < n; i++) {
        if(ans[i] == -1)
            ans[i] = i + 1;
        cout << ans[i] << " ";
    }

    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