oj.uz

Submission #440129

# Submission time Handle Problem Language Result Execution time Memory
440129 2021-07-01T15:55:39 Z KULIKOLD Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 7876 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],ans[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 = i;
    }
    sort(A+1,A+1+n,mc);
    for(int i = 1;i<=n;++i){
        if (P[i])
            continue;
        P[i] = i;
        ans[A[i].pos] = A[i].pos;
        for(int j = i+1;j<=n;++j)
            if (!P[j] && can(A[i],A[j]))
                P[j] = i,ans[A[j].pos] = A[i].pos;
    }
    for(int i = 1;i<=n;++i)
        cout<<ans[i]<<' ';
    cout<<endl;
    return 1;
}
int main() {

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

Subtask #1
7.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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 24 ms 636 KB Output is correct
23 Correct 23 ms 648 KB Output is correct
24 Correct 27 ms 592 KB Output is correct
25 Correct 25 ms 640 KB Output is correct
26 Correct 27 ms 644 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 41 ms 6724 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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 24 ms 636 KB Output is correct
23 Correct 23 ms 648 KB Output is correct
24 Correct 27 ms 592 KB Output is correct
25 Correct 25 ms 640 KB Output is correct
26 Correct 27 ms 644 KB Output is correct
27 Correct 7 ms 996 KB Output is correct
28 Correct 7 ms 972 KB Output is correct
29 Correct 7 ms 972 KB Output is correct
30 Correct 87 ms 948 KB Output is correct
31 Correct 92 ms 940 KB Output is correct
32 Correct 101 ms 956 KB Output is correct
33 Correct 71 ms 7804 KB Output is correct
34 Correct 63 ms 7876 KB Output is correct
35 Correct 64 ms 7704 KB Output is correct
36 Execution timed out 3073 ms 6464 KB Time limit exceeded
37 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 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 24 ms 636 KB Output is correct
23 Correct 23 ms 648 KB Output is correct
24 Correct 27 ms 592 KB Output is correct
25 Correct 25 ms 640 KB Output is correct
26 Correct 27 ms 644 KB Output is correct
27 Runtime error 48 ms 6672 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -