oj.uz

Submission #440112

# Submission time Handle Problem Language Result Execution time Memory
440112 2021-07-01T15:35:22 Z KULIKOLD Circle selection (APIO18_circle_selection) C++17
0 / 100
 66 ms 10432 KB 
//#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int DIM = 1E5+7;
const int INF = 1E9;
struct node{
    ll x,y,r,pos;
} A[DIM];
int P[DIM];
bool mc(const node &a,const node &b){
    if (a.r==b.r){
        return a.pos<b.pos;
    }
    return a.r>b.r;
}
bool can(const node &a,const node &b){
    return (a.r+b.r)*(a.r+b.r)>=(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
int solve(){
    int n;
    cin>>n;
    for(int i = 1;i<=n;++i){
        cin>>A[i].x>>A[i].y>>A[i].r>>A[i].pos;
    }
    sort(A+1,A+1+n,mc);
    for(int i = 1;i<=n;++i){
        if (P[i])
            continue;
        P[i] = i;
        for(int j = i+1;j<=n;++j)
            if (can(A[i],A[j]))
                P[j] = i;
    }
    for(int i = 1;i<=n;++i)
        cout<<P[i]<<' ';
    cout<<endl;
    return 1;
}
int main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 58 ms 9892 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 66 ms 10432 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -