oj.uz

Submission #1073868

# Submission time Handle Problem Language Result Execution time Memory
1073868 2024-08-25T00:52:14 Z ngrace Circle selection (APIO18_circle_selection) C++14
34 / 100
 3000 ms 820892 KB 
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second

struct Circle{
    ll x, y, r, i;
};

int N;
v<Circle> C;

bool compC(Circle& a, Circle& b){
    if(a.r==b.r) return a.i<b.i;
    return a.r>b.r;
}
bool isect(Circle& a, Circle& b){
    ll dx=a.x-b.x;
    ll dy=a.y-b.y;
    ll r=a.r+b.r;
    return dx*dx+dy*dy <= r*r;
}

v<ll> eBy;

void sub1(){
    for(int i=0; i<N; i++){
        if(eBy[C[i].i]!=-1) continue;
        eBy[C[i].i] = C[i].i;
        for(int j=i+1; j<N; j++){
            if(eBy[C[j].i]==-1 && isect(C[i], C[j])){
                eBy[C[j].i] = C[i].i;
            }
        }
    }
}

void sub2(){
    set<ii> pts;
    for(int i=0; i<N; i++){
        pts.insert(make_pair(C[i].x-C[i].r, i));
        pts.insert(make_pair(C[i].x+C[i].r, i));
    }

    for(int i=0; i<N; i++){
        if(eBy[C[i].i]!=-1) continue;
        v<int> del;
        auto it = pts.lower_bound(make_pair(C[i].x-C[i].r, -1));
        while(it!=pts.end() && (*it).fi<=C[i].x+C[i].r){
            del.push_back((*it).se);
            it++;
        }
        for(int ind:del){
            eBy[C[ind].i] = C[i].i;
            pts.erase(make_pair(C[ind].x-C[ind].r, ind));
            pts.erase(make_pair(C[ind].x+C[ind].r, ind));
        }
    }
}

void sub3(){
    set<ii> xs;
    set<ii> ys;
    for(int i=0; i<N; i++){
        ys.insert({C[i].y-C[i].r, i});
        ys.insert({C[i].y+C[i].r, i});
        eBy[i] = i;
    }
    for(ii y:ys){
        ll x = C[y.se].x;

        if(C[y.se].y+C[y.se].r==y.fi) xs.erase({x,y.se});

        auto it = xs.lower_bound({x,-1});
        if(it!=xs.end()){
            ll ind = (*it).se;
            if(isect(C[y.se], C[ind])){
                ll e = (compC(C[y.se], C[ind]) ? y.se : ind);
                eBy[C[y.se].i] = C[e].i;
                eBy[C[ind].i] = C[e].i;
            }
        }
        if(it!=xs.begin()){
            it--;
            ll ind = (*it).se;
            if(isect(C[y.se], C[ind])){
                ll e = (compC(C[y.se], C[ind]) ? y.se : ind);
                eBy[C[y.se].i] = C[e].i;
                eBy[C[ind].i] = C[e].i;
            }
        }

        if(C[y.se].y-C[y.se].r == y.fi) xs.insert({x,y.se});
    }
}

void sub4(){
    map<ii, set<ll>> grid;
    for(int i=0; i<N; i++){
        grid[{C[i].x/C[i].r, C[i].y/C[i].r}].insert(i);
    }

    for(int i=0; i<N; i++){
        Circle cur = C[i];
        if(eBy[cur.i]!=-1) continue;
        for(ll x=cur.x/cur.r - 2; x<=cur.x/cur.r+2; x++){
            for(ll y=cur.y/cur.r-2; y<=cur.y/cur.r+2; y++){
                v<ll> del;
                for(ll c:grid[{x,y}]){
                    if(isect(C[c],cur)) del.push_back(c);
                }
                for(ll c:del){
                    eBy[C[c].i] = cur.i;
                    grid[{x,y}].erase(c);
                }
            }
        }
    }
}

void full(){

}

int main(){
    cin>>N;
    bool s2 = true;
    bool s4 = true;
    for(int i=0; i<N; i++){
        ll x,y,r;
        cin>>x>>y>>r;
        C.push_back({x,y,r,i});
        s2 = s2 && y==0;
        s4 = s4 && r==C[0].r;
    }
    sort(C.begin(), C.end(), compC);

    eBy = v<ll>(N,-1);

    if(N<=5000) sub1();
    else if(s2) sub2();
    else if(s4) sub4();
    else sub3();

    for(int i:eBy) cout<<i+1<<" ";
    cout<<endl;
}

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 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 728 KB Output is correct
20 Correct 6 ms 728 KB Output is correct
21 Correct 5 ms 728 KB Output is correct
22 Correct 21 ms 724 KB Output is correct
23 Correct 23 ms 728 KB Output is correct
24 Correct 22 ms 732 KB Output is correct
25 Correct 22 ms 728 KB Output is correct
26 Correct 21 ms 728 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 854 ms 56732 KB Output is correct
2 Correct 840 ms 53608 KB Output is correct
3 Correct 798 ms 55708 KB Output is correct
4 Correct 821 ms 56744 KB Output is correct
5 Correct 636 ms 52380 KB Output is correct
6 Correct 674 ms 53148 KB Output is correct
7 Correct 635 ms 51528 KB Output is correct
8 Correct 639 ms 51620 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 175 ms 17340 KB Output is correct
3 Correct 692 ms 53328 KB Output is correct
4 Correct 738 ms 51560 KB Output is correct
5 Correct 731 ms 51796 KB Output is correct
6 Correct 327 ms 28916 KB Output is correct
7 Correct 150 ms 15544 KB Output is correct
8 Correct 25 ms 3260 KB Output is correct
9 Correct 708 ms 51732 KB Output is correct
10 Correct 763 ms 51688 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3043 ms 820892 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 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 728 KB Output is correct
20 Correct 6 ms 728 KB Output is correct
21 Correct 5 ms 728 KB Output is correct
22 Correct 21 ms 724 KB Output is correct
23 Correct 23 ms 728 KB Output is correct
24 Correct 22 ms 732 KB Output is correct
25 Correct 22 ms 728 KB Output is correct
26 Correct 21 ms 728 KB Output is correct
27 Incorrect 20 ms 2256 KB Output isn't correct
28 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 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 728 KB Output is correct
20 Correct 6 ms 728 KB Output is correct
21 Correct 5 ms 728 KB Output is correct
22 Correct 21 ms 724 KB Output is correct
23 Correct 23 ms 728 KB Output is correct
24 Correct 22 ms 732 KB Output is correct
25 Correct 22 ms 728 KB Output is correct
26 Correct 21 ms 728 KB Output is correct
27 Correct 854 ms 56732 KB Output is correct
28 Correct 840 ms 53608 KB Output is correct
29 Correct 798 ms 55708 KB Output is correct
30 Correct 821 ms 56744 KB Output is correct
31 Correct 636 ms 52380 KB Output is correct
32 Correct 674 ms 53148 KB Output is correct
33 Correct 635 ms 51528 KB Output is correct
34 Correct 639 ms 51620 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 175 ms 17340 KB Output is correct
37 Correct 692 ms 53328 KB Output is correct
38 Correct 738 ms 51560 KB Output is correct
39 Correct 731 ms 51796 KB Output is correct
40 Correct 327 ms 28916 KB Output is correct
41 Correct 150 ms 15544 KB Output is correct
42 Correct 25 ms 3260 KB Output is correct
43 Correct 708 ms 51732 KB Output is correct
44 Correct 763 ms 51688 KB Output is correct
45 Execution timed out 3043 ms 820892 KB Time limit exceeded
46 Halted 0 ms 0 KB -