oj.uz

답안 #1075363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075363 2024-08-26T04:24:41 Z ngrace 원 고르기 (APIO18_circle_selection) C++14
49 / 100
 3000 ms 49836 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, v<ll>> grid;
    for(int i=0; i<N; i++){
        grid[{C[i].x/C[i].r, C[i].y/C[i].r}].push_back(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++){
                if(grid.find({x,y})==grid.end()) continue;
                for(ll c:grid[{x,y}]){
                    if(eBy[C[c].i]==-1 && isect(C[c],cur)) eBy[C[c].i] = cur.i;
                }
            }
        }
    }
}

void full(){
    map<ii, v<ll>> grid;
    for(ll ri = 30; ri>=0; ri--){
        ll r = (1<<ri);
        bool skip=false;
        for(int i=0; i<N; i++){
            if(eBy[C[i].i]==-1 && C[i].r>=r/2 && C[i].r<=r){
                skip=false;
                break;
            }
        }
        if(skip) continue;
        grid.clear();
        for(int i=0; i<N; i++){
            if(eBy[C[i].i]!=-1) continue;
            grid[{C[i].x/r, C[i].y/r}].push_back(i);
        }
        for(int i=0; i<N; i++){
            Circle& cur = C[i];
            if(cur.r<r/2) break;
            if(eBy[cur.i]!=-1 || cur.r>r) continue;
            for(ll x=cur.x/r - 2; x<=cur.x/r+2; x++){
                for(ll y=cur.y/r-2; y<=cur.y/r+2; y++){
                    if(grid.find({x,y})==grid.end()) continue;
                    for(ll c:grid[{x,y}]){
                        if(eBy[C[c].i]==-1 && isect(C[c],cur)) eBy[C[c].i] = cur.i;
                    }
                }
            }
        }
    }
}

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);

    full();
    // 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 344 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 440 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 2 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 6 ms 860 KB Output is correct
20 Correct 6 ms 960 KB Output is correct
21 Correct 6 ms 964 KB Output is correct
22 Correct 29 ms 1240 KB Output is correct
23 Correct 23 ms 1388 KB Output is correct
24 Correct 24 ms 1240 KB Output is correct
25 Correct 23 ms 1236 KB Output is correct
26 Correct 21 ms 1236 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 298 ms 24252 KB Output is correct
2 Correct 319 ms 24292 KB Output is correct
3 Correct 310 ms 24248 KB Output is correct
4 Correct 322 ms 24200 KB Output is correct
5 Correct 446 ms 22936 KB Output is correct
6 Correct 1097 ms 30872 KB Output is correct
7 Correct 539 ms 23192 KB Output is correct
8 Correct 693 ms 24512 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 344 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 440 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 2 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 6 ms 860 KB Output is correct
20 Correct 6 ms 960 KB Output is correct
21 Correct 6 ms 964 KB Output is correct
22 Correct 29 ms 1240 KB Output is correct
23 Correct 23 ms 1388 KB Output is correct
24 Correct 24 ms 1240 KB Output is correct
25 Correct 23 ms 1236 KB Output is correct
26 Correct 21 ms 1236 KB Output is correct
27 Correct 13 ms 984 KB Output is correct
28 Correct 10 ms 984 KB Output is correct
29 Correct 10 ms 984 KB Output is correct
30 Correct 47 ms 1992 KB Output is correct
31 Correct 44 ms 1988 KB Output is correct
32 Correct 47 ms 2004 KB Output is correct
33 Correct 116 ms 6580 KB Output is correct
34 Correct 118 ms 6548 KB Output is correct
35 Correct 104 ms 6580 KB Output is correct
36 Correct 686 ms 16056 KB Output is correct
37 Correct 775 ms 16056 KB Output is correct
38 Correct 682 ms 16056 KB Output is correct
39 Correct 367 ms 11104 KB Output is correct
40 Correct 433 ms 11148 KB Output is correct
41 Correct 363 ms 11244 KB Output is correct
42 Correct 302 ms 11648 KB Output is correct
43 Correct 615 ms 15720 KB Output is correct
44 Correct 616 ms 15884 KB Output is correct
45 Correct 619 ms 15760 KB Output is correct
46 Correct 631 ms 15768 KB Output is correct
47 Correct 591 ms 15800 KB Output is correct
48 Correct 602 ms 15848 KB Output is correct
49 Correct 602 ms 15800 KB Output is correct
50 Correct 644 ms 15768 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 344 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 440 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 2 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 6 ms 860 KB Output is correct
20 Correct 6 ms 960 KB Output is correct
21 Correct 6 ms 964 KB Output is correct
22 Correct 29 ms 1240 KB Output is correct
23 Correct 23 ms 1388 KB Output is correct
24 Correct 24 ms 1240 KB Output is correct
25 Correct 23 ms 1236 KB Output is correct
26 Correct 21 ms 1236 KB Output is correct
27 Correct 298 ms 24252 KB Output is correct
28 Correct 319 ms 24292 KB Output is correct
29 Correct 310 ms 24248 KB Output is correct
30 Correct 322 ms 24200 KB Output is correct
31 Correct 446 ms 22936 KB Output is correct
32 Correct 1097 ms 30872 KB Output is correct
33 Correct 539 ms 23192 KB Output is correct
34 Correct 693 ms 24512 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 632 ms 17352 KB Output is correct
37 Execution timed out 3006 ms 49836 KB Time limit exceeded
38 Halted 0 ms 0 KB -