Submission #744533

#	Time	Username	Problem	Language	Result	Execution time	Memory
744533		Abito	Circle selection (APIO18_circle_selection)	C++14	12 / 100	1389 ms	98408 KiB

circle_selection

#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define ep insert
#define pow pwr
#define sqrt sqrtt
#define elif else if
#define y1 YONE
#define int long long
using namespace std;
const int N=1e6+5;
int n,ans[N];
pair<pair<int,int>,int> a[N];
vector<int> adj[N];
map<int,int> mp;
bool cmp(pair<pair<int,int>,int> x,pair<pair<int,int>,int> y){
    if (x.F.S-x.F.F!=y.F.S-y.F.F) return x.F.S-x.F.F>y.F.S-y.F.F;
    return x.S<y.S;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    for (int i=1;i<=n;i++){
        int x,y,r;
        cin>>x>>y>>r;
        a[i]={{x-r,x+r},i};
        mp[x+r]++;
        mp[x-r]++;
    }
    sort(a+1,a+1+n,cmp);
    int c=0;
    for (auto u:mp){
        c++;
        mp[u.F]=c;
    }
    for (int i=1;i<=n;i++){
        a[i].F={mp[a[i].F.F],mp[a[i].F.S]};
        adj[a[i].F.F].pb(i);
        adj[a[i].F.S].pb(i);
    }
    for (int i=1;i<=n;i++){
        if (ans[a[i].S]) continue;
        for (int j=a[i].F.F;j<=a[i].F.S;j++){
            for (auto u:adj[j]){
                if (!ans[a[u].S]) ans[a[u].S]=a[i].S;
            }adj[j].clear();
        }
    }
    for (int i=1;i<=n;i++) cout<<ans[i]<<' ';
    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