oj.uz

Submission #711586

# Submission time Handle Problem Language Result Execution time Memory
711586 2023-03-17T09:21:06 Z Cyanmond Collapse (JOI18_collapse) C++17
35 / 100
 15000 ms 18640 KB 
#include "collapse.h"
#include <bits/stdc++.h>

constexpr int inf = 1 << 30;

struct PPUnionFind {
    int n;
    std::vector<int> data, time;
    std::vector<int> compS;

    PPUnionFind(int n_) : n(n_) {
        data.assign(n, -1);
        time.assign(n, inf);
    }

    int find(int v, int t) {
        if (time[v] > t) return v;
        return find(data[v], t);
    }

    void merge(int a, int b, int t) {
        a = find(a, t);
        b = find(b, t);
        if (a == b) return;
        if (data[a] > data[b]) std::swap(a, b);
        data[a] += data[b];
        data[b] = a;
        time[b] = t;
        compS.push_back(t);
    }

    int countComp(int t) {
        auto itr = std::upper_bound(compS.begin(), compS.end(), t);
        return n - (int)(itr - compS.begin());
    }
};

constexpr int B = 500;

std::vector<int> simulateCollapse(int N, std::vector<int> T, std::vector<int> X, std::vector<int> Y,
                                  std::vector<int> W, std::vector<int> P) {
    const int C = (int)T.size(), Q = (int)P.size();
    std::vector<int> answer(Q);

    auto solveL = [&]() {
        for (int i = 0; i < C; ++i) {
            if (X[i] > Y[i]) {
                std::swap(X[i], Y[i]);
            }
        }
        // reuse
        std::vector<std::vector<int>> graph(N);
        std::vector<bool> isSeen(N);
        for (int l = 0; l < C; l += B) {
            const int r = std::min(l + B, C);
            // [l, r)

            // build Union Find
            std::set<std::pair<int, int>> alEdges;
            for (int i = 0; i < l; ++i) {
                const auto p = std::make_pair(X[i], Y[i]);
                if (alEdges.find(p) == alEdges.end()) alEdges.insert(p);
                else alEdges.erase(p);
            }
            for (int i = l; i < r; ++i) {
                const auto p = std::make_pair(X[i], Y[i]);
                if (alEdges.find(p) != alEdges.end()) alEdges.erase(p);
            }
            std::vector<std::pair<int, int>> alVec;
            for (const auto &[a, b] : alEdges) alVec.push_back({a, b});
            std::sort(alVec.begin(), alVec.end(), [&](const auto &x, const auto &y) {
                return x.second < y.second;
            });

            PPUnionFind uft(N);
            for (const auto &[a, b] : alVec) uft.merge(a, b, b);

            // answer queries

            for (int i = 0; i < Q; ++i) {
                if (not(l <= W[i] and W[i] < r)) continue;
                std::set<std::pair<int, int>> edges;
                for (int j = l; j <= W[i]; ++j) {
                    if (Y[j] > P[i]) continue;
                    const auto p = std::make_pair(X[j], Y[j]);
                    if (T[j] == 1) {
                        if (edges.find(p) != edges.end()) edges.erase(p);
                        continue;
                    }
                    if (edges.find(p) == edges.end()) edges.insert(p);
                }
                std::set<std::pair<int, int>> s2;
                for (int j = W[i] + 1; j < r; ++j) {
                    if (Y[j] > P[i]) continue;
                    const auto p = std::make_pair(X[j], Y[j]);
                    if (T[j] == 0) {
                        s2.insert(p);
                    } else {
                        if (s2.find(p) == s2.end()) {
                            edges.insert(p);
                        }
                    }
                }

                answer[i] += uft.countComp(P[i]) - (N - P[i] - 1);
                std::vector<int> vs;
                for (const auto &[a, b] : edges) {
                    const int x = uft.find(a, P[i]), y = uft.find(b, P[i]);
                    vs.push_back(x);
                    vs.push_back(y);
                    graph[x].push_back(y);
                    graph[y].push_back(x);
                }
                std::sort(vs.begin(), vs.end());
                vs.erase(std::unique(vs.begin(), vs.end()), vs.end());
                std::queue<int> que;
                auto st = [&](const int v) {
                    if (isSeen[v]) {
                        --answer[i];
                        return;
                    }
                    isSeen[v] = true;
                    que.push(v);
                    while (not que.empty()) {
                        const int f = que.front();
                        que.pop();
                        for (const int t : graph[f]) {
                            if (not isSeen[t]) {
                                isSeen[t] = true;
                                que.push(t);
                            }
                        }
                    }
                };
                for (const int v : vs) st(v);
                for (const int v : vs) {
                    graph[v].clear();
                    isSeen[v] = false;
                }
            }
        }
    };
    solveL();
    for (int i = 0; i < C; ++i) {
        X[i] = N - X[i] - 1;
        Y[i] = N - Y[i] - 1;
    }
    for (int i = 0; i < Q; ++i) {
        P[i] = N - P[i] - 2;
    }
    solveL();
    return answer;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 468 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 15 ms 392 KB Output is correct
4 Correct 20 ms 340 KB Output is correct
5 Correct 140 ms 468 KB Output is correct
6 Correct 330 ms 832 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 6 ms 548 KB Output is correct
9 Correct 166 ms 696 KB Output is correct
10 Correct 307 ms 872 KB Output is correct
11 Correct 408 ms 1012 KB Output is correct
12 Correct 384 ms 1312 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2240 KB Output is correct
2 Correct 53 ms 2252 KB Output is correct
3 Correct 3950 ms 4612 KB Output is correct
4 Correct 255 ms 2260 KB Output is correct
5 Correct 6118 ms 4756 KB Output is correct
6 Correct 3542 ms 2640 KB Output is correct
7 Correct 12794 ms 11328 KB Output is correct
8 Correct 5828 ms 7356 KB Output is correct
9 Correct 45 ms 6136 KB Output is correct
10 Correct 101 ms 6212 KB Output is correct
11 Correct 3500 ms 6880 KB Output is correct
12 Correct 6641 ms 11740 KB Output is correct
13 Correct 11718 ms 14280 KB Output is correct
14 Correct 14893 ms 18300 KB Output is correct
15 Correct 14057 ms 18640 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2260 KB Output is correct
2 Correct 65 ms 2260 KB Output is correct
3 Correct 159 ms 2260 KB Output is correct
4 Correct 396 ms 2268 KB Output is correct
5 Correct 6896 ms 2308 KB Output is correct
6 Correct 6012 ms 2760 KB Output is correct
7 Correct 11004 ms 9476 KB Output is correct
8 Execution timed out 15022 ms 12028 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 468 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 15 ms 392 KB Output is correct
4 Correct 20 ms 340 KB Output is correct
5 Correct 140 ms 468 KB Output is correct
6 Correct 330 ms 832 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 6 ms 548 KB Output is correct
9 Correct 166 ms 696 KB Output is correct
10 Correct 307 ms 872 KB Output is correct
11 Correct 408 ms 1012 KB Output is correct
12 Correct 384 ms 1312 KB Output is correct
13 Correct 29 ms 2240 KB Output is correct
14 Correct 53 ms 2252 KB Output is correct
15 Correct 3950 ms 4612 KB Output is correct
16 Correct 255 ms 2260 KB Output is correct
17 Correct 6118 ms 4756 KB Output is correct
18 Correct 3542 ms 2640 KB Output is correct
19 Correct 12794 ms 11328 KB Output is correct
20 Correct 5828 ms 7356 KB Output is correct
21 Correct 45 ms 6136 KB Output is correct
22 Correct 101 ms 6212 KB Output is correct
23 Correct 3500 ms 6880 KB Output is correct
24 Correct 6641 ms 11740 KB Output is correct
25 Correct 11718 ms 14280 KB Output is correct
26 Correct 14893 ms 18300 KB Output is correct
27 Correct 14057 ms 18640 KB Output is correct
28 Correct 39 ms 2260 KB Output is correct
29 Correct 65 ms 2260 KB Output is correct
30 Correct 159 ms 2260 KB Output is correct
31 Correct 396 ms 2268 KB Output is correct
32 Correct 6896 ms 2308 KB Output is correct
33 Correct 6012 ms 2760 KB Output is correct
34 Correct 11004 ms 9476 KB Output is correct
35 Execution timed out 15022 ms 12028 KB Time limit exceeded
36 Halted 0 ms 0 KB -