Submission #743410

#	Time	Username	Problem	Language	Result	Execution time	Memory
743410		alvingogo	Circle selection (APIO18_circle_selection)	C++14	12 / 100	823 ms	63564 KiB

circle_selection

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

typedef pair<int,int> pii;
pii operator+(pii a,pii b){
    return {a.fs+b.fs,a.sc+b.sc};
}
pii operator-(pii a,pii b){
    return {a.fs-b.fs,a.sc-b.sc};
}
int dot(pii a,pii b){
    return a.fs*b.fs+a.sc*b.sc;
}
int cross(pii a,pii b){
    return a.fs*b.sc-b.fs*a.sc;
}
int dis(pii a,pii b){
    return dot(a-b,a-b);
}
signed main(){
    AquA;
    int n;
    cin >> n;
    vector<pair<pii,int> > vp(n);
    vector<pii> g;
    vector<int> from(n,-1);
    set<pii> sl,sr;
    vector<int> l(n),r(n);
    for(int i=0;i<n;i++){
        cin >> vp[i].fs.fs >> vp[i].fs.sc >> vp[i].sc;
        g.push_back({-vp[i].sc,i});
        l[i]=vp[i].fs.fs-vp[i].sc;
        r[i]=vp[i].fs.fs+vp[i].sc;
        sl.insert({l[i],i});
        sr.insert({r[i],i});
    }
    sort(g.begin(),g.end());
    for(int k=0;k<n;k++){
        int i=g[k].sc;
        if(from[i]>=0){
            continue;
        }
        for(auto it=sl.lower_bound(pii(l[i],-1));it!=sl.end();it=sl.erase(it)){
            if(it->fs>r[i]){
                break;
            }
            from[it->sc]=i;
            sr.erase(pii(r[it->sc],it->sc));
        }
        for(auto it=sr.lower_bound(pii(l[i],-1));it!=sr.end();it=sr.erase(it)){
            if(it->fs>r[i]){
                break;
            }
            from[it->sc]=i;
            sl.erase(pii(l[it->sc],it->sc));
        }
    }
    for(int i=0;i<n;i++){
        cout << from[i]+1 << " ";
    }
    return 0;
}

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