oj.uz

Submission #860068

# Submission time Handle Problem Language Result Execution time Memory
860068 2023-10-11T13:54:47 Z TahirAliyev Bridges (APIO19_bridges) C++17
100 / 100
 1607 ms 9712 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>

const int MAX = 1e5 + 5, BLOCK = 1000;

struct E{
    int a, b, w, id;
};

int par[MAX];
vector<array<int, 4>> op;

int get(int node){
    if(par[node] < 0){
        return node;
    }
    return get(par[node]);
}

void unite(int u, int v, bool tolist = false){
    u = get(u), v = get(v);
    if(u == v) return;
    if(-par[u] < -par[v]){
        swap(u, v);
    }
    if(tolist){
        op.push_back({u, v, par[u], par[v]});
    }
    par[u] += par[v];
    par[v] = u;
}

void rollback(){
    while(!op.empty()){
        array<int, 4> a = op.back();
        op.pop_back();
        par[a[0]] = a[2];
        par[a[1]] = a[3];
    }
}

int n, m, q;

vector<E> edges;
array<int, 3> queries[MAX];
int ans[MAX];

vector<E> ed;
vector<array<int, 3>> s;
vector<int> updated[MAX];
vector<int> updates;

bool comp(E a, E b){
    return a.w < b.w;
}

void clean(){
    memset(par, -1, sizeof(par));
    for(int a:updates){
        updated[a].clear();
    }
    updates.clear();
    ed = edges;
    op.clear();
    s.clear();
    sort(ed.rbegin(), ed.rend(), comp);
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        E e;
        cin >> e.a >> e.b >> e.w;
        e.id = i;
        edges.push_back(e);
    }
    cin >> q;
    for(int i = 1; i <= q; i++){
        cin >> queries[i][0] >> queries[i][1] >> queries[i][2];
    }

    for(int i = 1; i <= q; i += BLOCK){
        clean();
        for(int j = i; j <= i + BLOCK - 1 && j <= q; j++){
            if(queries[j][0] == 2){
                s.push_back({queries[j][2], queries[j][1], j});
            }
            else{
                if(updated[queries[j][1]].empty()){
                    updates.push_back(queries[j][1]);
                }
                updated[queries[j][1]].push_back(j);
            }
        }

        sort(s.rbegin(), s.rend());
        auto itr = ed.begin();
        for(auto a : s){
            while(itr != ed.end() && itr->w >= a[0]){
                if(updated[itr->id].empty()){
                    unite(itr->a, itr->b);
                }
                itr++;
            }
            for(int p : updates){
                int b = -1;
                for(int u : updated[p]){
                    if(u < a[2]){
                        b = u;
                    }
                    else{
                        break;
                    }
                }
                if(b == -1){
                    if(edges[p - 1].w >= a[0]){
                        unite(edges[p - 1].a, edges[p - 1].b, 1);
                    }
                }
                else{
                    if(queries[b][2] >= a[0]){
                        unite(edges[p - 1].a, edges[p - 1].b, 1);
                    }
                }
            }
            ans[a[2]] = -par[get(a[1])];
            rollback();
        }
        for(int u : updates){
            edges[u - 1].w = queries[updated[u].back()][2];
        }
    }

    for(int i = 1; i <= q; i++){
        if(queries[i][0] == 1) continue; 
        cout << ans[i] << '\n';
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 24 ms 4816 KB Output is correct
4 Correct 7 ms 4696 KB Output is correct
5 Correct 14 ms 4700 KB Output is correct
6 Correct 13 ms 4700 KB Output is correct
7 Correct 12 ms 4696 KB Output is correct
8 Correct 14 ms 4700 KB Output is correct
9 Correct 13 ms 4700 KB Output is correct
10 Correct 18 ms 4724 KB Output is correct
11 Correct 14 ms 4700 KB Output is correct
12 Correct 15 ms 4700 KB Output is correct
13 Correct 18 ms 4700 KB Output is correct
14 Correct 22 ms 4700 KB Output is correct
15 Correct 15 ms 4700 KB Output is correct
16 Correct 12 ms 4768 KB Output is correct
17 Correct 12 ms 4768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 849 ms 7472 KB Output is correct
2 Correct 888 ms 7216 KB Output is correct
3 Correct 907 ms 7304 KB Output is correct
4 Correct 884 ms 7176 KB Output is correct
5 Correct 898 ms 7268 KB Output is correct
6 Correct 1029 ms 7580 KB Output is correct
7 Correct 1027 ms 7584 KB Output is correct
8 Correct 1082 ms 7684 KB Output is correct
9 Correct 62 ms 4944 KB Output is correct
10 Correct 594 ms 7328 KB Output is correct
11 Correct 588 ms 7492 KB Output is correct
12 Correct 770 ms 6948 KB Output is correct
13 Correct 812 ms 7668 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 645 ms 6564 KB Output is correct
2 Correct 415 ms 5540 KB Output is correct
3 Correct 701 ms 6720 KB Output is correct
4 Correct 636 ms 6796 KB Output is correct
5 Correct 61 ms 4944 KB Output is correct
6 Correct 695 ms 6592 KB Output is correct
7 Correct 611 ms 6616 KB Output is correct
8 Correct 577 ms 6588 KB Output is correct
9 Correct 494 ms 6724 KB Output is correct
10 Correct 481 ms 6276 KB Output is correct
11 Correct 531 ms 6820 KB Output is correct
12 Correct 504 ms 6968 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1279 ms 8252 KB Output is correct
2 Correct 63 ms 4700 KB Output is correct
3 Correct 182 ms 8000 KB Output is correct
4 Correct 113 ms 7896 KB Output is correct
5 Correct 701 ms 8256 KB Output is correct
6 Correct 1274 ms 8248 KB Output is correct
7 Correct 708 ms 8440 KB Output is correct
8 Correct 595 ms 6592 KB Output is correct
9 Correct 595 ms 6600 KB Output is correct
10 Correct 599 ms 6596 KB Output is correct
11 Correct 937 ms 7612 KB Output is correct
12 Correct 940 ms 7440 KB Output is correct
13 Correct 933 ms 7592 KB Output is correct
14 Correct 643 ms 8504 KB Output is correct
15 Correct 692 ms 8716 KB Output is correct
16 Correct 1288 ms 8216 KB Output is correct
17 Correct 1279 ms 8220 KB Output is correct
18 Correct 1299 ms 8304 KB Output is correct
19 Correct 1261 ms 8220 KB Output is correct
20 Correct 1073 ms 7984 KB Output is correct
21 Correct 1049 ms 7988 KB Output is correct
22 Correct 1237 ms 8456 KB Output is correct
23 Correct 701 ms 8128 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 849 ms 7472 KB Output is correct
2 Correct 888 ms 7216 KB Output is correct
3 Correct 907 ms 7304 KB Output is correct
4 Correct 884 ms 7176 KB Output is correct
5 Correct 898 ms 7268 KB Output is correct
6 Correct 1029 ms 7580 KB Output is correct
7 Correct 1027 ms 7584 KB Output is correct
8 Correct 1082 ms 7684 KB Output is correct
9 Correct 62 ms 4944 KB Output is correct
10 Correct 594 ms 7328 KB Output is correct
11 Correct 588 ms 7492 KB Output is correct
12 Correct 770 ms 6948 KB Output is correct
13 Correct 812 ms 7668 KB Output is correct
14 Correct 645 ms 6564 KB Output is correct
15 Correct 415 ms 5540 KB Output is correct
16 Correct 701 ms 6720 KB Output is correct
17 Correct 636 ms 6796 KB Output is correct
18 Correct 61 ms 4944 KB Output is correct
19 Correct 695 ms 6592 KB Output is correct
20 Correct 611 ms 6616 KB Output is correct
21 Correct 577 ms 6588 KB Output is correct
22 Correct 494 ms 6724 KB Output is correct
23 Correct 481 ms 6276 KB Output is correct
24 Correct 531 ms 6820 KB Output is correct
25 Correct 504 ms 6968 KB Output is correct
26 Correct 837 ms 7548 KB Output is correct
27 Correct 956 ms 7876 KB Output is correct
28 Correct 895 ms 7480 KB Output is correct
29 Correct 771 ms 7620 KB Output is correct
30 Correct 948 ms 7368 KB Output is correct
31 Correct 988 ms 7512 KB Output is correct
32 Correct 980 ms 7548 KB Output is correct
33 Correct 874 ms 7504 KB Output is correct
34 Correct 875 ms 7620 KB Output is correct
35 Correct 873 ms 7804 KB Output is correct
36 Correct 802 ms 7624 KB Output is correct
37 Correct 778 ms 7712 KB Output is correct
38 Correct 776 ms 7408 KB Output is correct
39 Correct 682 ms 6856 KB Output is correct
40 Correct 658 ms 6640 KB Output is correct
41 Correct 686 ms 6700 KB Output is correct
42 Correct 674 ms 7584 KB Output is correct
43 Correct 711 ms 7524 KB Output is correct
44 Correct 682 ms 8040 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 24 ms 4816 KB Output is correct
4 Correct 7 ms 4696 KB Output is correct
5 Correct 14 ms 4700 KB Output is correct
6 Correct 13 ms 4700 KB Output is correct
7 Correct 12 ms 4696 KB Output is correct
8 Correct 14 ms 4700 KB Output is correct
9 Correct 13 ms 4700 KB Output is correct
10 Correct 18 ms 4724 KB Output is correct
11 Correct 14 ms 4700 KB Output is correct
12 Correct 15 ms 4700 KB Output is correct
13 Correct 18 ms 4700 KB Output is correct
14 Correct 22 ms 4700 KB Output is correct
15 Correct 15 ms 4700 KB Output is correct
16 Correct 12 ms 4768 KB Output is correct
17 Correct 12 ms 4768 KB Output is correct
18 Correct 849 ms 7472 KB Output is correct
19 Correct 888 ms 7216 KB Output is correct
20 Correct 907 ms 7304 KB Output is correct
21 Correct 884 ms 7176 KB Output is correct
22 Correct 898 ms 7268 KB Output is correct
23 Correct 1029 ms 7580 KB Output is correct
24 Correct 1027 ms 7584 KB Output is correct
25 Correct 1082 ms 7684 KB Output is correct
26 Correct 62 ms 4944 KB Output is correct
27 Correct 594 ms 7328 KB Output is correct
28 Correct 588 ms 7492 KB Output is correct
29 Correct 770 ms 6948 KB Output is correct
30 Correct 812 ms 7668 KB Output is correct
31 Correct 645 ms 6564 KB Output is correct
32 Correct 415 ms 5540 KB Output is correct
33 Correct 701 ms 6720 KB Output is correct
34 Correct 636 ms 6796 KB Output is correct
35 Correct 61 ms 4944 KB Output is correct
36 Correct 695 ms 6592 KB Output is correct
37 Correct 611 ms 6616 KB Output is correct
38 Correct 577 ms 6588 KB Output is correct
39 Correct 494 ms 6724 KB Output is correct
40 Correct 481 ms 6276 KB Output is correct
41 Correct 531 ms 6820 KB Output is correct
42 Correct 504 ms 6968 KB Output is correct
43 Correct 1279 ms 8252 KB Output is correct
44 Correct 63 ms 4700 KB Output is correct
45 Correct 182 ms 8000 KB Output is correct
46 Correct 113 ms 7896 KB Output is correct
47 Correct 701 ms 8256 KB Output is correct
48 Correct 1274 ms 8248 KB Output is correct
49 Correct 708 ms 8440 KB Output is correct
50 Correct 595 ms 6592 KB Output is correct
51 Correct 595 ms 6600 KB Output is correct
52 Correct 599 ms 6596 KB Output is correct
53 Correct 937 ms 7612 KB Output is correct
54 Correct 940 ms 7440 KB Output is correct
55 Correct 933 ms 7592 KB Output is correct
56 Correct 643 ms 8504 KB Output is correct
57 Correct 692 ms 8716 KB Output is correct
58 Correct 1288 ms 8216 KB Output is correct
59 Correct 1279 ms 8220 KB Output is correct
60 Correct 1299 ms 8304 KB Output is correct
61 Correct 1261 ms 8220 KB Output is correct
62 Correct 1073 ms 7984 KB Output is correct
63 Correct 1049 ms 7988 KB Output is correct
64 Correct 1237 ms 8456 KB Output is correct
65 Correct 701 ms 8128 KB Output is correct
66 Correct 837 ms 7548 KB Output is correct
67 Correct 956 ms 7876 KB Output is correct
68 Correct 895 ms 7480 KB Output is correct
69 Correct 771 ms 7620 KB Output is correct
70 Correct 948 ms 7368 KB Output is correct
71 Correct 988 ms 7512 KB Output is correct
72 Correct 980 ms 7548 KB Output is correct
73 Correct 874 ms 7504 KB Output is correct
74 Correct 875 ms 7620 KB Output is correct
75 Correct 873 ms 7804 KB Output is correct
76 Correct 802 ms 7624 KB Output is correct
77 Correct 778 ms 7712 KB Output is correct
78 Correct 776 ms 7408 KB Output is correct
79 Correct 682 ms 6856 KB Output is correct
80 Correct 658 ms 6640 KB Output is correct
81 Correct 686 ms 6700 KB Output is correct
82 Correct 674 ms 7584 KB Output is correct
83 Correct 711 ms 7524 KB Output is correct
84 Correct 682 ms 8040 KB Output is correct
85 Correct 1509 ms 9252 KB Output is correct
86 Correct 215 ms 8000 KB Output is correct
87 Correct 140 ms 7868 KB Output is correct
88 Correct 934 ms 9296 KB Output is correct
89 Correct 1538 ms 9120 KB Output is correct
90 Correct 937 ms 9128 KB Output is correct
91 Correct 896 ms 7708 KB Output is correct
92 Correct 886 ms 7224 KB Output is correct
93 Correct 1041 ms 7380 KB Output is correct
94 Correct 1263 ms 8348 KB Output is correct
95 Correct 1237 ms 8552 KB Output is correct
96 Correct 1315 ms 8572 KB Output is correct
97 Correct 784 ms 8700 KB Output is correct
98 Correct 826 ms 9336 KB Output is correct
99 Correct 1549 ms 9556 KB Output is correct
100 Correct 1541 ms 9076 KB Output is correct
101 Correct 1607 ms 9100 KB Output is correct
102 Correct 1559 ms 9712 KB Output is correct
103 Correct 1426 ms 8492 KB Output is correct
104 Correct 1440 ms 8588 KB Output is correct
105 Correct 1249 ms 8524 KB Output is correct
106 Correct 1058 ms 8548 KB Output is correct
107 Correct 1180 ms 8112 KB Output is correct
108 Correct 1510 ms 8896 KB Output is correct
109 Correct 1050 ms 8516 KB Output is correct