oj.uz

답안 #499265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499265 2021-12-27T16:12:08 Z _martynas 원 고르기 (APIO18_circle_selection) C++14
45 / 100
 1812 ms 545032 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1e9+7;

const int MAX_N = 3e5+5;

int n;
ll X[MAX_N], Y[MAX_N], R[MAX_N];
int P[MAX_N];
bool visited[MAX_N];

struct Quad
{
    ll l, r, bot, top;
    array<Quad*, 4> childs = {};
    int idx;
    int sz;

    Quad()
    {
    }

    Quad(ll _l, ll _r, ll _bot, ll _top)
        : l(_l), r(_r), bot(_bot), top(_top)
    {
        idx = -1;
        sz = 0;
    }

    void add(int x, int y, int idx)
    {
        if(x < l || x > r || y < bot || y > top) {
            return;
        }

        sz++;
//        cerr << "l = " << l << ", r = " << r << ", "
//             << "bot = " << bot << ", top = " << top << "\n";
        if(l == r && bot == top) {
            this->idx = idx;
        }
        else {
            ll midH, midV;
            midH = l+(r-l)/2;
            midV = bot+(top-bot)/2;

            if(l != r && top != bot) {
                if(childs[0] == nullptr && !(x < l || x > midH || y < bot || y > midV)) {
                    childs[0] = new Quad(l, midH, bot, midV);
                }
                else if(childs[1] == nullptr && !(x < midH+1 || x > r || y < bot || y > midV)) {
                    childs[1] = new Quad(midH+1, r, bot, midV);
                }
                else if(childs[2] == nullptr && !(x < l || x > midH || y < midV+1 || y > top)) {
                    childs[2] = new Quad(l, midH, midV+1, top);
                }
                else if(childs[3] == nullptr && !(x < midH+1 || x > r || y < midV+1 || y > top)) {
                    childs[3] = new Quad(midH+1, r, midV+1, top);
                }
            }
            else if(l != r) {
                if(childs[0] == nullptr && !(x < l || x > midH || y < bot || y > top)) {
                    childs[0] = new Quad(l, midH, bot, midV);
                }
                else if(childs[1] == nullptr && !(x < midH+1 || x > r || y < bot || y > top)) {
                    childs[1] = new Quad(midH+1, r, bot, top);
                }
            }
            else if(top != bot) {
                if(childs[0] == nullptr && !(x < l || x > r || y < bot || y > midV)) {
                    childs[0] = new Quad(l, r, bot, midV);
                }
                else if(childs[1] == nullptr && !(x < l || x > r || y < midV+1 || y > top)) {
                    childs[1] = new Quad(l, r, midV+1, top);
                }
            }

            for(int k = 0; k < 4; k++) {
                if(childs[k] != nullptr) {
                    childs[k]->add(x, y, idx);
                }
            }
        }
    }

    void setInRange(ll x, ll y, ll radius, int idx)
    {
        if(x+2*radius < l || x-2*radius > r || y+2*radius < bot || y-2*radius > top || sz == 0) {
            return;
        }
//        cerr << "l = " << l << ", r = " << r << ", "
//             << "bot = " << bot << ", top = " << top << "\n";
        if(l == r && bot == top) {
            if((R[idx]+R[this->idx])*(R[idx]+R[this->idx])
                >= llabs(X[idx]-X[this->idx])*llabs(X[idx]-X[this->idx])
                +llabs(Y[idx]-Y[this->idx])*llabs(Y[idx]-Y[this->idx])) {
                P[this->idx] = idx;
                visited[this->idx] = true;
                sz--;
            }
            return;
        }

        int cnt = 0;
        for(int k = 0; k < 4; k++) {
            if(childs[k] != nullptr) {
                childs[k]->setInRange(x, y, radius, idx);
                cnt += childs[k]->sz;
            }
        }
        sz = cnt;
    }
};

Quad Q(-1000000000, 1000000000, -1000000000, 1000000000);

int main()
{
//    cerr << "0:\n";
//    Q.add(0, 0, 0);
//    cerr << "1:\n";
//    Q.add(2, 2, 1);
//    cerr << "2:\n";
//    Q.add(-3, -3, 2);
//
//    cerr << "P:\n";
//    Q.setInRange(0, 1, 1, 3);
//    for(int i = 0; i < 3; i++) {
//        cerr << i << ": " << P[i] << "\n";
//    }

    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> X[i] >> Y[i] >> R[i];
    }
    iota(P, P+n, 0);

    // *Don't* handle circles at the same position
//    map<pair<int, int>, int> M;
//    for(int i = 0; i < n; i++) {
//        auto it = M.find({X[i], Y[i]});
//        if(it != M.end()) {
//            if(R[it->second] < R[i]) {
//                visited[it->second] = true;
//                P[it->second] = i;
//                M[{X[i], Y[i]}] = i;
//            }
//            else {
//                visited[i] = true;
//                P[i] = it->second;
//            }
//        }
//        else {
//            M[{X[i], Y[i]}] = i;
//        }
//    }

    for(int i = 0; i < n; i++) {
        //cerr << i << " started\n";
        Q.add(X[i], Y[i], i);
        //cerr << i << " finished\n";
    }

    vector<int> I(n);
    iota(I.begin(), I.end(), 0);
    sort(I.begin(), I.end(),
    [&](int a, int b)
    {
        return R[a] > R[b] || (R[a] == R[b] && a < b);
    });

    for(int i = 0; i < n; i++) {
        int idx = I[i];
        if(visited[idx]) continue;
        //cerr << idx << ": " << Q.sz << "->";
        Q.setInRange(X[idx], Y[idx], R[idx], idx);
        //cerr << Q.sz << "\n";
    }

//    for(int i = 0; i < n; i++) {
//        cerr << i << ": " << P[i] << "\n";
//    }

    for(int i = 0; i < n; i++) {
        cout << 1+P[i] << " ";
    }
    cout << "\n";

    return 0;
}
/*
11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 408 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 420 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 1 ms 428 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 428 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 5 ms 2360 KB Output is correct
17 Correct 4 ms 2124 KB Output is correct
18 Correct 4 ms 2108 KB Output is correct
19 Correct 19 ms 9264 KB Output is correct
20 Correct 19 ms 7412 KB Output is correct
21 Correct 20 ms 9912 KB Output is correct
22 Correct 22 ms 9252 KB Output is correct
23 Correct 22 ms 8472 KB Output is correct
24 Correct 22 ms 9572 KB Output is correct
25 Correct 23 ms 10156 KB Output is correct
26 Correct 22 ms 9780 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1090 ms 297048 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 560 ms 187964 KB Output is correct
3 Correct 1812 ms 545000 KB Output is correct
4 Correct 1810 ms 545032 KB Output is correct
5 Correct 1747 ms 487624 KB Output is correct
6 Correct 826 ms 263244 KB Output is correct
7 Correct 400 ms 138156 KB Output is correct
8 Correct 71 ms 28364 KB Output is correct
9 Correct 1766 ms 493944 KB Output is correct
10 Correct 1620 ms 511024 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1604 ms 498864 KB Output is correct
2 Correct 1519 ms 476212 KB Output is correct
3 Correct 1507 ms 499260 KB Output is correct
4 Correct 1622 ms 514716 KB Output is correct
5 Correct 1543 ms 496724 KB Output is correct
6 Correct 1330 ms 490180 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 408 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 420 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 1 ms 428 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 428 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 5 ms 2360 KB Output is correct
17 Correct 4 ms 2124 KB Output is correct
18 Correct 4 ms 2108 KB Output is correct
19 Correct 19 ms 9264 KB Output is correct
20 Correct 19 ms 7412 KB Output is correct
21 Correct 20 ms 9912 KB Output is correct
22 Correct 22 ms 9252 KB Output is correct
23 Correct 22 ms 8472 KB Output is correct
24 Correct 22 ms 9572 KB Output is correct
25 Correct 23 ms 10156 KB Output is correct
26 Correct 22 ms 9780 KB Output is correct
27 Correct 41 ms 18620 KB Output is correct
28 Correct 38 ms 17628 KB Output is correct
29 Correct 39 ms 18480 KB Output is correct
30 Correct 46 ms 17736 KB Output is correct
31 Correct 42 ms 17588 KB Output is correct
32 Correct 45 ms 18380 KB Output is correct
33 Correct 413 ms 166956 KB Output is correct
34 Correct 434 ms 174764 KB Output is correct
35 Correct 432 ms 170672 KB Output is correct
36 Correct 502 ms 168968 KB Output is correct
37 Correct 521 ms 176300 KB Output is correct
38 Correct 539 ms 171620 KB Output is correct
39 Incorrect 845 ms 19064 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 408 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 420 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 1 ms 428 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 428 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 5 ms 2360 KB Output is correct
17 Correct 4 ms 2124 KB Output is correct
18 Correct 4 ms 2108 KB Output is correct
19 Correct 19 ms 9264 KB Output is correct
20 Correct 19 ms 7412 KB Output is correct
21 Correct 20 ms 9912 KB Output is correct
22 Correct 22 ms 9252 KB Output is correct
23 Correct 22 ms 8472 KB Output is correct
24 Correct 22 ms 9572 KB Output is correct
25 Correct 23 ms 10156 KB Output is correct
26 Correct 22 ms 9780 KB Output is correct
27 Incorrect 1090 ms 297048 KB Output isn't correct
28 Halted 0 ms 0 KB -