oj.uz

Submission #983892

# Submission time Handle Problem Language Result Execution time Memory
983892 2024-05-16T07:47:31 Z SyedSohaib_123 Circle selection (APIO18_circle_selection) C++17
0 / 100
 3000 ms 380820 KB 
#include<bits/stdc++.h>
 
 
 
using namespace std;
 
 
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
 
 
 
#define str string
#define append push_back
#define vector deque
#define vi vector<int>
#define int long long
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define endl '\n'
#define all(ls) ls.begin(),ls.end()
#define sorted(ls) sort(ls.begin(),ls.end());
#define reversed(ls) reverse(ls.begin(),ls.end());
#define print(n) for(auto i:n)cout<<i<<' ';cout<<endl;
#define input(n,ls,m) deque<n>ls(m);for(int i=0;i<m;i++)cin>>ls[i];
#define len(s) s.size()
#define ff first
#define ss second
#define N (int const) 1e5+1
#define pii pair<int,int>
#define SQ(x) ((x)*(x))
#define float double
 
 
int mod=1e9+7;
int mod1=998244353;
 
 
 
int sum_(vector<int>ls){int s=0;for(auto i:ls){s+=i;}return s;}
int min(int a,int b){if (a>b){return b;}return a;}
int max(int a,int b){if (a<b){return b;}return a;}
 
 
 
//......................................tHe ReaL cOdE beGinS HerE....................................../
 
 
 
 
void solve(){
    int n;
    cin>>n;
    vector<int>plane[n];
    map<int,bool>mp;
    for(int i=0;i<n;i++){
        input(int,a,3);
        mp[i]=0;
        a={a[2],n-i,a[0],a[1]};
        plane[i]=a;
    }
    sort(plane,plane+n);
    reverse(plane,plane+n);
    vi ans(n,0);
    for(int i=0;i<n;i++){
        ans[i]=i;
        plane[i][1]=n-plane[i][1];
    }
    for(auto i:plane){
        if(mp[i[1]]) continue;
        mp[i[1]]=1;
        for(auto j:plane){
            if(i[1]==j[1] or mp[j[1]]){continue;}
            int dist=ceil(sqrtl(SQ(j[2]-i[2])+SQ(j[3]-i[3])));
            if(dist<=j[0]+i[0]){
                mp[j[1]]=1;
                ans[j[1]]=i[1];
            }
        }
    }
    for(auto i:ans){
        cout<<i+1<<' ';
    }
    cout<<endl;
}
 
 
 
 
 
signed main(){
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 1624 KB Output is correct
17 Correct 3 ms 1624 KB Output is correct
18 Correct 3 ms 1628 KB Output is correct
19 Correct 12 ms 6616 KB Output is correct
20 Correct 12 ms 6748 KB Output is correct
21 Correct 16 ms 6604 KB Output is correct
22 Execution timed out 3017 ms 6744 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1709 ms 380792 KB Output is correct
2 Correct 1951 ms 380820 KB Output is correct
3 Correct 1719 ms 380392 KB Output is correct
4 Correct 1974 ms 380648 KB Output is correct
5 Execution timed out 3102 ms 378452 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 3082 ms 126420 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 3071 ms 378432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 1624 KB Output is correct
17 Correct 3 ms 1624 KB Output is correct
18 Correct 3 ms 1628 KB Output is correct
19 Correct 12 ms 6616 KB Output is correct
20 Correct 12 ms 6748 KB Output is correct
21 Correct 16 ms 6604 KB Output is correct
22 Execution timed out 3017 ms 6744 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 1624 KB Output is correct
17 Correct 3 ms 1624 KB Output is correct
18 Correct 3 ms 1628 KB Output is correct
19 Correct 12 ms 6616 KB Output is correct
20 Correct 12 ms 6748 KB Output is correct
21 Correct 16 ms 6604 KB Output is correct
22 Execution timed out 3017 ms 6744 KB Time limit exceeded
23 Halted 0 ms 0 KB -