oj.uz

Submission #860067

# Submission time Handle Problem Language Result Execution time Memory
860067 2023-10-11T13:52:01 Z TahirAliyev Bridges (APIO19_bridges) C++17
100 / 100
 2198 ms 13152 KB 
#include <bits/stdc++.h>
using namespace std;

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

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

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 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 19 ms 4748 KB Output is correct
4 Correct 7 ms 4700 KB Output is correct
5 Correct 13 ms 4904 KB Output is correct
6 Correct 12 ms 4696 KB Output is correct
7 Correct 11 ms 4700 KB Output is correct
8 Correct 13 ms 4704 KB Output is correct
9 Correct 12 ms 4700 KB Output is correct
10 Correct 13 ms 4860 KB Output is correct
11 Correct 13 ms 4704 KB Output is correct
12 Correct 13 ms 4860 KB Output is correct
13 Correct 16 ms 4700 KB Output is correct
14 Correct 16 ms 4696 KB Output is correct
15 Correct 15 ms 4916 KB Output is correct
16 Correct 12 ms 4700 KB Output is correct
17 Correct 12 ms 4792 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1075 ms 7380 KB Output is correct
2 Correct 1125 ms 10188 KB Output is correct
3 Correct 1119 ms 9960 KB Output is correct
4 Correct 1108 ms 10080 KB Output is correct
5 Correct 1115 ms 10280 KB Output is correct
6 Correct 1205 ms 10076 KB Output is correct
7 Correct 1199 ms 10332 KB Output is correct
8 Correct 1211 ms 9924 KB Output is correct
9 Correct 62 ms 6216 KB Output is correct
10 Correct 608 ms 9100 KB Output is correct
11 Correct 631 ms 9156 KB Output is correct
12 Correct 1047 ms 9568 KB Output is correct
13 Correct 1054 ms 10440 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 749 ms 6604 KB Output is correct
2 Correct 348 ms 6812 KB Output is correct
3 Correct 781 ms 8928 KB Output is correct
4 Correct 748 ms 9168 KB Output is correct
5 Correct 62 ms 6096 KB Output is correct
6 Correct 765 ms 9040 KB Output is correct
7 Correct 727 ms 8908 KB Output is correct
8 Correct 711 ms 9012 KB Output is correct
9 Correct 657 ms 8648 KB Output is correct
10 Correct 639 ms 8648 KB Output is correct
11 Correct 662 ms 8972 KB Output is correct
12 Correct 653 ms 9044 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1989 ms 8252 KB Output is correct
2 Correct 62 ms 4700 KB Output is correct
3 Correct 246 ms 7892 KB Output is correct
4 Correct 144 ms 8004 KB Output is correct
5 Correct 1104 ms 8256 KB Output is correct
6 Correct 1966 ms 8444 KB Output is correct
7 Correct 1101 ms 8252 KB Output is correct
8 Correct 926 ms 6588 KB Output is correct
9 Correct 927 ms 6736 KB Output is correct
10 Correct 935 ms 6692 KB Output is correct
11 Correct 1475 ms 7468 KB Output is correct
12 Correct 1459 ms 7464 KB Output is correct
13 Correct 1479 ms 7460 KB Output is correct
14 Correct 1012 ms 8384 KB Output is correct
15 Correct 1076 ms 8384 KB Output is correct
16 Correct 1985 ms 8220 KB Output is correct
17 Correct 2011 ms 8216 KB Output is correct
18 Correct 1991 ms 8240 KB Output is correct
19 Correct 2001 ms 8228 KB Output is correct
20 Correct 1678 ms 8116 KB Output is correct
21 Correct 1665 ms 7996 KB Output is correct
22 Correct 1920 ms 8564 KB Output is correct
23 Correct 1114 ms 8128 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1075 ms 7380 KB Output is correct
2 Correct 1125 ms 10188 KB Output is correct
3 Correct 1119 ms 9960 KB Output is correct
4 Correct 1108 ms 10080 KB Output is correct
5 Correct 1115 ms 10280 KB Output is correct
6 Correct 1205 ms 10076 KB Output is correct
7 Correct 1199 ms 10332 KB Output is correct
8 Correct 1211 ms 9924 KB Output is correct
9 Correct 62 ms 6216 KB Output is correct
10 Correct 608 ms 9100 KB Output is correct
11 Correct 631 ms 9156 KB Output is correct
12 Correct 1047 ms 9568 KB Output is correct
13 Correct 1054 ms 10440 KB Output is correct
14 Correct 749 ms 6604 KB Output is correct
15 Correct 348 ms 6812 KB Output is correct
16 Correct 781 ms 8928 KB Output is correct
17 Correct 748 ms 9168 KB Output is correct
18 Correct 62 ms 6096 KB Output is correct
19 Correct 765 ms 9040 KB Output is correct
20 Correct 727 ms 8908 KB Output is correct
21 Correct 711 ms 9012 KB Output is correct
22 Correct 657 ms 8648 KB Output is correct
23 Correct 639 ms 8648 KB Output is correct
24 Correct 662 ms 8972 KB Output is correct
25 Correct 653 ms 9044 KB Output is correct
26 Correct 1060 ms 10132 KB Output is correct
27 Correct 1165 ms 9832 KB Output is correct
28 Correct 1116 ms 10332 KB Output is correct
29 Correct 1039 ms 10340 KB Output is correct
30 Correct 1147 ms 9992 KB Output is correct
31 Correct 1141 ms 9876 KB Output is correct
32 Correct 1153 ms 9848 KB Output is correct
33 Correct 1126 ms 10212 KB Output is correct
34 Correct 1113 ms 10304 KB Output is correct
35 Correct 1113 ms 10200 KB Output is correct
36 Correct 1040 ms 10208 KB Output is correct
37 Correct 1033 ms 10180 KB Output is correct
38 Correct 1037 ms 10048 KB Output is correct
39 Correct 965 ms 9724 KB Output is correct
40 Correct 971 ms 9668 KB Output is correct
41 Correct 976 ms 9480 KB Output is correct
42 Correct 964 ms 10164 KB Output is correct
43 Correct 976 ms 10492 KB Output is correct
44 Correct 971 ms 10252 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 19 ms 4748 KB Output is correct
4 Correct 7 ms 4700 KB Output is correct
5 Correct 13 ms 4904 KB Output is correct
6 Correct 12 ms 4696 KB Output is correct
7 Correct 11 ms 4700 KB Output is correct
8 Correct 13 ms 4704 KB Output is correct
9 Correct 12 ms 4700 KB Output is correct
10 Correct 13 ms 4860 KB Output is correct
11 Correct 13 ms 4704 KB Output is correct
12 Correct 13 ms 4860 KB Output is correct
13 Correct 16 ms 4700 KB Output is correct
14 Correct 16 ms 4696 KB Output is correct
15 Correct 15 ms 4916 KB Output is correct
16 Correct 12 ms 4700 KB Output is correct
17 Correct 12 ms 4792 KB Output is correct
18 Correct 1075 ms 7380 KB Output is correct
19 Correct 1125 ms 10188 KB Output is correct
20 Correct 1119 ms 9960 KB Output is correct
21 Correct 1108 ms 10080 KB Output is correct
22 Correct 1115 ms 10280 KB Output is correct
23 Correct 1205 ms 10076 KB Output is correct
24 Correct 1199 ms 10332 KB Output is correct
25 Correct 1211 ms 9924 KB Output is correct
26 Correct 62 ms 6216 KB Output is correct
27 Correct 608 ms 9100 KB Output is correct
28 Correct 631 ms 9156 KB Output is correct
29 Correct 1047 ms 9568 KB Output is correct
30 Correct 1054 ms 10440 KB Output is correct
31 Correct 749 ms 6604 KB Output is correct
32 Correct 348 ms 6812 KB Output is correct
33 Correct 781 ms 8928 KB Output is correct
34 Correct 748 ms 9168 KB Output is correct
35 Correct 62 ms 6096 KB Output is correct
36 Correct 765 ms 9040 KB Output is correct
37 Correct 727 ms 8908 KB Output is correct
38 Correct 711 ms 9012 KB Output is correct
39 Correct 657 ms 8648 KB Output is correct
40 Correct 639 ms 8648 KB Output is correct
41 Correct 662 ms 8972 KB Output is correct
42 Correct 653 ms 9044 KB Output is correct
43 Correct 1989 ms 8252 KB Output is correct
44 Correct 62 ms 4700 KB Output is correct
45 Correct 246 ms 7892 KB Output is correct
46 Correct 144 ms 8004 KB Output is correct
47 Correct 1104 ms 8256 KB Output is correct
48 Correct 1966 ms 8444 KB Output is correct
49 Correct 1101 ms 8252 KB Output is correct
50 Correct 926 ms 6588 KB Output is correct
51 Correct 927 ms 6736 KB Output is correct
52 Correct 935 ms 6692 KB Output is correct
53 Correct 1475 ms 7468 KB Output is correct
54 Correct 1459 ms 7464 KB Output is correct
55 Correct 1479 ms 7460 KB Output is correct
56 Correct 1012 ms 8384 KB Output is correct
57 Correct 1076 ms 8384 KB Output is correct
58 Correct 1985 ms 8220 KB Output is correct
59 Correct 2011 ms 8216 KB Output is correct
60 Correct 1991 ms 8240 KB Output is correct
61 Correct 2001 ms 8228 KB Output is correct
62 Correct 1678 ms 8116 KB Output is correct
63 Correct 1665 ms 7996 KB Output is correct
64 Correct 1920 ms 8564 KB Output is correct
65 Correct 1114 ms 8128 KB Output is correct
66 Correct 1060 ms 10132 KB Output is correct
67 Correct 1165 ms 9832 KB Output is correct
68 Correct 1116 ms 10332 KB Output is correct
69 Correct 1039 ms 10340 KB Output is correct
70 Correct 1147 ms 9992 KB Output is correct
71 Correct 1141 ms 9876 KB Output is correct
72 Correct 1153 ms 9848 KB Output is correct
73 Correct 1126 ms 10212 KB Output is correct
74 Correct 1113 ms 10304 KB Output is correct
75 Correct 1113 ms 10200 KB Output is correct
76 Correct 1040 ms 10208 KB Output is correct
77 Correct 1033 ms 10180 KB Output is correct
78 Correct 1037 ms 10048 KB Output is correct
79 Correct 965 ms 9724 KB Output is correct
80 Correct 971 ms 9668 KB Output is correct
81 Correct 976 ms 9480 KB Output is correct
82 Correct 964 ms 10164 KB Output is correct
83 Correct 976 ms 10492 KB Output is correct
84 Correct 971 ms 10252 KB Output is correct
85 Correct 2176 ms 13124 KB Output is correct
86 Correct 262 ms 9660 KB Output is correct
87 Correct 168 ms 10176 KB Output is correct
88 Correct 1231 ms 11744 KB Output is correct
89 Correct 2171 ms 13152 KB Output is correct
90 Correct 1241 ms 11660 KB Output is correct
91 Correct 1135 ms 10144 KB Output is correct
92 Correct 1108 ms 10184 KB Output is correct
93 Correct 1202 ms 10436 KB Output is correct
94 Correct 1689 ms 11488 KB Output is correct
95 Correct 1673 ms 11888 KB Output is correct
96 Correct 1707 ms 11420 KB Output is correct
97 Correct 1157 ms 10832 KB Output is correct
98 Correct 1171 ms 11504 KB Output is correct
99 Correct 2194 ms 12956 KB Output is correct
100 Correct 2198 ms 12788 KB Output is correct
101 Correct 2196 ms 12908 KB Output is correct
102 Correct 2189 ms 12920 KB Output is correct
103 Correct 1903 ms 12244 KB Output is correct
104 Correct 1942 ms 11728 KB Output is correct
105 Correct 1781 ms 12144 KB Output is correct
106 Correct 1550 ms 12208 KB Output is correct
107 Correct 1786 ms 11212 KB Output is correct
108 Correct 2122 ms 12480 KB Output is correct
109 Correct 1280 ms 10652 KB Output is correct