oj.uz

Submission #983895

# Submission time Handle Problem Language Result Execution time Memory
983895 2024-05-16T07:48:16 Z SyedSohaib_123 Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 362228 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];
    bool mp[n];
    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
7.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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 1556 KB Output is correct
17 Correct 2 ms 1644 KB Output is correct
18 Correct 2 ms 1628 KB Output is correct
19 Correct 11 ms 6236 KB Output is correct
20 Correct 11 ms 6236 KB Output is correct
21 Correct 12 ms 6312 KB Output is correct
22 Correct 1635 ms 6408 KB Output is correct
23 Correct 1684 ms 6544 KB Output is correct
24 Correct 1648 ms 6544 KB Output is correct
25 Correct 1788 ms 6532 KB Output is correct
26 Correct 1773 ms 6540 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1183 ms 362012 KB Output is correct
2 Correct 1226 ms 362228 KB Output is correct
3 Correct 1095 ms 361980 KB Output is correct
4 Correct 1089 ms 362060 KB Output is correct
5 Execution timed out 3074 ms 360020 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 504 KB Output is correct
2 Execution timed out 3083 ms 120088 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 3018 ms 359980 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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 1556 KB Output is correct
17 Correct 2 ms 1644 KB Output is correct
18 Correct 2 ms 1628 KB Output is correct
19 Correct 11 ms 6236 KB Output is correct
20 Correct 11 ms 6236 KB Output is correct
21 Correct 12 ms 6312 KB Output is correct
22 Correct 1635 ms 6408 KB Output is correct
23 Correct 1684 ms 6544 KB Output is correct
24 Correct 1648 ms 6544 KB Output is correct
25 Correct 1788 ms 6532 KB Output is correct
26 Correct 1773 ms 6540 KB Output is correct
27 Correct 27 ms 12888 KB Output is correct
28 Correct 23 ms 12636 KB Output is correct
29 Correct 26 ms 12636 KB Output is correct
30 Execution timed out 3086 ms 12664 KB Time limit exceeded
31 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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 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 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 3 ms 1556 KB Output is correct
17 Correct 2 ms 1644 KB Output is correct
18 Correct 2 ms 1628 KB Output is correct
19 Correct 11 ms 6236 KB Output is correct
20 Correct 11 ms 6236 KB Output is correct
21 Correct 12 ms 6312 KB Output is correct
22 Correct 1635 ms 6408 KB Output is correct
23 Correct 1684 ms 6544 KB Output is correct
24 Correct 1648 ms 6544 KB Output is correct
25 Correct 1788 ms 6532 KB Output is correct
26 Correct 1773 ms 6540 KB Output is correct
27 Correct 1183 ms 362012 KB Output is correct
28 Correct 1226 ms 362228 KB Output is correct
29 Correct 1095 ms 361980 KB Output is correct
30 Correct 1089 ms 362060 KB Output is correct
31 Execution timed out 3074 ms 360020 KB Time limit exceeded
32 Halted 0 ms 0 KB -