oj.uz

Submission #556931

# Submission time Handle Problem Language Result Execution time Memory
556931 2022-05-04T11:45:53 Z Jomnoi Bridges (APIO19_bridges) C++17
100 / 100
 2108 ms 12372 KB 
#include <bits/stdc++.h>
#define DEBUG false
using namespace std;

const int MAX_N = 5e4 + 10;
const int MAX_M = 1e5 + 10;
const int MAX_Q = 1e5 + 10;
const int BLK = 1000;

int parent[MAX_N], sz[MAX_N];
int U[MAX_M], V[MAX_M], D[MAX_M], changed[MAX_M];
int T[MAX_Q], X[MAX_Q], Y[MAX_Q], ans[MAX_Q];
vector <int> unchanged, update, query, tojoin[BLK];
stack <int> stk;

int root(int u) {
    if(u == parent[u]) {
        return u;
    }
    return root(parent[u]);
}

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

    if(sz[u] < sz[v]) {
        swap(u, v);
    }
    sz[u] += sz[v];
    parent[v] = u;
    stk.push(v);
}

void rollback(int timer) {
    while(stk.size() > timer) {
        int v = stk.top();
        stk.pop();

        sz[root(v)] -= sz[v];
        parent[v] = v;
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N, M;
    cin >> N >> M;

    for(int i = 1; i <= M; i++) {
        cin >> U[i] >> V[i] >> D[i];
    }

    int Q;
    cin >> Q;
    for(int i = 1; i <= Q; i++) {
        cin >> T[i] >> X[i] >> Y[i];
        if(T[i] == 1) {
            changed[X[i]] = true;
            update.push_back(i);
        }
        else {
            query.push_back(i);
        }
    }

    for(int l = 1; l <= Q; l += BLK) {
        int r = min(Q, l + BLK - 1);
        
        iota(parent + 1, parent + N + 1, 1);
        fill(sz + 1, sz + N + 1, 1);
        unchanged.clear(), update.clear(), query.clear();
        fill(changed + 1, changed + M + 1, false);
        while(!stk.empty()) {
            stk.pop();
        }

        for(int i = l; i <= r; i++) {
            if(T[i] == 1) {
                changed[X[i]] = true;
                update.push_back(i);
            }
            else {
                query.push_back(i);
            }
        }

        for(int i = 1; i <= M; i++) {
            if(changed[i] == false) {
                unchanged.push_back(i);
            }
        }

        for(int i = l; i <= r; i++) {
            if(T[i] == 1) {
                D[X[i]] = Y[i];
            }
            else {
                tojoin[i - l].clear();
                for(auto u : update) {
                    if(D[X[u]] >= Y[i]) {
                        tojoin[i - l].push_back(X[u]);
                    }
                }
            }
        }

        sort(query.begin(), query.end(), [&](const int &a, const int &b) {
            return Y[a] > Y[b];
        });
        sort(unchanged.begin(), unchanged.end(), [&](const int &a, const int &b) {
            return D[a] > D[b];
        });

        int j = 0;
        for(auto i : query) {
            while(j < unchanged.size() and D[unchanged[j]] >= Y[i]) {
                merge(U[unchanged[j]], V[unchanged[j]]);
                j++;
            }

            int timer = stk.size();
            for(auto e : tojoin[i - l]) {
                merge(U[e], V[e]);
            }

            ans[i] = sz[root(X[i])];
            
            rollback(timer);
        }
    }

    for(int i = 1; i <= Q; i++) {
        if(T[i] == 2) {
            cout << ans[i] << '\n';
        }
    }
    return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:38:22: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |     while(stk.size() > timer) {
      |           ~~~~~~~~~~~^~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:119:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |             while(j < unchanged.size() and D[unchanged[j]] >= Y[i]) {
      |                   ~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 2680 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 35 ms 2944 KB Output is correct
6 Correct 30 ms 2628 KB Output is correct
7 Correct 33 ms 3524 KB Output is correct
8 Correct 37 ms 2644 KB Output is correct
9 Correct 42 ms 4288 KB Output is correct
10 Correct 42 ms 2804 KB Output is correct
11 Correct 40 ms 2636 KB Output is correct
12 Correct 48 ms 2888 KB Output is correct
13 Correct 44 ms 2764 KB Output is correct
14 Correct 40 ms 2716 KB Output is correct
15 Correct 44 ms 2732 KB Output is correct
16 Correct 38 ms 3916 KB Output is correct
17 Correct 41 ms 3408 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 6472 KB Output is correct
2 Correct 1359 ms 6460 KB Output is correct
3 Correct 1372 ms 6568 KB Output is correct
4 Correct 1398 ms 6428 KB Output is correct
5 Correct 1397 ms 6720 KB Output is correct
6 Correct 2105 ms 8216 KB Output is correct
7 Correct 2076 ms 8104 KB Output is correct
8 Correct 2095 ms 8124 KB Output is correct
9 Correct 35 ms 2636 KB Output is correct
10 Correct 1191 ms 8140 KB Output is correct
11 Correct 1100 ms 8148 KB Output is correct
12 Correct 1187 ms 5000 KB Output is correct
13 Correct 1185 ms 7904 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1088 ms 6176 KB Output is correct
2 Correct 860 ms 7052 KB Output is correct
3 Correct 1358 ms 7868 KB Output is correct
4 Correct 1063 ms 6260 KB Output is correct
5 Correct 34 ms 2636 KB Output is correct
6 Correct 1227 ms 6140 KB Output is correct
7 Correct 979 ms 5932 KB Output is correct
8 Correct 850 ms 5668 KB Output is correct
9 Correct 733 ms 4252 KB Output is correct
10 Correct 661 ms 4184 KB Output is correct
11 Correct 765 ms 7468 KB Output is correct
12 Correct 652 ms 7476 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1527 ms 5300 KB Output is correct
2 Correct 38 ms 2636 KB Output is correct
3 Correct 150 ms 2652 KB Output is correct
4 Correct 70 ms 2744 KB Output is correct
5 Correct 709 ms 5244 KB Output is correct
6 Correct 1459 ms 5248 KB Output is correct
7 Correct 699 ms 5228 KB Output is correct
8 Correct 728 ms 4084 KB Output is correct
9 Correct 713 ms 4224 KB Output is correct
10 Correct 727 ms 4368 KB Output is correct
11 Correct 1115 ms 4640 KB Output is correct
12 Correct 1245 ms 4648 KB Output is correct
13 Correct 1069 ms 4928 KB Output is correct
14 Correct 630 ms 5408 KB Output is correct
15 Correct 670 ms 5348 KB Output is correct
16 Correct 1519 ms 5192 KB Output is correct
17 Correct 1482 ms 5244 KB Output is correct
18 Correct 1548 ms 5144 KB Output is correct
19 Correct 1485 ms 5224 KB Output is correct
20 Correct 1255 ms 5164 KB Output is correct
21 Correct 1260 ms 5084 KB Output is correct
22 Correct 1474 ms 5288 KB Output is correct
23 Correct 878 ms 4980 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 6472 KB Output is correct
2 Correct 1359 ms 6460 KB Output is correct
3 Correct 1372 ms 6568 KB Output is correct
4 Correct 1398 ms 6428 KB Output is correct
5 Correct 1397 ms 6720 KB Output is correct
6 Correct 2105 ms 8216 KB Output is correct
7 Correct 2076 ms 8104 KB Output is correct
8 Correct 2095 ms 8124 KB Output is correct
9 Correct 35 ms 2636 KB Output is correct
10 Correct 1191 ms 8140 KB Output is correct
11 Correct 1100 ms 8148 KB Output is correct
12 Correct 1187 ms 5000 KB Output is correct
13 Correct 1185 ms 7904 KB Output is correct
14 Correct 1088 ms 6176 KB Output is correct
15 Correct 860 ms 7052 KB Output is correct
16 Correct 1358 ms 7868 KB Output is correct
17 Correct 1063 ms 6260 KB Output is correct
18 Correct 34 ms 2636 KB Output is correct
19 Correct 1227 ms 6140 KB Output is correct
20 Correct 979 ms 5932 KB Output is correct
21 Correct 850 ms 5668 KB Output is correct
22 Correct 733 ms 4252 KB Output is correct
23 Correct 661 ms 4184 KB Output is correct
24 Correct 765 ms 7468 KB Output is correct
25 Correct 652 ms 7476 KB Output is correct
26 Correct 1411 ms 6752 KB Output is correct
27 Correct 1762 ms 8268 KB Output is correct
28 Correct 1478 ms 6536 KB Output is correct
29 Correct 1016 ms 6232 KB Output is correct
30 Correct 1659 ms 8052 KB Output is correct
31 Correct 1693 ms 8260 KB Output is correct
32 Correct 1676 ms 8256 KB Output is correct
33 Correct 1394 ms 6424 KB Output is correct
34 Correct 1445 ms 6460 KB Output is correct
35 Correct 1423 ms 6504 KB Output is correct
36 Correct 1012 ms 6188 KB Output is correct
37 Correct 993 ms 6244 KB Output is correct
38 Correct 1014 ms 6156 KB Output is correct
39 Correct 792 ms 4756 KB Output is correct
40 Correct 793 ms 4632 KB Output is correct
41 Correct 783 ms 4720 KB Output is correct
42 Correct 777 ms 7632 KB Output is correct
43 Correct 821 ms 7436 KB Output is correct
44 Correct 760 ms 7504 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 2680 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 35 ms 2944 KB Output is correct
6 Correct 30 ms 2628 KB Output is correct
7 Correct 33 ms 3524 KB Output is correct
8 Correct 37 ms 2644 KB Output is correct
9 Correct 42 ms 4288 KB Output is correct
10 Correct 42 ms 2804 KB Output is correct
11 Correct 40 ms 2636 KB Output is correct
12 Correct 48 ms 2888 KB Output is correct
13 Correct 44 ms 2764 KB Output is correct
14 Correct 40 ms 2716 KB Output is correct
15 Correct 44 ms 2732 KB Output is correct
16 Correct 38 ms 3916 KB Output is correct
17 Correct 41 ms 3408 KB Output is correct
18 Correct 1342 ms 6472 KB Output is correct
19 Correct 1359 ms 6460 KB Output is correct
20 Correct 1372 ms 6568 KB Output is correct
21 Correct 1398 ms 6428 KB Output is correct
22 Correct 1397 ms 6720 KB Output is correct
23 Correct 2105 ms 8216 KB Output is correct
24 Correct 2076 ms 8104 KB Output is correct
25 Correct 2095 ms 8124 KB Output is correct
26 Correct 35 ms 2636 KB Output is correct
27 Correct 1191 ms 8140 KB Output is correct
28 Correct 1100 ms 8148 KB Output is correct
29 Correct 1187 ms 5000 KB Output is correct
30 Correct 1185 ms 7904 KB Output is correct
31 Correct 1088 ms 6176 KB Output is correct
32 Correct 860 ms 7052 KB Output is correct
33 Correct 1358 ms 7868 KB Output is correct
34 Correct 1063 ms 6260 KB Output is correct
35 Correct 34 ms 2636 KB Output is correct
36 Correct 1227 ms 6140 KB Output is correct
37 Correct 979 ms 5932 KB Output is correct
38 Correct 850 ms 5668 KB Output is correct
39 Correct 733 ms 4252 KB Output is correct
40 Correct 661 ms 4184 KB Output is correct
41 Correct 765 ms 7468 KB Output is correct
42 Correct 652 ms 7476 KB Output is correct
43 Correct 1527 ms 5300 KB Output is correct
44 Correct 38 ms 2636 KB Output is correct
45 Correct 150 ms 2652 KB Output is correct
46 Correct 70 ms 2744 KB Output is correct
47 Correct 709 ms 5244 KB Output is correct
48 Correct 1459 ms 5248 KB Output is correct
49 Correct 699 ms 5228 KB Output is correct
50 Correct 728 ms 4084 KB Output is correct
51 Correct 713 ms 4224 KB Output is correct
52 Correct 727 ms 4368 KB Output is correct
53 Correct 1115 ms 4640 KB Output is correct
54 Correct 1245 ms 4648 KB Output is correct
55 Correct 1069 ms 4928 KB Output is correct
56 Correct 630 ms 5408 KB Output is correct
57 Correct 670 ms 5348 KB Output is correct
58 Correct 1519 ms 5192 KB Output is correct
59 Correct 1482 ms 5244 KB Output is correct
60 Correct 1548 ms 5144 KB Output is correct
61 Correct 1485 ms 5224 KB Output is correct
62 Correct 1255 ms 5164 KB Output is correct
63 Correct 1260 ms 5084 KB Output is correct
64 Correct 1474 ms 5288 KB Output is correct
65 Correct 878 ms 4980 KB Output is correct
66 Correct 1411 ms 6752 KB Output is correct
67 Correct 1762 ms 8268 KB Output is correct
68 Correct 1478 ms 6536 KB Output is correct
69 Correct 1016 ms 6232 KB Output is correct
70 Correct 1659 ms 8052 KB Output is correct
71 Correct 1693 ms 8260 KB Output is correct
72 Correct 1676 ms 8256 KB Output is correct
73 Correct 1394 ms 6424 KB Output is correct
74 Correct 1445 ms 6460 KB Output is correct
75 Correct 1423 ms 6504 KB Output is correct
76 Correct 1012 ms 6188 KB Output is correct
77 Correct 993 ms 6244 KB Output is correct
78 Correct 1014 ms 6156 KB Output is correct
79 Correct 792 ms 4756 KB Output is correct
80 Correct 793 ms 4632 KB Output is correct
81 Correct 783 ms 4720 KB Output is correct
82 Correct 777 ms 7632 KB Output is correct
83 Correct 821 ms 7436 KB Output is correct
84 Correct 760 ms 7504 KB Output is correct
85 Correct 1783 ms 11372 KB Output is correct
86 Correct 180 ms 6420 KB Output is correct
87 Correct 109 ms 7776 KB Output is correct
88 Correct 1072 ms 11712 KB Output is correct
89 Correct 1819 ms 11548 KB Output is correct
90 Correct 1098 ms 11508 KB Output is correct
91 Correct 1430 ms 9260 KB Output is correct
92 Correct 1402 ms 9268 KB Output is correct
93 Correct 2108 ms 10488 KB Output is correct
94 Correct 1548 ms 10428 KB Output is correct
95 Correct 1561 ms 10372 KB Output is correct
96 Correct 1841 ms 11860 KB Output is correct
97 Correct 805 ms 8184 KB Output is correct
98 Correct 917 ms 11384 KB Output is correct
99 Correct 1825 ms 11488 KB Output is correct
100 Correct 1812 ms 11188 KB Output is correct
101 Correct 1867 ms 11432 KB Output is correct
102 Correct 1854 ms 11612 KB Output is correct
103 Correct 2037 ms 12216 KB Output is correct
104 Correct 1962 ms 12372 KB Output is correct
105 Correct 1485 ms 12004 KB Output is correct
106 Correct 1185 ms 11596 KB Output is correct
107 Correct 1422 ms 8872 KB Output is correct
108 Correct 1855 ms 11568 KB Output is correct
109 Correct 1318 ms 10916 KB Output is correct