oj.uz

Submission #916308

# Submission time Handle Problem Language Result Execution time Memory
916308 2024-01-25T15:59:25 Z GrindMachine Bridges (APIO19_bridges) C++17
100 / 100
 1923 ms 12088 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://github.com/dolphingarlic/CompetitiveProgramming/blob/master/APIO/APIO%2019-bridges.cpp

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int B = 605;

struct DSU {
    vector<int> par, rankk, siz;
    vector<array<int,4>> history;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void reset(int n){
        rep(i,n+1) create(i);
        history.clear();
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

    int find(int u) {
        if (u == par[u]) return u;
        else return find(par[u]);
    }

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        history.pb({u,par[u],rankk[u],siz[u]});
        history.pb({v,par[v],rankk[v],siz[v]});

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
    }

    void rollback(){
        while(!history.empty()){
            auto [u,paru,rankku,sizu] = history.back();
            history.pop_back();
            par[u] = paru;
            rankk[u] = rankku;
            siz[u] = sizu;
        }
    }
};

void solve(int test_case)
{
    int n,m; cin >> n >> m;
    vector<array<int,3>> edges(m+5);
    rep1(i,m){
        int u,v,w; cin >> u >> v >> w;
        edges[i] = {u,v,w};
    }

    int q; cin >> q;
    vector<array<int,3>> queries(q);
    rep(i,q) rep(j,3) cin >> queries[i][j];

    set<array<int,3>> st;
    rep1(i,m){
        array<int,3> ar = {edges[i][2],2,i};
        st.insert(ar);
    }

    vector<int> ans(q,-1);
    DSU dsu(n);
    vector<bool> came(m+5);

    rep(block,ceil2(q,B)){
        dsu.reset(n);

        vector<array<int,3>> rem_edges;
        vector<array<int,3>> changed_edges;

        for(int i = block*B; i < min((block+1)*B,q); ++i){
            if(queries[i][0] == 1){
                int id = queries[i][1];
                changed_edges.pb({i,id,queries[i][2]});
                array<int,3> ar = {edges[id][2],2,id};
                if(st.count(ar)){
                    rem_edges.pb(ar);
                    st.erase(ar);
                }
            }
            else{
                auto [t,u,w] = queries[i];
                array<int,3> ar = {w,1,i};
                st.insert(ar);
            }
        }

        reverse(all(changed_edges));

        trav(ar,rem_edges){
            changed_edges.pb({block*B-1,ar[2],edges[ar[2]][2]});
        }

        for(auto it = st.rbegin(); it != st.rend(); ++it){
            auto [w,t,id] = *it;
            if(t == 2){
                auto [u,v,ww] = edges[id];
                dsu.merge(u,v);
            }
            else{
                dsu.history.clear();

                for(auto [query_id,edge_id,edge_w] : changed_edges){
                    if(query_id > id) conts;
                    if(came[edge_id]) conts;
                    came[edge_id] = 1;
                    if(edge_w >= w){
                        auto [u,v,ww] = edges[edge_id];
                        dsu.merge(u,v);
                    }
                }

                for(auto [query_id,edge_id,w] : changed_edges){
                    came[edge_id] = 0;
                }

                int u = queries[id][1];
                ans[id] = dsu.siz[dsu.find(u)];

                dsu.rollback();
            }
        }

        trav(ar,rem_edges){
            st.insert(ar);
        }

        for(int i = block*B; i < min((block+1)*B,q); ++i){
            if(queries[i][0] == 1){
                int id = queries[i][1];
                array<int,3> ar = {edges[id][2],2,id};
                st.erase(ar);
                edges[id][2] = queries[i][2];
                ar[0] = queries[i][2];
                st.insert(ar);
            }
            else{
                auto [t,u,w] = queries[i];
                array<int,3> ar = {w,1,i};
                st.erase(ar);
            }
        }
    }

    rep(i,q){
        if(ans[i] != -1){
            cout << ans[i] << endl;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 28 ms 604 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 21 ms 652 KB Output is correct
6 Correct 15 ms 604 KB Output is correct
7 Correct 17 ms 600 KB Output is correct
8 Correct 16 ms 604 KB Output is correct
9 Correct 19 ms 604 KB Output is correct
10 Correct 19 ms 576 KB Output is correct
11 Correct 17 ms 604 KB Output is correct
12 Correct 18 ms 600 KB Output is correct
13 Correct 20 ms 656 KB Output is correct
14 Correct 19 ms 600 KB Output is correct
15 Correct 20 ms 604 KB Output is correct
16 Correct 21 ms 604 KB Output is correct
17 Correct 18 ms 660 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 6480 KB Output is correct
2 Correct 944 ms 6484 KB Output is correct
3 Correct 963 ms 6728 KB Output is correct
4 Correct 1033 ms 6484 KB Output is correct
5 Correct 1299 ms 6588 KB Output is correct
6 Correct 1571 ms 8496 KB Output is correct
7 Correct 1285 ms 8520 KB Output is correct
8 Correct 1277 ms 8308 KB Output is correct
9 Correct 42 ms 2128 KB Output is correct
10 Correct 811 ms 7384 KB Output is correct
11 Correct 793 ms 7304 KB Output is correct
12 Correct 802 ms 8316 KB Output is correct
13 Correct 934 ms 8796 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 705 ms 5028 KB Output is correct
2 Correct 469 ms 2792 KB Output is correct
3 Correct 837 ms 5204 KB Output is correct
4 Correct 688 ms 4984 KB Output is correct
5 Correct 41 ms 2136 KB Output is correct
6 Correct 743 ms 5548 KB Output is correct
7 Correct 694 ms 5128 KB Output is correct
8 Correct 610 ms 5200 KB Output is correct
9 Correct 507 ms 5600 KB Output is correct
10 Correct 494 ms 5144 KB Output is correct
11 Correct 568 ms 5448 KB Output is correct
12 Correct 521 ms 5176 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1665 ms 10832 KB Output is correct
2 Correct 47 ms 2128 KB Output is correct
3 Correct 221 ms 8100 KB Output is correct
4 Correct 101 ms 8016 KB Output is correct
5 Correct 1094 ms 11212 KB Output is correct
6 Correct 1432 ms 10724 KB Output is correct
7 Correct 1074 ms 11460 KB Output is correct
8 Correct 648 ms 6492 KB Output is correct
9 Correct 643 ms 6668 KB Output is correct
10 Correct 632 ms 8400 KB Output is correct
11 Correct 1091 ms 8580 KB Output is correct
12 Correct 1030 ms 8600 KB Output is correct
13 Correct 1068 ms 10184 KB Output is correct
14 Correct 971 ms 12088 KB Output is correct
15 Correct 1038 ms 11772 KB Output is correct
16 Correct 1449 ms 10336 KB Output is correct
17 Correct 1596 ms 10468 KB Output is correct
18 Correct 1547 ms 10432 KB Output is correct
19 Correct 1509 ms 10392 KB Output is correct
20 Correct 1294 ms 11052 KB Output is correct
21 Correct 1278 ms 11064 KB Output is correct
22 Correct 1544 ms 11676 KB Output is correct
23 Correct 1026 ms 10692 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 6480 KB Output is correct
2 Correct 944 ms 6484 KB Output is correct
3 Correct 963 ms 6728 KB Output is correct
4 Correct 1033 ms 6484 KB Output is correct
5 Correct 1299 ms 6588 KB Output is correct
6 Correct 1571 ms 8496 KB Output is correct
7 Correct 1285 ms 8520 KB Output is correct
8 Correct 1277 ms 8308 KB Output is correct
9 Correct 42 ms 2128 KB Output is correct
10 Correct 811 ms 7384 KB Output is correct
11 Correct 793 ms 7304 KB Output is correct
12 Correct 802 ms 8316 KB Output is correct
13 Correct 934 ms 8796 KB Output is correct
14 Correct 705 ms 5028 KB Output is correct
15 Correct 469 ms 2792 KB Output is correct
16 Correct 837 ms 5204 KB Output is correct
17 Correct 688 ms 4984 KB Output is correct
18 Correct 41 ms 2136 KB Output is correct
19 Correct 743 ms 5548 KB Output is correct
20 Correct 694 ms 5128 KB Output is correct
21 Correct 610 ms 5200 KB Output is correct
22 Correct 507 ms 5600 KB Output is correct
23 Correct 494 ms 5144 KB Output is correct
24 Correct 568 ms 5448 KB Output is correct
25 Correct 521 ms 5176 KB Output is correct
26 Correct 942 ms 6484 KB Output is correct
27 Correct 1154 ms 6768 KB Output is correct
28 Correct 1004 ms 6484 KB Output is correct
29 Correct 847 ms 6720 KB Output is correct
30 Correct 1073 ms 6740 KB Output is correct
31 Correct 1078 ms 6560 KB Output is correct
32 Correct 1051 ms 6880 KB Output is correct
33 Correct 992 ms 6576 KB Output is correct
34 Correct 986 ms 6616 KB Output is correct
35 Correct 997 ms 6596 KB Output is correct
36 Correct 873 ms 6696 KB Output is correct
37 Correct 870 ms 6780 KB Output is correct
38 Correct 844 ms 6924 KB Output is correct
39 Correct 763 ms 6572 KB Output is correct
40 Correct 701 ms 6588 KB Output is correct
41 Correct 721 ms 6576 KB Output is correct
42 Correct 792 ms 7364 KB Output is correct
43 Correct 781 ms 7448 KB Output is correct
44 Correct 767 ms 7456 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 28 ms 604 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 21 ms 652 KB Output is correct
6 Correct 15 ms 604 KB Output is correct
7 Correct 17 ms 600 KB Output is correct
8 Correct 16 ms 604 KB Output is correct
9 Correct 19 ms 604 KB Output is correct
10 Correct 19 ms 576 KB Output is correct
11 Correct 17 ms 604 KB Output is correct
12 Correct 18 ms 600 KB Output is correct
13 Correct 20 ms 656 KB Output is correct
14 Correct 19 ms 600 KB Output is correct
15 Correct 20 ms 604 KB Output is correct
16 Correct 21 ms 604 KB Output is correct
17 Correct 18 ms 660 KB Output is correct
18 Correct 1000 ms 6480 KB Output is correct
19 Correct 944 ms 6484 KB Output is correct
20 Correct 963 ms 6728 KB Output is correct
21 Correct 1033 ms 6484 KB Output is correct
22 Correct 1299 ms 6588 KB Output is correct
23 Correct 1571 ms 8496 KB Output is correct
24 Correct 1285 ms 8520 KB Output is correct
25 Correct 1277 ms 8308 KB Output is correct
26 Correct 42 ms 2128 KB Output is correct
27 Correct 811 ms 7384 KB Output is correct
28 Correct 793 ms 7304 KB Output is correct
29 Correct 802 ms 8316 KB Output is correct
30 Correct 934 ms 8796 KB Output is correct
31 Correct 705 ms 5028 KB Output is correct
32 Correct 469 ms 2792 KB Output is correct
33 Correct 837 ms 5204 KB Output is correct
34 Correct 688 ms 4984 KB Output is correct
35 Correct 41 ms 2136 KB Output is correct
36 Correct 743 ms 5548 KB Output is correct
37 Correct 694 ms 5128 KB Output is correct
38 Correct 610 ms 5200 KB Output is correct
39 Correct 507 ms 5600 KB Output is correct
40 Correct 494 ms 5144 KB Output is correct
41 Correct 568 ms 5448 KB Output is correct
42 Correct 521 ms 5176 KB Output is correct
43 Correct 1665 ms 10832 KB Output is correct
44 Correct 47 ms 2128 KB Output is correct
45 Correct 221 ms 8100 KB Output is correct
46 Correct 101 ms 8016 KB Output is correct
47 Correct 1094 ms 11212 KB Output is correct
48 Correct 1432 ms 10724 KB Output is correct
49 Correct 1074 ms 11460 KB Output is correct
50 Correct 648 ms 6492 KB Output is correct
51 Correct 643 ms 6668 KB Output is correct
52 Correct 632 ms 8400 KB Output is correct
53 Correct 1091 ms 8580 KB Output is correct
54 Correct 1030 ms 8600 KB Output is correct
55 Correct 1068 ms 10184 KB Output is correct
56 Correct 971 ms 12088 KB Output is correct
57 Correct 1038 ms 11772 KB Output is correct
58 Correct 1449 ms 10336 KB Output is correct
59 Correct 1596 ms 10468 KB Output is correct
60 Correct 1547 ms 10432 KB Output is correct
61 Correct 1509 ms 10392 KB Output is correct
62 Correct 1294 ms 11052 KB Output is correct
63 Correct 1278 ms 11064 KB Output is correct
64 Correct 1544 ms 11676 KB Output is correct
65 Correct 1026 ms 10692 KB Output is correct
66 Correct 942 ms 6484 KB Output is correct
67 Correct 1154 ms 6768 KB Output is correct
68 Correct 1004 ms 6484 KB Output is correct
69 Correct 847 ms 6720 KB Output is correct
70 Correct 1073 ms 6740 KB Output is correct
71 Correct 1078 ms 6560 KB Output is correct
72 Correct 1051 ms 6880 KB Output is correct
73 Correct 992 ms 6576 KB Output is correct
74 Correct 986 ms 6616 KB Output is correct
75 Correct 997 ms 6596 KB Output is correct
76 Correct 873 ms 6696 KB Output is correct
77 Correct 870 ms 6780 KB Output is correct
78 Correct 844 ms 6924 KB Output is correct
79 Correct 763 ms 6572 KB Output is correct
80 Correct 701 ms 6588 KB Output is correct
81 Correct 721 ms 6576 KB Output is correct
82 Correct 792 ms 7364 KB Output is correct
83 Correct 781 ms 7448 KB Output is correct
84 Correct 767 ms 7456 KB Output is correct
85 Correct 1890 ms 10544 KB Output is correct
86 Correct 183 ms 8028 KB Output is correct
87 Correct 130 ms 7940 KB Output is correct
88 Correct 1495 ms 11468 KB Output is correct
89 Correct 1848 ms 10300 KB Output is correct
90 Correct 1409 ms 11364 KB Output is correct
91 Correct 1008 ms 6476 KB Output is correct
92 Correct 1004 ms 6484 KB Output is correct
93 Correct 1249 ms 8404 KB Output is correct
94 Correct 1430 ms 8432 KB Output is correct
95 Correct 1359 ms 8532 KB Output is correct
96 Correct 1499 ms 10180 KB Output is correct
97 Correct 1148 ms 11464 KB Output is correct
98 Correct 1401 ms 11204 KB Output is correct
99 Correct 1923 ms 10680 KB Output is correct
100 Correct 1822 ms 10508 KB Output is correct
101 Correct 1833 ms 10352 KB Output is correct
102 Correct 1790 ms 10372 KB Output is correct
103 Correct 1657 ms 10952 KB Output is correct
104 Correct 1602 ms 10988 KB Output is correct
105 Correct 1448 ms 10972 KB Output is correct
106 Correct 1288 ms 10432 KB Output is correct
107 Correct 1338 ms 10956 KB Output is correct
108 Correct 1854 ms 11720 KB Output is correct
109 Correct 1419 ms 10708 KB Output is correct