oj.uz

Submission #519447

# Submission time Handle Problem Language Result Execution time Memory
519447 2022-01-26T11:41:36 Z Cyanmond Bridges (APIO19_bridges) C++17
100 / 100
 2958 ms 14460 KB 
#line 1 "paper.cpp"
#include <bits/stdc++.h>

#line 3 "library2/utility/len.hpp"

template <class Container> int len(const Container&c){
    return static_cast<int>(std::size(c));
}
#line 7 "library2/graph/rollback_union_find.hpp"

class RollbackUnionFind {
    std::vector<int> data;
    std::stack<std::pair<int, int>> history;

  public:
    explicit RollbackUnionFind(const int n_) : data(n_, -1) {}

    int size() const noexcept {
        return len(data);
    }

    int get_state() const {
        return len(history) / 2;
    }

    int leader(int v) const {
        assert(0 <= v and v < size());
        while (data[v] >= 0) {
            v = data[v];
        }
        return v;
    }

    int size(const int v) const {
        assert(0 <= v and v < size());
        return -data[leader(v)];
    }

    bool is_same(const int x, const int y) const {
        return leader(x) == leader(y);
    }

    bool unite(int x, int y) {
        assert(0 <= x and x < size());
        assert(0 <= y and y < size());
        x = leader(x);
        y = leader(y);
        if (x == y) {
            return false;
        }
        if (data[x] > data[y]) {
            std::swap(x, y);
        }
        history.emplace(x, data[x]);
        history.emplace(y, data[y]);
        data[x] += data[y];
        data[y] = x;
        return true;
    }

    int root_press(int v) {
        if (data[v] >= 0) {
            return data[v] = root_press(data[v]);
        } else {
            return v;
        }
    }

    void undo() {
        assert(not history.empty());
        data[history.top().first] = history.top().second;
        history.pop();
        data[history.top().first] = history.top().second;
        history.pop();
    }

    void rollback(int steps) {
        assert(0 <= steps and 2 * steps <= len(history));
        while (steps != 0) {
            --steps;
            undo();
        }
    }
};
#line 3 "library2/utility/int_alias.hpp"

using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using u16 = std::uint16_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
#line 3 "library2/utility/rep.hpp"

class Range {
    struct Iterator {
        int itr;
        constexpr Iterator(const int pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept {
            ++itr;
        }
        constexpr bool operator!=(const Iterator &other) const noexcept {
            return itr != other.itr;
        }
        constexpr int operator*() const noexcept {
            return itr;
        }
    };
    const Iterator first, last;

  public:
    explicit constexpr Range(const int f, const int l) noexcept
        : first(f), last(std::max(f, l)) {}
    constexpr Iterator begin() const noexcept {
        return first;
    }
    constexpr Iterator end() const noexcept {
        return last;
    }
};

constexpr Range rep(const int l, const int r) noexcept {
    return Range(l, r);
}
constexpr Range rep(const int n) noexcept {
    return Range(0, n);
}
#line 3 "library2/utility/scan.hpp"

template <typename T = int> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
}
#line 5 "library2/utility/upb.hpp"

template <class Container, class T> constexpr int upb(const Container &c, const T &val) {
    return static_cast<int>(std::distance(c.cbegin(), std::upper_bound(c.cbegin(), c.cend(), val)));
}
#line 9 "paper.cpp"

int main() {
    const int N = scan();
    const int M = scan();
    std::vector<int> U(M), V(M), D(M);
    for (const int i : rep(M)) {
        U[i] = scan() - 1;
        V[i] = scan() - 1;
        D[i] = scan();
    }
    const int Q = scan();
    std::vector<int> T(Q), A(Q), B(Q);
    for (const int i : rep(Q)) {
        T[i] = scan();
        A[i] = scan() - 1;
        B[i] = scan();
    }

    std::vector<int> answer(Q);

    auto solve_sub = [&](const int l, const int r, std::vector<int> &F) {
        assert(len(F) == M);
        assert(0 <= l and l <= r and r <= Q);

        std::vector<bool> is_changed(M);
        std::vector<std::vector<std::pair<int, int>>> history(M);
        for (const int i : rep(M)) {
            history[i].push_back({-1, F[i]});
        }

        for (const int i : rep(l, r)) {
            if (T[i] == 1) {
                is_changed[A[i]] = true;
                history[A[i]].push_back({i, B[i]});
                F[A[i]] = B[i];
            }
        }

        RollbackUnionFind uft(N);

        std::vector<int> edges;
        for (const int i : rep(M)) {
            if (not is_changed[i]) {
                edges.push_back(i);
            }
        }
        std::sort(edges.begin(), edges.end(),
                  [&](const int a, const int b) { return F[a] > F[b]; });

        std::vector<int> queries;
        for (const int i : rep(l, r)) {
            if (T[i] == 2) {
                queries.push_back(i);
            }
        }
        std::sort(queries.begin(), queries.end(),
                  [&](const int a, const int b) { return B[a] > B[b]; });

        int idx = 0;

        for (const int x : queries) {
            while (idx != len(edges) and F[edges[idx]] >= B[x]) {
                uft.unite(U[edges[idx]], V[edges[idx]]);
                uft.root_press(U[edges[idx]]);
                uft.root_press(V[edges[idx]]);
                ++idx;
            }

            int count_back = 0;
            for (const int i : rep(l, r)) {
                if (T[i] == 1) {
                    const int p = upb(history[A[i]], std::make_pair(x, 0));
                    if (history[A[i]][p - 1].second >= B[x]) {
                        if (uft.unite(U[A[i]], V[A[i]])) {
                            ++count_back;
                        }
                    }
                }
            }

            answer[x] = uft.size(A[x]);
            uft.rollback(count_back);
        }
    };

    constexpr int block_size = 1000;

    for (int i = 0; i < Q; i += block_size) {
        solve_sub(i, std::min(i + block_size, Q), D);
    }

    for (const auto e : answer) {
        if (e != 0) {
            std::cout << e << std::endl;
        }
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 62 ms 680 KB Output is correct
4 Correct 26 ms 552 KB Output is correct
5 Correct 100 ms 712 KB Output is correct
6 Correct 86 ms 592 KB Output is correct
7 Correct 94 ms 460 KB Output is correct
8 Correct 95 ms 580 KB Output is correct
9 Correct 93 ms 524 KB Output is correct
10 Correct 103 ms 588 KB Output is correct
11 Correct 114 ms 580 KB Output is correct
12 Correct 110 ms 608 KB Output is correct
13 Correct 101 ms 612 KB Output is correct
14 Correct 118 ms 540 KB Output is correct
15 Correct 107 ms 496 KB Output is correct
16 Correct 95 ms 456 KB Output is correct
17 Correct 95 ms 536 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2058 ms 9328 KB Output is correct
2 Correct 2111 ms 9208 KB Output is correct
3 Correct 2063 ms 9276 KB Output is correct
4 Correct 2085 ms 9264 KB Output is correct
5 Correct 2108 ms 9268 KB Output is correct
6 Correct 2828 ms 9276 KB Output is correct
7 Correct 2807 ms 9284 KB Output is correct
8 Correct 2835 ms 9292 KB Output is correct
9 Correct 249 ms 3460 KB Output is correct
10 Correct 1867 ms 8356 KB Output is correct
11 Correct 1704 ms 8232 KB Output is correct
12 Correct 1766 ms 9316 KB Output is correct
13 Correct 1671 ms 9184 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1543 ms 7372 KB Output is correct
2 Correct 1238 ms 4356 KB Output is correct
3 Correct 1847 ms 7152 KB Output is correct
4 Correct 1607 ms 7404 KB Output is correct
5 Correct 250 ms 3460 KB Output is correct
6 Correct 1743 ms 7264 KB Output is correct
7 Correct 1499 ms 7360 KB Output is correct
8 Correct 1410 ms 7416 KB Output is correct
9 Correct 1175 ms 7428 KB Output is correct
10 Correct 1163 ms 7412 KB Output is correct
11 Correct 1111 ms 7208 KB Output is correct
12 Correct 992 ms 7244 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2254 ms 14244 KB Output is correct
2 Correct 255 ms 3360 KB Output is correct
3 Correct 278 ms 9844 KB Output is correct
4 Correct 200 ms 9972 KB Output is correct
5 Correct 1489 ms 12680 KB Output is correct
6 Correct 2277 ms 14248 KB Output is correct
7 Correct 1473 ms 12716 KB Output is correct
8 Correct 1285 ms 9196 KB Output is correct
9 Correct 1301 ms 9476 KB Output is correct
10 Correct 1290 ms 9104 KB Output is correct
11 Correct 1904 ms 11676 KB Output is correct
12 Correct 1761 ms 11824 KB Output is correct
13 Correct 1806 ms 11692 KB Output is correct
14 Correct 1369 ms 12804 KB Output is correct
15 Correct 1454 ms 12792 KB Output is correct
16 Correct 2323 ms 14068 KB Output is correct
17 Correct 2340 ms 14044 KB Output is correct
18 Correct 2319 ms 14112 KB Output is correct
19 Correct 2290 ms 13992 KB Output is correct
20 Correct 2061 ms 12508 KB Output is correct
21 Correct 2001 ms 12504 KB Output is correct
22 Correct 2204 ms 13720 KB Output is correct
23 Correct 1544 ms 11076 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2058 ms 9328 KB Output is correct
2 Correct 2111 ms 9208 KB Output is correct
3 Correct 2063 ms 9276 KB Output is correct
4 Correct 2085 ms 9264 KB Output is correct
5 Correct 2108 ms 9268 KB Output is correct
6 Correct 2828 ms 9276 KB Output is correct
7 Correct 2807 ms 9284 KB Output is correct
8 Correct 2835 ms 9292 KB Output is correct
9 Correct 249 ms 3460 KB Output is correct
10 Correct 1867 ms 8356 KB Output is correct
11 Correct 1704 ms 8232 KB Output is correct
12 Correct 1766 ms 9316 KB Output is correct
13 Correct 1671 ms 9184 KB Output is correct
14 Correct 1543 ms 7372 KB Output is correct
15 Correct 1238 ms 4356 KB Output is correct
16 Correct 1847 ms 7152 KB Output is correct
17 Correct 1607 ms 7404 KB Output is correct
18 Correct 250 ms 3460 KB Output is correct
19 Correct 1743 ms 7264 KB Output is correct
20 Correct 1499 ms 7360 KB Output is correct
21 Correct 1410 ms 7416 KB Output is correct
22 Correct 1175 ms 7428 KB Output is correct
23 Correct 1163 ms 7412 KB Output is correct
24 Correct 1111 ms 7208 KB Output is correct
25 Correct 992 ms 7244 KB Output is correct
26 Correct 2077 ms 9332 KB Output is correct
27 Correct 2327 ms 9164 KB Output is correct
28 Correct 2045 ms 9400 KB Output is correct
29 Correct 1667 ms 9336 KB Output is correct
30 Correct 2374 ms 9184 KB Output is correct
31 Correct 2316 ms 9188 KB Output is correct
32 Correct 2378 ms 9328 KB Output is correct
33 Correct 2333 ms 9368 KB Output is correct
34 Correct 2280 ms 9272 KB Output is correct
35 Correct 2330 ms 9272 KB Output is correct
36 Correct 1853 ms 9268 KB Output is correct
37 Correct 1821 ms 9232 KB Output is correct
38 Correct 1704 ms 9236 KB Output is correct
39 Correct 1469 ms 9336 KB Output is correct
40 Correct 1439 ms 9348 KB Output is correct
41 Correct 1489 ms 9396 KB Output is correct
42 Correct 1285 ms 9304 KB Output is correct
43 Correct 1246 ms 9240 KB Output is correct
44 Correct 1254 ms 9180 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 62 ms 680 KB Output is correct
4 Correct 26 ms 552 KB Output is correct
5 Correct 100 ms 712 KB Output is correct
6 Correct 86 ms 592 KB Output is correct
7 Correct 94 ms 460 KB Output is correct
8 Correct 95 ms 580 KB Output is correct
9 Correct 93 ms 524 KB Output is correct
10 Correct 103 ms 588 KB Output is correct
11 Correct 114 ms 580 KB Output is correct
12 Correct 110 ms 608 KB Output is correct
13 Correct 101 ms 612 KB Output is correct
14 Correct 118 ms 540 KB Output is correct
15 Correct 107 ms 496 KB Output is correct
16 Correct 95 ms 456 KB Output is correct
17 Correct 95 ms 536 KB Output is correct
18 Correct 2058 ms 9328 KB Output is correct
19 Correct 2111 ms 9208 KB Output is correct
20 Correct 2063 ms 9276 KB Output is correct
21 Correct 2085 ms 9264 KB Output is correct
22 Correct 2108 ms 9268 KB Output is correct
23 Correct 2828 ms 9276 KB Output is correct
24 Correct 2807 ms 9284 KB Output is correct
25 Correct 2835 ms 9292 KB Output is correct
26 Correct 249 ms 3460 KB Output is correct
27 Correct 1867 ms 8356 KB Output is correct
28 Correct 1704 ms 8232 KB Output is correct
29 Correct 1766 ms 9316 KB Output is correct
30 Correct 1671 ms 9184 KB Output is correct
31 Correct 1543 ms 7372 KB Output is correct
32 Correct 1238 ms 4356 KB Output is correct
33 Correct 1847 ms 7152 KB Output is correct
34 Correct 1607 ms 7404 KB Output is correct
35 Correct 250 ms 3460 KB Output is correct
36 Correct 1743 ms 7264 KB Output is correct
37 Correct 1499 ms 7360 KB Output is correct
38 Correct 1410 ms 7416 KB Output is correct
39 Correct 1175 ms 7428 KB Output is correct
40 Correct 1163 ms 7412 KB Output is correct
41 Correct 1111 ms 7208 KB Output is correct
42 Correct 992 ms 7244 KB Output is correct
43 Correct 2254 ms 14244 KB Output is correct
44 Correct 255 ms 3360 KB Output is correct
45 Correct 278 ms 9844 KB Output is correct
46 Correct 200 ms 9972 KB Output is correct
47 Correct 1489 ms 12680 KB Output is correct
48 Correct 2277 ms 14248 KB Output is correct
49 Correct 1473 ms 12716 KB Output is correct
50 Correct 1285 ms 9196 KB Output is correct
51 Correct 1301 ms 9476 KB Output is correct
52 Correct 1290 ms 9104 KB Output is correct
53 Correct 1904 ms 11676 KB Output is correct
54 Correct 1761 ms 11824 KB Output is correct
55 Correct 1806 ms 11692 KB Output is correct
56 Correct 1369 ms 12804 KB Output is correct
57 Correct 1454 ms 12792 KB Output is correct
58 Correct 2323 ms 14068 KB Output is correct
59 Correct 2340 ms 14044 KB Output is correct
60 Correct 2319 ms 14112 KB Output is correct
61 Correct 2290 ms 13992 KB Output is correct
62 Correct 2061 ms 12508 KB Output is correct
63 Correct 2001 ms 12504 KB Output is correct
64 Correct 2204 ms 13720 KB Output is correct
65 Correct 1544 ms 11076 KB Output is correct
66 Correct 2077 ms 9332 KB Output is correct
67 Correct 2327 ms 9164 KB Output is correct
68 Correct 2045 ms 9400 KB Output is correct
69 Correct 1667 ms 9336 KB Output is correct
70 Correct 2374 ms 9184 KB Output is correct
71 Correct 2316 ms 9188 KB Output is correct
72 Correct 2378 ms 9328 KB Output is correct
73 Correct 2333 ms 9368 KB Output is correct
74 Correct 2280 ms 9272 KB Output is correct
75 Correct 2330 ms 9272 KB Output is correct
76 Correct 1853 ms 9268 KB Output is correct
77 Correct 1821 ms 9232 KB Output is correct
78 Correct 1704 ms 9236 KB Output is correct
79 Correct 1469 ms 9336 KB Output is correct
80 Correct 1439 ms 9348 KB Output is correct
81 Correct 1489 ms 9396 KB Output is correct
82 Correct 1285 ms 9304 KB Output is correct
83 Correct 1246 ms 9240 KB Output is correct
84 Correct 1254 ms 9180 KB Output is correct
85 Correct 2824 ms 14460 KB Output is correct
86 Correct 300 ms 9852 KB Output is correct
87 Correct 233 ms 10012 KB Output is correct
88 Correct 1980 ms 12520 KB Output is correct
89 Correct 2857 ms 14044 KB Output is correct
90 Correct 1913 ms 12572 KB Output is correct
91 Correct 2179 ms 9220 KB Output is correct
92 Correct 2128 ms 9276 KB Output is correct
93 Correct 2876 ms 9260 KB Output is correct
94 Correct 2568 ms 11744 KB Output is correct
95 Correct 2431 ms 11720 KB Output is correct
96 Correct 2513 ms 11584 KB Output is correct
97 Correct 1718 ms 12728 KB Output is correct
98 Correct 1522 ms 12420 KB Output is correct
99 Correct 2837 ms 13960 KB Output is correct
100 Correct 2958 ms 13784 KB Output is correct
101 Correct 2921 ms 13944 KB Output is correct
102 Correct 2929 ms 13864 KB Output is correct
103 Correct 2586 ms 12312 KB Output is correct
104 Correct 2620 ms 12284 KB Output is correct
105 Correct 2107 ms 12120 KB Output is correct
106 Correct 1855 ms 11624 KB Output is correct
107 Correct 2232 ms 12368 KB Output is correct
108 Correct 2748 ms 13432 KB Output is correct
109 Correct 2096 ms 10924 KB Output is correct