oj.uz

Submission #916305

# Submission time Handle Problem Language Result Execution time Memory
916305 2024-01-25T15:53:37 Z GrindMachine Bridges (APIO19_bridges) C++17
100 / 100
 2940 ms 15312 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 = 405;

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 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 17 ms 732 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 14 ms 652 KB Output is correct
6 Correct 13 ms 656 KB Output is correct
7 Correct 16 ms 600 KB Output is correct
8 Correct 15 ms 604 KB Output is correct
9 Correct 17 ms 604 KB Output is correct
10 Correct 15 ms 656 KB Output is correct
11 Correct 15 ms 664 KB Output is correct
12 Correct 15 ms 608 KB Output is correct
13 Correct 18 ms 608 KB Output is correct
14 Correct 17 ms 608 KB Output is correct
15 Correct 16 ms 672 KB Output is correct
16 Correct 16 ms 608 KB Output is correct
17 Correct 16 ms 608 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1068 ms 6824 KB Output is correct
2 Correct 1091 ms 6548 KB Output is correct
3 Correct 1185 ms 6568 KB Output is correct
4 Correct 1123 ms 6804 KB Output is correct
5 Correct 1114 ms 6572 KB Output is correct
6 Correct 1284 ms 8400 KB Output is correct
7 Correct 1365 ms 8340 KB Output is correct
8 Correct 1346 ms 8476 KB Output is correct
9 Correct 48 ms 2128 KB Output is correct
10 Correct 842 ms 7328 KB Output is correct
11 Correct 856 ms 7460 KB Output is correct
12 Correct 964 ms 8396 KB Output is correct
13 Correct 1093 ms 8496 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 782 ms 5204 KB Output is correct
2 Correct 412 ms 3008 KB Output is correct
3 Correct 842 ms 5204 KB Output is correct
4 Correct 801 ms 4984 KB Output is correct
5 Correct 45 ms 2132 KB Output is correct
6 Correct 780 ms 5336 KB Output is correct
7 Correct 776 ms 5096 KB Output is correct
8 Correct 723 ms 5204 KB Output is correct
9 Correct 643 ms 5588 KB Output is correct
10 Correct 622 ms 5132 KB Output is correct
11 Correct 731 ms 5712 KB Output is correct
12 Correct 645 ms 5476 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2940 ms 10528 KB Output is correct
2 Correct 44 ms 3400 KB Output is correct
3 Correct 224 ms 9936 KB Output is correct
4 Correct 141 ms 10060 KB Output is correct
5 Correct 1799 ms 13512 KB Output is correct
6 Correct 2381 ms 14372 KB Output is correct
7 Correct 1433 ms 13708 KB Output is correct
8 Correct 917 ms 9132 KB Output is correct
9 Correct 971 ms 9296 KB Output is correct
10 Correct 934 ms 10956 KB Output is correct
11 Correct 1521 ms 11696 KB Output is correct
12 Correct 1418 ms 11956 KB Output is correct
13 Correct 1501 ms 13256 KB Output is correct
14 Correct 1441 ms 14532 KB Output is correct
15 Correct 1522 ms 14012 KB Output is correct
16 Correct 2139 ms 14200 KB Output is correct
17 Correct 2159 ms 14276 KB Output is correct
18 Correct 2160 ms 14432 KB Output is correct
19 Correct 2245 ms 14720 KB Output is correct
20 Correct 1758 ms 14204 KB Output is correct
21 Correct 1783 ms 14272 KB Output is correct
22 Correct 2003 ms 15300 KB Output is correct
23 Correct 1455 ms 12696 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1068 ms 6824 KB Output is correct
2 Correct 1091 ms 6548 KB Output is correct
3 Correct 1185 ms 6568 KB Output is correct
4 Correct 1123 ms 6804 KB Output is correct
5 Correct 1114 ms 6572 KB Output is correct
6 Correct 1284 ms 8400 KB Output is correct
7 Correct 1365 ms 8340 KB Output is correct
8 Correct 1346 ms 8476 KB Output is correct
9 Correct 48 ms 2128 KB Output is correct
10 Correct 842 ms 7328 KB Output is correct
11 Correct 856 ms 7460 KB Output is correct
12 Correct 964 ms 8396 KB Output is correct
13 Correct 1093 ms 8496 KB Output is correct
14 Correct 782 ms 5204 KB Output is correct
15 Correct 412 ms 3008 KB Output is correct
16 Correct 842 ms 5204 KB Output is correct
17 Correct 801 ms 4984 KB Output is correct
18 Correct 45 ms 2132 KB Output is correct
19 Correct 780 ms 5336 KB Output is correct
20 Correct 776 ms 5096 KB Output is correct
21 Correct 723 ms 5204 KB Output is correct
22 Correct 643 ms 5588 KB Output is correct
23 Correct 622 ms 5132 KB Output is correct
24 Correct 731 ms 5712 KB Output is correct
25 Correct 645 ms 5476 KB Output is correct
26 Correct 1066 ms 6568 KB Output is correct
27 Correct 1247 ms 6724 KB Output is correct
28 Correct 1181 ms 6636 KB Output is correct
29 Correct 1071 ms 6876 KB Output is correct
30 Correct 1196 ms 6580 KB Output is correct
31 Correct 1215 ms 6740 KB Output is correct
32 Correct 1229 ms 6608 KB Output is correct
33 Correct 1159 ms 6764 KB Output is correct
34 Correct 1144 ms 6788 KB Output is correct
35 Correct 1181 ms 6720 KB Output is correct
36 Correct 1054 ms 6664 KB Output is correct
37 Correct 1045 ms 6612 KB Output is correct
38 Correct 1056 ms 6680 KB Output is correct
39 Correct 930 ms 6740 KB Output is correct
40 Correct 961 ms 6880 KB Output is correct
41 Correct 962 ms 6832 KB Output is correct
42 Correct 988 ms 7368 KB Output is correct
43 Correct 1020 ms 7384 KB Output is correct
44 Correct 1012 ms 7368 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 17 ms 732 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 14 ms 652 KB Output is correct
6 Correct 13 ms 656 KB Output is correct
7 Correct 16 ms 600 KB Output is correct
8 Correct 15 ms 604 KB Output is correct
9 Correct 17 ms 604 KB Output is correct
10 Correct 15 ms 656 KB Output is correct
11 Correct 15 ms 664 KB Output is correct
12 Correct 15 ms 608 KB Output is correct
13 Correct 18 ms 608 KB Output is correct
14 Correct 17 ms 608 KB Output is correct
15 Correct 16 ms 672 KB Output is correct
16 Correct 16 ms 608 KB Output is correct
17 Correct 16 ms 608 KB Output is correct
18 Correct 1068 ms 6824 KB Output is correct
19 Correct 1091 ms 6548 KB Output is correct
20 Correct 1185 ms 6568 KB Output is correct
21 Correct 1123 ms 6804 KB Output is correct
22 Correct 1114 ms 6572 KB Output is correct
23 Correct 1284 ms 8400 KB Output is correct
24 Correct 1365 ms 8340 KB Output is correct
25 Correct 1346 ms 8476 KB Output is correct
26 Correct 48 ms 2128 KB Output is correct
27 Correct 842 ms 7328 KB Output is correct
28 Correct 856 ms 7460 KB Output is correct
29 Correct 964 ms 8396 KB Output is correct
30 Correct 1093 ms 8496 KB Output is correct
31 Correct 782 ms 5204 KB Output is correct
32 Correct 412 ms 3008 KB Output is correct
33 Correct 842 ms 5204 KB Output is correct
34 Correct 801 ms 4984 KB Output is correct
35 Correct 45 ms 2132 KB Output is correct
36 Correct 780 ms 5336 KB Output is correct
37 Correct 776 ms 5096 KB Output is correct
38 Correct 723 ms 5204 KB Output is correct
39 Correct 643 ms 5588 KB Output is correct
40 Correct 622 ms 5132 KB Output is correct
41 Correct 731 ms 5712 KB Output is correct
42 Correct 645 ms 5476 KB Output is correct
43 Correct 2940 ms 10528 KB Output is correct
44 Correct 44 ms 3400 KB Output is correct
45 Correct 224 ms 9936 KB Output is correct
46 Correct 141 ms 10060 KB Output is correct
47 Correct 1799 ms 13512 KB Output is correct
48 Correct 2381 ms 14372 KB Output is correct
49 Correct 1433 ms 13708 KB Output is correct
50 Correct 917 ms 9132 KB Output is correct
51 Correct 971 ms 9296 KB Output is correct
52 Correct 934 ms 10956 KB Output is correct
53 Correct 1521 ms 11696 KB Output is correct
54 Correct 1418 ms 11956 KB Output is correct
55 Correct 1501 ms 13256 KB Output is correct
56 Correct 1441 ms 14532 KB Output is correct
57 Correct 1522 ms 14012 KB Output is correct
58 Correct 2139 ms 14200 KB Output is correct
59 Correct 2159 ms 14276 KB Output is correct
60 Correct 2160 ms 14432 KB Output is correct
61 Correct 2245 ms 14720 KB Output is correct
62 Correct 1758 ms 14204 KB Output is correct
63 Correct 1783 ms 14272 KB Output is correct
64 Correct 2003 ms 15300 KB Output is correct
65 Correct 1455 ms 12696 KB Output is correct
66 Correct 1066 ms 6568 KB Output is correct
67 Correct 1247 ms 6724 KB Output is correct
68 Correct 1181 ms 6636 KB Output is correct
69 Correct 1071 ms 6876 KB Output is correct
70 Correct 1196 ms 6580 KB Output is correct
71 Correct 1215 ms 6740 KB Output is correct
72 Correct 1229 ms 6608 KB Output is correct
73 Correct 1159 ms 6764 KB Output is correct
74 Correct 1144 ms 6788 KB Output is correct
75 Correct 1181 ms 6720 KB Output is correct
76 Correct 1054 ms 6664 KB Output is correct
77 Correct 1045 ms 6612 KB Output is correct
78 Correct 1056 ms 6680 KB Output is correct
79 Correct 930 ms 6740 KB Output is correct
80 Correct 961 ms 6880 KB Output is correct
81 Correct 962 ms 6832 KB Output is correct
82 Correct 988 ms 7368 KB Output is correct
83 Correct 1020 ms 7384 KB Output is correct
84 Correct 1012 ms 7368 KB Output is correct
85 Correct 2329 ms 14168 KB Output is correct
86 Correct 247 ms 9948 KB Output is correct
87 Correct 153 ms 10068 KB Output is correct
88 Correct 1856 ms 13516 KB Output is correct
89 Correct 2231 ms 14500 KB Output is correct
90 Correct 1820 ms 13888 KB Output is correct
91 Correct 1158 ms 9212 KB Output is correct
92 Correct 1124 ms 9556 KB Output is correct
93 Correct 1304 ms 10956 KB Output is correct
94 Correct 1813 ms 11596 KB Output is correct
95 Correct 1727 ms 11992 KB Output is correct
96 Correct 1788 ms 13440 KB Output is correct
97 Correct 1619 ms 13676 KB Output is correct
98 Correct 1742 ms 13432 KB Output is correct
99 Correct 2457 ms 14164 KB Output is correct
100 Correct 2488 ms 14192 KB Output is correct
101 Correct 2452 ms 14240 KB Output is correct
102 Correct 2549 ms 14304 KB Output is correct
103 Correct 2091 ms 14092 KB Output is correct
104 Correct 2081 ms 14032 KB Output is correct
105 Correct 2116 ms 14376 KB Output is correct
106 Correct 1664 ms 13512 KB Output is correct
107 Correct 1894 ms 14200 KB Output is correct
108 Correct 2476 ms 15312 KB Output is correct
109 Correct 1795 ms 12748 KB Output is correct