oj.uz

Submission #971554

# Submission time Handle Problem Language Result Execution time Memory
971554 2024-04-29T00:19:05 Z irmuun Circle selection (APIO18_circle_selection) C++17
0 / 100
 3000 ms 1048576 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

ll dist(ll x1,ll y1,ll x2,ll y2){
    return abs(x1-x2)*abs(x1-x2)+abs(y1-y2)*abs(y1-y2);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin>>n;
    ll x[n+5],y[n+5],r[n+5];
    set<pair<ll,ll>>st;
    for(ll i=1;i<=n;i++){
        cin>>x[i]>>y[i]>>r[i];
        st.insert({-r[i],i});
    }
    vector<ll>adj[n+5];
    for(ll i=1;i<=n;i++){
        for(ll j=i+1;j<=n;j++){
            if(dist(x[i],y[i],x[j],y[j])<=(r[i]+r[j])*(r[i]+r[j])){
                adj[i].pb(j);
                adj[j].pb(i);
            }
        }
    }
    vector<ll>ans(n+5,0);
    while(!st.empty()){
        ll i=st.begin()->ss;
        st.erase(st.begin());
        if(ans[i]>0) continue;
        queue<ll>q;
        q.push(i);
        ans[i]=i;
        while(!q.empty()){
            ll j=q.front();
            q.pop();
            for(auto k:adj[j]){
                if(ans[k]==0){
                    ans[k]=i;
                    q.push(k);
                }
            }
        }
    }
    for(ll i=1;i<=n;i++){
        cout<<ans[i]<<' ';
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 2490 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3088 ms 14168 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3100 ms 41040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -