oj.uz

답안 #681530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
681530 2023-01-13T09:19:42 Z nutella Collapse (JOI18_collapse) C++17
100 / 100
 1060 ms 61524 KB 
#include <bits/stdc++.h>
#include "collapse.h"

using namespace std;

constexpr int inf = 1e9 + 7;

struct DSU {
    vector<int> p, sz;

    DSU(int n) : p(n), sz(n, 1) {
        iota(p.begin(), p.end(), 0);
    }

    DSU() = default;

    int get(int x) {
        return p[x] == x ? x : p[x] = get(p[x]);
    }

    bool unite(int a, int b) {
        a = get(a), b = get(b);
        if (a == b) return false;
        if (sz[a] < sz[b]) swap(a, b);
        p[b] = a;
        sz[a] += sz[b];
        return true;
    }
};

struct Fenwick {
    vector<int> t;
    int n{};

    Fenwick() = default;

    Fenwick(int n) : n(n), t(n + 1) {}

    void modify(int i, int val) {
        for (int x = i + 1; x <= n; x += x & -x) {
            t[x] += val;
        }
    }

    int sum(int i) {
        int ans = 0;
        for (int x = i + 1; x > 0; x -= x & -x) {
            ans += t[x];
        }
        return ans;
    }
};

struct Edge {
    int l, r;
    int u, v;
    int w;
    int x, y;

    bool operator<(Edge b) const {
        return w < b.w;
    }
};

constexpr int N = 100001;

vector<array<int, 2>> queries[N];

int n, answer[N];

Fenwick fn;

void solve(int lx, int rx, vector<Edge> e, int sz) {
    vector<Edge> nxt;
    for (auto &ed: e) {
        if (ed.l >= rx || ed.r <= lx) {
        } else {
            nxt.push_back(ed);
        }
    }
    swap(e, nxt);
    
    vector<int> alive(sz);
    for (auto &ed : e) {
        alive[ed.u] = alive[ed.v] = 1;
    }
    
    vector<int> id(sz);
    int last_id = 0;
    for (int i = 0; i < sz; ++i) {
        if (alive[i]) {
            id[i] = last_id++;
        }
    }
    
    sz = last_id;
    for (auto &ed : e) {
        ed.u = id[ed.u], ed.v = id[ed.v];
    }
    
    DSU d1(sz), d2(sz);
    for (auto [l, r, u, v, w, x, y]: e) {
        if (l > lx || r < rx) {
            d1.unite(u, v);
        }
    }

    vector<pair<int, int>> done;
    for (auto [l, r, u, v, w, x, y]: e) {
        if (l <= lx && rx <= r && d1.unite(u, v)) {
            done.emplace_back(x, y);

            d2.unite(u, v);

            fn.modify(y, 1);
        }
    }

    if (lx + 1 == rx) {
        for (auto [i, u]: queries[lx]) {
            answer[i] += fn.sum(u);
        }
    } else {
        vector<int> id(sz);
        int cnt = 0;
        for (int i = 0; i < sz; ++i) {
            if (d2.get(i) == i) {
                id[i] = cnt++;
            }
        }

        DSU d(cnt);
        for (auto &[l, r, u, v, w, x, y]: e) {
            u = id[d2.get(u)], v = id[d2.get(v)];
            if (l <= lx && rx <= r && !d.unite(u, v)) {
                l = inf, r = -inf;
            }
        }

        int mid = (lx + rx) / 2;
        solve(lx, mid, e, cnt), solve(mid, rx, e, cnt);
    }

    for (auto [l, r]: done) {
        fn.modify(r, -1);
    }
}

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 q = P.size(), c = T.size();
    ::n = N;


    map<pair<int, int>, int> last;

    vector<Edge> e;

    for (int i = 0; i < c; ++i) {
        if (X[i] > Y[i]) {
            swap(X[i], Y[i]);
        }
        if (T[i] == 0) {
            last[{X[i], Y[i]}] = i;
        } else {
            e.push_back({last[{X[i], Y[i]}], i, X[i], Y[i], 0, X[i], Y[i]});
            last.erase({X[i], Y[i]});
        }
    }

    for (auto [x, y]: last) {
        e.push_back({y, c, x.first, x.second, 0, x.first, x.second});
    }

    for (int _ = 0; _ < 2; ++_) {
        fn = Fenwick(n);

        for (auto &[s, t, a, b, w, x, y]: e) {
            w = y;
        }

        sort(e.begin(), e.end());

        for (int i = 0; i < c; ++i) {
            queries[i].clear();
        }

        for (int i = 0; i < q; ++i) {
            queries[W[i]].push_back({i, P[i]});
        }

        solve(0, c, e, n);

        for (auto &[s, t, a, b, w, x, y]: e) {
            x = n - x - 1, y = n - y - 1;
            swap(x, y);
            a = x, b = y;
            w = 0;
        }

        for (int i = 0; i < q; ++i) {
            P[i] = n - P[i] - 2;
        }
    }

    vector<int> ans(q);
    for (int i = 0; i < q; ++i) {
        ans[i] = n - answer[i];
    }

    return ans;
}

Compilation message

collapse.cpp: In constructor 'Fenwick::Fenwick(int)':
collapse.cpp:33:9: warning: 'Fenwick::n' will be initialized after [-Wreorder]
   33 |     int n{};
      |         ^
collapse.cpp:32:17: warning:   'std::vector<int> Fenwick::t' [-Wreorder]
   32 |     vector<int> t;
      |                 ^
collapse.cpp:37:5: warning:   when initialized here [-Wreorder]
   37 |     Fenwick(int n) : n(n), t(n + 1) {}
      |     ^~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3540 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 23 ms 3616 KB Output is correct
6 Correct 36 ms 4680 KB Output is correct
7 Correct 4 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 22 ms 4080 KB Output is correct
10 Correct 29 ms 4308 KB Output is correct
11 Correct 37 ms 5684 KB Output is correct
12 Correct 36 ms 5584 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 5740 KB Output is correct
2 Correct 25 ms 6160 KB Output is correct
3 Correct 469 ms 20540 KB Output is correct
4 Correct 28 ms 6396 KB Output is correct
5 Correct 597 ms 20636 KB Output is correct
6 Correct 61 ms 7952 KB Output is correct
7 Correct 895 ms 43928 KB Output is correct
8 Correct 504 ms 23092 KB Output is correct
9 Correct 27 ms 6472 KB Output is correct
10 Correct 29 ms 6740 KB Output is correct
11 Correct 37 ms 7764 KB Output is correct
12 Correct 510 ms 27608 KB Output is correct
13 Correct 777 ms 46016 KB Output is correct
14 Correct 871 ms 61008 KB Output is correct
15 Correct 806 ms 61064 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 5704 KB Output is correct
2 Correct 24 ms 5980 KB Output is correct
3 Correct 28 ms 6248 KB Output is correct
4 Correct 25 ms 6356 KB Output is correct
5 Correct 29 ms 6212 KB Output is correct
6 Correct 62 ms 7836 KB Output is correct
7 Correct 677 ms 35680 KB Output is correct
8 Correct 1060 ms 49316 KB Output is correct
9 Correct 29 ms 6504 KB Output is correct
10 Correct 36 ms 7380 KB Output is correct
11 Correct 886 ms 56692 KB Output is correct
12 Correct 863 ms 61524 KB Output is correct
13 Correct 935 ms 58084 KB Output is correct
14 Correct 909 ms 60132 KB Output is correct
15 Correct 922 ms 58404 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3540 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 23 ms 3616 KB Output is correct
6 Correct 36 ms 4680 KB Output is correct
7 Correct 4 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 22 ms 4080 KB Output is correct
10 Correct 29 ms 4308 KB Output is correct
11 Correct 37 ms 5684 KB Output is correct
12 Correct 36 ms 5584 KB Output is correct
13 Correct 26 ms 5740 KB Output is correct
14 Correct 25 ms 6160 KB Output is correct
15 Correct 469 ms 20540 KB Output is correct
16 Correct 28 ms 6396 KB Output is correct
17 Correct 597 ms 20636 KB Output is correct
18 Correct 61 ms 7952 KB Output is correct
19 Correct 895 ms 43928 KB Output is correct
20 Correct 504 ms 23092 KB Output is correct
21 Correct 27 ms 6472 KB Output is correct
22 Correct 29 ms 6740 KB Output is correct
23 Correct 37 ms 7764 KB Output is correct
24 Correct 510 ms 27608 KB Output is correct
25 Correct 777 ms 46016 KB Output is correct
26 Correct 871 ms 61008 KB Output is correct
27 Correct 806 ms 61064 KB Output is correct
28 Correct 26 ms 5704 KB Output is correct
29 Correct 24 ms 5980 KB Output is correct
30 Correct 28 ms 6248 KB Output is correct
31 Correct 25 ms 6356 KB Output is correct
32 Correct 29 ms 6212 KB Output is correct
33 Correct 62 ms 7836 KB Output is correct
34 Correct 677 ms 35680 KB Output is correct
35 Correct 1060 ms 49316 KB Output is correct
36 Correct 29 ms 6504 KB Output is correct
37 Correct 36 ms 7380 KB Output is correct
38 Correct 886 ms 56692 KB Output is correct
39 Correct 863 ms 61524 KB Output is correct
40 Correct 935 ms 58084 KB Output is correct
41 Correct 909 ms 60132 KB Output is correct
42 Correct 922 ms 58404 KB Output is correct
43 Correct 454 ms 21772 KB Output is correct
44 Correct 902 ms 44628 KB Output is correct
45 Correct 496 ms 24404 KB Output is correct
46 Correct 1042 ms 51268 KB Output is correct
47 Correct 30 ms 7256 KB Output is correct
48 Correct 31 ms 7556 KB Output is correct
49 Correct 39 ms 8776 KB Output is correct
50 Correct 116 ms 14164 KB Output is correct
51 Correct 527 ms 27448 KB Output is correct
52 Correct 697 ms 39116 KB Output is correct
53 Correct 668 ms 36776 KB Output is correct
54 Correct 725 ms 46140 KB Output is correct
55 Correct 749 ms 42596 KB Output is correct
56 Correct 815 ms 50628 KB Output is correct
57 Correct 868 ms 55456 KB Output is correct
58 Correct 810 ms 56152 KB Output is correct
59 Correct 904 ms 59764 KB Output is correct
60 Correct 898 ms 60696 KB Output is correct