oj.uz

Submission #711601

# Submission time Handle Problem Language Result Execution time Memory
711601 2023-03-17T09:39:21 Z Cyanmond Collapse (JOI18_collapse) C++17
35 / 100
 15000 ms 480344 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#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());
    }

    void reset() {
        compS.clear();
        data.assign(n, -1);
        time.assign(n, inf);
    }
};

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();
    for (int i = 0; i < C; ++i) {
        if (X[i] > Y[i]) {
            std::swap(X[i], Y[i]);
        }
    }
    std::vector<int> answer(Q);
    const int blocks = (C + B - 1) / B;
    std::vector<std::set<std::pair<int, int>>> alEdgesVec(blocks);
    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);
        }
        alEdgesVec[l / B] = std::move(alEdges);
    }

    bool reved = false;

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

            // build Union Find
            std::vector<std::pair<int, int>> alVec;
            const auto &alEdges = alEdgesVec[l / B];
            alVec.reserve(alEdges.size());
            for (const auto &[a, b] : alEdges) {
                if (reved) alVec.push_back({N - b - 1, N - a - 1});
                else alVec.push_back({a, b});
            }
            std::sort(alVec.begin(), alVec.end(), [&](const auto &x, const auto &y) {
                return x.second < y.second;
            });
            uft.reset();
            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;
                vs.reserve(2 * edges.size());
                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) {
                    while (not graph[v].empty()) graph[v].pop_back();
                    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;
    }
    reved = true;
    solveL();
    return answer;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 13 ms 312 KB Output is correct
4 Correct 20 ms 420 KB Output is correct
5 Correct 127 ms 568 KB Output is correct
6 Correct 319 ms 1740 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 165 ms 940 KB Output is correct
10 Correct 338 ms 1136 KB Output is correct
11 Correct 414 ms 2120 KB Output is correct
12 Correct 402 ms 2092 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2496 KB Output is correct
2 Correct 55 ms 2604 KB Output is correct
3 Correct 2815 ms 5004 KB Output is correct
4 Correct 241 ms 2516 KB Output is correct
5 Correct 4935 ms 5688 KB Output is correct
6 Correct 3741 ms 4136 KB Output is correct
7 Correct 10244 ms 473952 KB Output is correct
8 Correct 4815 ms 5944 KB Output is correct
9 Correct 47 ms 5708 KB Output is correct
10 Correct 97 ms 5704 KB Output is correct
11 Correct 3951 ms 6004 KB Output is correct
12 Correct 5264 ms 9892 KB Output is correct
13 Correct 8560 ms 195288 KB Output is correct
14 Correct 11999 ms 478464 KB Output is correct
15 Correct 11285 ms 478424 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2396 KB Output is correct
2 Correct 69 ms 2356 KB Output is correct
3 Correct 162 ms 2384 KB Output is correct
4 Correct 373 ms 2392 KB Output is correct
5 Correct 7932 ms 2592 KB Output is correct
6 Correct 6528 ms 3812 KB Output is correct
7 Correct 9900 ms 267944 KB Output is correct
8 Correct 13101 ms 474584 KB Output is correct
9 Correct 47 ms 5548 KB Output is correct
10 Correct 6997 ms 5772 KB Output is correct
11 Correct 13879 ms 480344 KB Output is correct
12 Execution timed out 15080 ms 480120 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 13 ms 312 KB Output is correct
4 Correct 20 ms 420 KB Output is correct
5 Correct 127 ms 568 KB Output is correct
6 Correct 319 ms 1740 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 165 ms 940 KB Output is correct
10 Correct 338 ms 1136 KB Output is correct
11 Correct 414 ms 2120 KB Output is correct
12 Correct 402 ms 2092 KB Output is correct
13 Correct 34 ms 2496 KB Output is correct
14 Correct 55 ms 2604 KB Output is correct
15 Correct 2815 ms 5004 KB Output is correct
16 Correct 241 ms 2516 KB Output is correct
17 Correct 4935 ms 5688 KB Output is correct
18 Correct 3741 ms 4136 KB Output is correct
19 Correct 10244 ms 473952 KB Output is correct
20 Correct 4815 ms 5944 KB Output is correct
21 Correct 47 ms 5708 KB Output is correct
22 Correct 97 ms 5704 KB Output is correct
23 Correct 3951 ms 6004 KB Output is correct
24 Correct 5264 ms 9892 KB Output is correct
25 Correct 8560 ms 195288 KB Output is correct
26 Correct 11999 ms 478464 KB Output is correct
27 Correct 11285 ms 478424 KB Output is correct
28 Correct 34 ms 2396 KB Output is correct
29 Correct 69 ms 2356 KB Output is correct
30 Correct 162 ms 2384 KB Output is correct
31 Correct 373 ms 2392 KB Output is correct
32 Correct 7932 ms 2592 KB Output is correct
33 Correct 6528 ms 3812 KB Output is correct
34 Correct 9900 ms 267944 KB Output is correct
35 Correct 13101 ms 474584 KB Output is correct
36 Correct 47 ms 5548 KB Output is correct
37 Correct 6997 ms 5772 KB Output is correct
38 Correct 13879 ms 480344 KB Output is correct
39 Execution timed out 15080 ms 480120 KB Time limit exceeded
40 Halted 0 ms 0 KB -