oj.uz

Submission #529431

# Submission time Handle Problem Language Result Execution time Memory
529431 2022-02-23T02:12:38 Z KoD Park (BOI16_park) C++17
0 / 100
 1891 ms 1636 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::tuple;
using std::pair;

struct UnionFind {
    vector<int> par;
    UnionFind(const int n) : par(n, -1) {}
    void reset() {
        std::fill(par.begin(), par.end(), -1);
    }
    int find(const int u) {
        return par[u] < 0 ? u : par[u] = find(par[u]);
    }
    void merge(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return;
        if (par[x] > par[y]) std::swap(x, y);
        par[x] += par[y];
        par[y] = x;
    }
};

using ll = long long;

constexpr ll sq(const ll x) {
    return x * x;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int N, M;
    std::cin >> N >> M;
    int W, H;
    std::cin >> W >> H;
    vector<int> X(N), Y(N), R(N);
    for (int i = 0; i < N; ++i) {
        std::cin >> X[i] >> Y[i] >> R[i];
    }

    UnionFind dsu(N + 4);
    const auto set_radius = [&](const int rad) {
        dsu.reset();
        for (int i = 0; i < N; ++i) {
            if (Y[i] < R[i] + 2 * rad) {
                dsu.merge(i, N);
            }
            if (H - Y[i] < R[i] + 2 * rad) {
                dsu.merge(i, N + 1);
            }
            if (X[i] < R[i] + 2 * rad) {
                dsu.merge(i, N + 2);
            }
            if (W - X[i] < R[i] + 2 * rad) {
                dsu.merge(i, N + 3);
            }
        }
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < i; ++j) {
                if (sq(X[i] - X[j]) + sq(Y[i] - Y[j]) < sq(R[i] + R[j] + 2 * rad)) {
                    dsu.merge(i, j);
                }
            }
        }
    };

    array<array<int, 4>, 4> thres = {};
    for (int i = 0; i < 4; ++i) {
        for (int j = 0; j < i; ++j) {
            int ok = 0, ng = 100000000;
            while (ng - ok > 1) {
                const int md = (ok + ng) / 2;
                set_radius(md);
                (dsu.find(N + i) != dsu.find(N + j) ? ok : ng) = md;
            }
            thres[i][j] = thres[j][i] = ok;
        }
    }

    array<array<int, 4>, 4> reach = {};
    reach[0][1] = std::min({thres[0][1], thres[0][2], thres[0][3]});    
    reach[0][3] = std::min({thres[2][0], thres[2][1], thres[2][3]});    
    reach[1][2] = std::min({thres[3][0], thres[3][1], thres[3][2]});    
    reach[2][3] = std::min({thres[1][0], thres[1][2], thres[1][3]});    
    reach[0][2] = std::min({thres[0][2], thres[0][1], thres[3][1], thres[3][2]});    
    reach[1][3] = std::min({thres[0][1], thres[0][3], thres[2][1], thres[2][3]});    

    while (M--) {
        int rad, i;
        std::cin >> rad >> i;
        i -= 1;
        for (int j = 0; j < 4; ++j) {
            if (i == j or rad <= reach[std::min(i, j)][std::max(i, j)]) {
                std::cout << j + 1;
            }
        }
        std::cout << '\n';
    }

    return 0;
}

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 694 ms 332 KB Output is correct
2 Correct 678 ms 332 KB Output is correct
3 Correct 685 ms 332 KB Output is correct
4 Correct 656 ms 332 KB Output is correct
5 Correct 694 ms 332 KB Output is correct
6 Correct 693 ms 332 KB Output is correct
7 Incorrect 1891 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 768 KB Output is correct
2 Correct 39 ms 1596 KB Output is correct
3 Correct 38 ms 1596 KB Output is correct
4 Correct 41 ms 1604 KB Output is correct
5 Correct 47 ms 1636 KB Output is correct
6 Incorrect 47 ms 1636 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 694 ms 332 KB Output is correct
2 Correct 678 ms 332 KB Output is correct
3 Correct 685 ms 332 KB Output is correct
4 Correct 656 ms 332 KB Output is correct
5 Correct 694 ms 332 KB Output is correct
6 Correct 693 ms 332 KB Output is correct
7 Incorrect 1891 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -