oj.uz

Submission #1070592

# Submission time Handle Problem Language Result Execution time Memory
1070592 2024-08-22T15:40:58 Z thangdz2k7 Circle selection (APIO18_circle_selection) C++17
42 / 100
 1049 ms 62656 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 5;

long long sqr(long long x){ return x * x; }

struct circle{
    long long x, y, r;

    bool intersect(circle A){
        return sqr(x - A.x) + sqr(y - A.y) <= sqr(r + A.r);
    }
};

int n;
circle a[N];

namespace subtask1{
    int ans[N];

    void solve(){
        while (true){
            long long maxr = 0;
            int idx = 0;
            for (int i = 1; i <= n; ++ i) if (!ans[i] && a[i].r > maxr){
                idx = i;
                maxr = a[i].r;
            }
            if (!idx) break;
            for (int i = 1; i <= n; ++ i) if (!ans[i] && a[idx].intersect(a[i])) ans[i] = idx;
        }
        for (int i = 1; i <= n; ++ i) cout << ans[i] << ' ';
    }
}

vector <int> sr;

namespace subtask2{
    int ans[N];
    set <pair <int, int>> l, r;

    void solve(){
        for (int i = 1; i <= n; ++ i) {
            l.insert({a[i].x - a[i].r, i});
            r.insert({a[i].x + a[i].r, i});
        }

        for (int id : sr){
            if (ans[id]) continue;
            int le = a[id].x - a[id].r;
            int ri = a[id].x + a[id].r;
            auto it = l.lower_bound({le, 0});
            while (it != l.end() && it -> first <= ri){
                int del = it -> second;
                ans[del] = id;
                ++ it;
                l.erase({a[del].x - a[del].r, del});
                r.erase({a[del].x + a[del].r, del});
            }
            it = r.lower_bound({le, 0});
            while (it != r.end() && it -> first <= ri){
                int del = it -> second;
                ans[del] = id;
                ++ it;
                l.erase({a[del].x - a[del].r, del});
                r.erase({a[del].x + a[del].r, del});
            }
        }

        for (int i = 1; i <= n; ++ i) cout << ans[i] << ' ';
    }
}

namespace subtask4{
    using pii = pair <int, int>;

    map <pii, set <int>> grid;
    int ans[N];

    void solve(){
        int radius = a[1].r;
        for (int i = 1; i <= n; ++ i){
            int x = a[i].x / radius;
            int y = a[i].y / radius;
            grid[{x, y}].insert(i);
        }

        for (int id : sr){
            if (ans[id]) continue;
            int x = a[id].x / radius;
            int y = a[id].y / radius;
            for (int i = x - 2; i <= x + 2; ++ i){
                for (int j = y - 2; j <= y + 2; ++ j){
                    auto it1 = grid.find({i, j});
                    if (it1 == grid.end()) continue;
                    for (auto it = (it1 -> second).begin(); it != (it1 -> second).end();){
                        if (a[id].intersect(a[*it])){
                            ans[*it] = id;
                            it = (it1 -> second).erase(it);
                        }
                        else ++ it;
                    }
                }
            }
        }

        for (int i = 1; i <= n; ++ i) cout << ans[i] << ' ';
    }
}

namespace Accepted{
    using pii = pair <int, int>;

    int block = 0, ans[N];
    set <int> remain;
    map <pii, set <int>> grid;

    void recalc(){
        grid.clear();
        for (int id : remain) {
            int x = a[id].x / block;
            int y = a[id].y / block;
            grid[{x, y}].insert(id);
        }
    }

    void solve(){
        for (int i = 1; i <= n; ++ i) remain.insert(i);
        for (int id : sr){
            if (ans[id]) continue;
            if (block == 0 || a[id].r * 2 <= block){
                block = a[id].r;
                recalc();
            }

            int x = a[id].x / block;
            int y = a[id].y / block;
            for (int i = x - 2; i <= x + 2; ++ i){
                for (int j = y - 2; j <= y + 2; ++ j){
                    auto it1 = grid.find({i, j});
                    if (it1 == grid.end()) continue;
                    for (auto it = (it1 -> second).begin(); it != (it1 -> second).end();){
                        if (a[id].intersect(a[*it])){
                            ans[*it] = id;
                            it = (it1 -> second).erase(it);
                            remain.erase(*it);
                        }
                        else ++ it;
                    }
                }
            }
        }

        for (int i = 1; i <= n; ++ i) cout << ans[i] << ' ';
    }
}

void solve(){
    cin >> n;
    bool ck2 = true;
    bool ck4 = true;
    for (int i = 1; i <= n; ++ i) {
        sr.push_back(i);
        cin >> a[i].x >> a[i].y >> a[i].r;
        if (a[i].y != 0) ck2 = false;
        if (i > 1 && a[i].r != a[i - 1].r) ck4 = false;
    }
    sort(sr.begin(), sr.end(), [&](int u, int v){
        if (a[u].r == a[v].r) return u < v;
        return a[u].r > a[v].r;
    });

    if (n <= 5000) subtask1::solve();
    else if (ck2) subtask2::solve();
    else if (ck4) subtask4::solve();
    else Accepted::solve();
}

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 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4580 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 3 ms 4700 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 69 ms 4748 KB Output is correct
23 Correct 74 ms 4696 KB Output is correct
24 Correct 68 ms 4736 KB Output is correct
25 Correct 67 ms 4700 KB Output is correct
26 Correct 97 ms 4736 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 46788 KB Output is correct
2 Correct 456 ms 46792 KB Output is correct
3 Correct 473 ms 46532 KB Output is correct
4 Correct 497 ms 46788 KB Output is correct
5 Correct 419 ms 45104 KB Output is correct
6 Correct 453 ms 44996 KB Output is correct
7 Correct 406 ms 45260 KB Output is correct
8 Correct 444 ms 45100 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1049 ms 28844 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 961 ms 62656 KB Output is correct
2 Correct 759 ms 61892 KB Output is correct
3 Correct 283 ms 42440 KB Output is correct
4 Correct 781 ms 62180 KB Output is correct
5 Correct 730 ms 62408 KB Output is correct
6 Correct 244 ms 35872 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4580 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 3 ms 4700 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 69 ms 4748 KB Output is correct
23 Correct 74 ms 4696 KB Output is correct
24 Correct 68 ms 4736 KB Output is correct
25 Correct 67 ms 4700 KB Output is correct
26 Correct 97 ms 4736 KB Output is correct
27 Incorrect 8 ms 5720 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4580 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 3 ms 4700 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 69 ms 4748 KB Output is correct
23 Correct 74 ms 4696 KB Output is correct
24 Correct 68 ms 4736 KB Output is correct
25 Correct 67 ms 4700 KB Output is correct
26 Correct 97 ms 4736 KB Output is correct
27 Correct 493 ms 46788 KB Output is correct
28 Correct 456 ms 46792 KB Output is correct
29 Correct 473 ms 46532 KB Output is correct
30 Correct 497 ms 46788 KB Output is correct
31 Correct 419 ms 45104 KB Output is correct
32 Correct 453 ms 44996 KB Output is correct
33 Correct 406 ms 45260 KB Output is correct
34 Correct 444 ms 45100 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Incorrect 1049 ms 28844 KB Output isn't correct
37 Halted 0 ms 0 KB -