oj.uz

답안 #711600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711600 2023-03-17T09:37:37 Z Cyanmond Collapse (JOI18_collapse) C++17
35 / 100
 15000 ms 401984 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 = 600;

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];
            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;
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 4 ms 312 KB Output is correct
3 Correct 13 ms 420 KB Output is correct
4 Correct 21 ms 424 KB Output is correct
5 Correct 180 ms 564 KB Output is correct
6 Correct 392 ms 1660 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 191 ms 788 KB Output is correct
10 Correct 354 ms 1044 KB Output is correct
11 Correct 479 ms 2068 KB Output is correct
12 Correct 454 ms 2124 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2388 KB Output is correct
2 Correct 53 ms 2384 KB Output is correct
3 Correct 2801 ms 4880 KB Output is correct
4 Correct 276 ms 2464 KB Output is correct
5 Correct 4808 ms 5144 KB Output is correct
6 Correct 4396 ms 3708 KB Output is correct
7 Correct 9606 ms 397196 KB Output is correct
8 Correct 4740 ms 5408 KB Output is correct
9 Correct 48 ms 5460 KB Output is correct
10 Correct 106 ms 5460 KB Output is correct
11 Correct 4347 ms 5568 KB Output is correct
12 Correct 5724 ms 9448 KB Output is correct
13 Correct 8668 ms 164332 KB Output is correct
14 Correct 11345 ms 401808 KB Output is correct
15 Correct 10261 ms 401984 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 2244 KB Output is correct
2 Correct 72 ms 2244 KB Output is correct
3 Correct 164 ms 2252 KB Output is correct
4 Correct 389 ms 2256 KB Output is correct
5 Correct 7046 ms 2304 KB Output is correct
6 Correct 7398 ms 3600 KB Output is correct
7 Correct 10260 ms 224236 KB Output is correct
8 Execution timed out 15102 ms 398012 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 4 ms 312 KB Output is correct
3 Correct 13 ms 420 KB Output is correct
4 Correct 21 ms 424 KB Output is correct
5 Correct 180 ms 564 KB Output is correct
6 Correct 392 ms 1660 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 191 ms 788 KB Output is correct
10 Correct 354 ms 1044 KB Output is correct
11 Correct 479 ms 2068 KB Output is correct
12 Correct 454 ms 2124 KB Output is correct
13 Correct 36 ms 2388 KB Output is correct
14 Correct 53 ms 2384 KB Output is correct
15 Correct 2801 ms 4880 KB Output is correct
16 Correct 276 ms 2464 KB Output is correct
17 Correct 4808 ms 5144 KB Output is correct
18 Correct 4396 ms 3708 KB Output is correct
19 Correct 9606 ms 397196 KB Output is correct
20 Correct 4740 ms 5408 KB Output is correct
21 Correct 48 ms 5460 KB Output is correct
22 Correct 106 ms 5460 KB Output is correct
23 Correct 4347 ms 5568 KB Output is correct
24 Correct 5724 ms 9448 KB Output is correct
25 Correct 8668 ms 164332 KB Output is correct
26 Correct 11345 ms 401808 KB Output is correct
27 Correct 10261 ms 401984 KB Output is correct
28 Correct 34 ms 2244 KB Output is correct
29 Correct 72 ms 2244 KB Output is correct
30 Correct 164 ms 2252 KB Output is correct
31 Correct 389 ms 2256 KB Output is correct
32 Correct 7046 ms 2304 KB Output is correct
33 Correct 7398 ms 3600 KB Output is correct
34 Correct 10260 ms 224236 KB Output is correct
35 Execution timed out 15102 ms 398012 KB Time limit exceeded
36 Halted 0 ms 0 KB -