oj.uz

답안 #983851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983851 2024-05-16T07:24:31 Z SyedSohaib_123 원 고르기 (APIO18_circle_selection) C++17
0 / 100
 3000 ms 233616 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<vector<int>>plane;
    map<int,bool>mp;
    for(int i=0;i<n;i++){
        input(int,a,3);
        a={a[2],n-i,a[0],a[1]};
        plane.append(a);
    }
    sorted(plane);
    reversed(plane);
    vi ans(n,0);
    for(int i=0;i<n;i++)
        ans[i]=i;
    for(auto i:plane){
        if(mp[n-i[1]]) continue;
        mp[n-i[1]]=1;
        for(auto j:plane){
            if(i[1]==j[1] or mp[n-j[1]]){continue;}
            int dist=ceil(sqrtl(SQ(j[2]-i[2])+SQ(j[3]-i[3])));
            if(dist<=j[0]+i[0]){
                mp[n-j[1]]=1;
                ans[n-j[1]]=n-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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 684 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 428 KB Output is correct
16 Correct 3 ms 1220 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 2 ms 1072 KB Output is correct
19 Correct 11 ms 4188 KB Output is correct
20 Correct 11 ms 4440 KB Output is correct
21 Correct 16 ms 4464 KB Output is correct
22 Execution timed out 3066 ms 4188 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1361 ms 233616 KB Output is correct
2 Correct 1631 ms 233524 KB Output is correct
3 Correct 1326 ms 233216 KB Output is correct
4 Correct 1409 ms 233448 KB Output is correct
5 Execution timed out 3061 ms 229200 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3081 ms 77996 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3076 ms 232712 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 684 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 428 KB Output is correct
16 Correct 3 ms 1220 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 2 ms 1072 KB Output is correct
19 Correct 11 ms 4188 KB Output is correct
20 Correct 11 ms 4440 KB Output is correct
21 Correct 16 ms 4464 KB Output is correct
22 Execution timed out 3066 ms 4188 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 684 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 428 KB Output is correct
16 Correct 3 ms 1220 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 2 ms 1072 KB Output is correct
19 Correct 11 ms 4188 KB Output is correct
20 Correct 11 ms 4440 KB Output is correct
21 Correct 16 ms 4464 KB Output is correct
22 Execution timed out 3066 ms 4188 KB Time limit exceeded
23 Halted 0 ms 0 KB -