oj.uz

Submission #636612

# Submission time Handle Problem Language Result Execution time Memory
636612 2022-08-29T16:57:43 Z MohamedFaresNebili Bridges (APIO19_bridges) C++14
100 / 100
 2193 ms 31100 KB 
#include <bits/stdc++.h>

            using namespace std;

            const int batch = 1001;

            int N, M, Q, ans[100001];;
            int S[100001], P[100001];
            int U[100001], V[100001], W[100001];
            int T[100001], X[100001], Y[100001];
            vector<int> join[batch]; stack<int> st;
            bool changed[100001];

            void reset() {
                for(int i = 1; i <= N; i++)
                    P[i] = i, S[i] = 1;
            }

            int findSet(int a) {
                if(P[a] == a) return a;
                return findSet(P[a]);
            }

            void unionSet(int a, int b) {
                a = findSet(a), b = findSet(b);
                if(a == b) return;
                if(S[a] > S[b]) swap(a, b);
                st.push(a); S[b] += S[a];
                P[a] = P[b];
            }

            void restore(int x) {
                while(st.size() > x) {
                    int k = st.top(); st.pop();
                    S[P[k]] -= S[k]; P[k] = k;
                }
            }

            bool compare(int a, int b)  { return Y[a] > Y[b]; }
            bool compare2(int a, int b) { return W[a] > W[b]; }

            int32_t main() {
                ios_base::sync_with_stdio(0);
                cin.tie(0); cout.tie(0);
                cin >> N >> M;
                for(int i = 1; i <= M; i++)
                    cin >> U[i] >> V[i] >> W[i];
                cin >> Q;
                for(int i = 1; i <= Q; i++)
                    cin >> T[i] >> X[i] >> Y[i];

                for(int l = 1; l <= Q; l += batch) {
                    int r = min(Q + 1, l + batch); reset();
                    for(int i = 1; i <= M; i++)
                        changed[i] = false;

                    vector<int> ask, upd, E;
                    for(int i = l; i < r; i++) {
                        if(T[i] == 1) {
                            changed[X[i]] = true;
                            upd.push_back(i);
                        }
                        if(T[i] == 2) ask.push_back(i);
                    }
                    for(int i = 1; i <= M; i++) {
                        if(changed[i]) continue;
                        E.push_back(i);
                    }

                    for(int i = l; i < r; i++) {
                        if(T[i] == 1) W[X[i]] = Y[i];
                        if(T[i] == 2) {
                            join[i - l].clear();
                            for (int j : upd) {
                                if (W[X[j]] >= Y[i])
                                    join[i - l].push_back(X[j]);
                            }
                        }
                    }

                    sort(ask.begin(), ask.end(), compare);
                    sort(E.begin(), E.end(), compare2);

                    int cur = 0;
                    for(int i : ask) {
                        while(cur < E.size() && W[E[cur]] >= Y[i]) {
                            unionSet(U[E[cur]], V[E[cur]]);
                            cur++;
                        }
                        int prev = st.size();
                        for(int j : join[i - l]) unionSet(U[j], V[j]);
                        ans[i] = S[findSet(X[i])];
                        restore(prev);
                    }
                }

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

Compilation message

bridges.cpp: In function 'void restore(int)':
bridges.cpp:33:33: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |                 while(st.size() > x) {
      |                       ~~~~~~~~~~^~~
bridges.cpp: In function 'int32_t main()':
bridges.cpp:86:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |                         while(cur < E.size() && W[E[cur]] >= 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 0 ms 340 KB Output is correct
3 Correct 34 ms 2696 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 35 ms 3276 KB Output is correct
6 Correct 25 ms 2740 KB Output is correct
7 Correct 30 ms 3540 KB Output is correct
8 Correct 35 ms 2680 KB Output is correct
9 Correct 41 ms 3872 KB Output is correct
10 Correct 36 ms 2892 KB Output is correct
11 Correct 36 ms 2756 KB Output is correct
12 Correct 44 ms 2852 KB Output is correct
13 Correct 41 ms 2892 KB Output is correct
14 Correct 37 ms 2792 KB Output is correct
15 Correct 40 ms 2764 KB Output is correct
16 Correct 37 ms 3916 KB Output is correct
17 Correct 37 ms 3456 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1295 ms 26148 KB Output is correct
2 Correct 1302 ms 26440 KB Output is correct
3 Correct 1350 ms 26380 KB Output is correct
4 Correct 1336 ms 26412 KB Output is correct
5 Correct 1327 ms 26448 KB Output is correct
6 Correct 1953 ms 28180 KB Output is correct
7 Correct 1944 ms 27972 KB Output is correct
8 Correct 1968 ms 28132 KB Output is correct
9 Correct 36 ms 2252 KB Output is correct
10 Correct 1084 ms 27988 KB Output is correct
11 Correct 1000 ms 27980 KB Output is correct
12 Correct 1170 ms 24940 KB Output is correct
13 Correct 1184 ms 27692 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1048 ms 18708 KB Output is correct
2 Correct 782 ms 9804 KB Output is correct
3 Correct 1263 ms 21336 KB Output is correct
4 Correct 1057 ms 20704 KB Output is correct
5 Correct 35 ms 3404 KB Output is correct
6 Correct 1196 ms 20676 KB Output is correct
7 Correct 984 ms 20396 KB Output is correct
8 Correct 837 ms 20216 KB Output is correct
9 Correct 697 ms 19080 KB Output is correct
10 Correct 629 ms 18924 KB Output is correct
11 Correct 746 ms 21744 KB Output is correct
12 Correct 662 ms 21836 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1651 ms 24920 KB Output is correct
2 Correct 34 ms 2092 KB Output is correct
3 Correct 163 ms 2700 KB Output is correct
4 Correct 81 ms 2696 KB Output is correct
5 Correct 828 ms 24872 KB Output is correct
6 Correct 1583 ms 24912 KB Output is correct
7 Correct 837 ms 24940 KB Output is correct
8 Correct 788 ms 23844 KB Output is correct
9 Correct 782 ms 23908 KB Output is correct
10 Correct 770 ms 24064 KB Output is correct
11 Correct 1198 ms 24848 KB Output is correct
12 Correct 1170 ms 24852 KB Output is correct
13 Correct 1211 ms 24996 KB Output is correct
14 Correct 754 ms 24996 KB Output is correct
15 Correct 838 ms 24876 KB Output is correct
16 Correct 1600 ms 25136 KB Output is correct
17 Correct 1613 ms 25124 KB Output is correct
18 Correct 1647 ms 25312 KB Output is correct
19 Correct 1632 ms 25188 KB Output is correct
20 Correct 1330 ms 25304 KB Output is correct
21 Correct 1353 ms 25272 KB Output is correct
22 Correct 1523 ms 24876 KB Output is correct
23 Correct 896 ms 22984 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1295 ms 26148 KB Output is correct
2 Correct 1302 ms 26440 KB Output is correct
3 Correct 1350 ms 26380 KB Output is correct
4 Correct 1336 ms 26412 KB Output is correct
5 Correct 1327 ms 26448 KB Output is correct
6 Correct 1953 ms 28180 KB Output is correct
7 Correct 1944 ms 27972 KB Output is correct
8 Correct 1968 ms 28132 KB Output is correct
9 Correct 36 ms 2252 KB Output is correct
10 Correct 1084 ms 27988 KB Output is correct
11 Correct 1000 ms 27980 KB Output is correct
12 Correct 1170 ms 24940 KB Output is correct
13 Correct 1184 ms 27692 KB Output is correct
14 Correct 1048 ms 18708 KB Output is correct
15 Correct 782 ms 9804 KB Output is correct
16 Correct 1263 ms 21336 KB Output is correct
17 Correct 1057 ms 20704 KB Output is correct
18 Correct 35 ms 3404 KB Output is correct
19 Correct 1196 ms 20676 KB Output is correct
20 Correct 984 ms 20396 KB Output is correct
21 Correct 837 ms 20216 KB Output is correct
22 Correct 697 ms 19080 KB Output is correct
23 Correct 629 ms 18924 KB Output is correct
24 Correct 746 ms 21744 KB Output is correct
25 Correct 662 ms 21836 KB Output is correct
26 Correct 1414 ms 28144 KB Output is correct
27 Correct 1645 ms 30036 KB Output is correct
28 Correct 1375 ms 28156 KB Output is correct
29 Correct 995 ms 27612 KB Output is correct
30 Correct 1575 ms 29884 KB Output is correct
31 Correct 1630 ms 29868 KB Output is correct
32 Correct 1635 ms 30056 KB Output is correct
33 Correct 1356 ms 28176 KB Output is correct
34 Correct 1400 ms 28268 KB Output is correct
35 Correct 1387 ms 28256 KB Output is correct
36 Correct 1062 ms 27624 KB Output is correct
37 Correct 1084 ms 27860 KB Output is correct
38 Correct 1043 ms 27840 KB Output is correct
39 Correct 880 ms 26240 KB Output is correct
40 Correct 862 ms 26344 KB Output is correct
41 Correct 884 ms 26288 KB Output is correct
42 Correct 867 ms 28320 KB Output is correct
43 Correct 871 ms 28136 KB Output is correct
44 Correct 852 ms 28128 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 0 ms 340 KB Output is correct
3 Correct 34 ms 2696 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 35 ms 3276 KB Output is correct
6 Correct 25 ms 2740 KB Output is correct
7 Correct 30 ms 3540 KB Output is correct
8 Correct 35 ms 2680 KB Output is correct
9 Correct 41 ms 3872 KB Output is correct
10 Correct 36 ms 2892 KB Output is correct
11 Correct 36 ms 2756 KB Output is correct
12 Correct 44 ms 2852 KB Output is correct
13 Correct 41 ms 2892 KB Output is correct
14 Correct 37 ms 2792 KB Output is correct
15 Correct 40 ms 2764 KB Output is correct
16 Correct 37 ms 3916 KB Output is correct
17 Correct 37 ms 3456 KB Output is correct
18 Correct 1295 ms 26148 KB Output is correct
19 Correct 1302 ms 26440 KB Output is correct
20 Correct 1350 ms 26380 KB Output is correct
21 Correct 1336 ms 26412 KB Output is correct
22 Correct 1327 ms 26448 KB Output is correct
23 Correct 1953 ms 28180 KB Output is correct
24 Correct 1944 ms 27972 KB Output is correct
25 Correct 1968 ms 28132 KB Output is correct
26 Correct 36 ms 2252 KB Output is correct
27 Correct 1084 ms 27988 KB Output is correct
28 Correct 1000 ms 27980 KB Output is correct
29 Correct 1170 ms 24940 KB Output is correct
30 Correct 1184 ms 27692 KB Output is correct
31 Correct 1048 ms 18708 KB Output is correct
32 Correct 782 ms 9804 KB Output is correct
33 Correct 1263 ms 21336 KB Output is correct
34 Correct 1057 ms 20704 KB Output is correct
35 Correct 35 ms 3404 KB Output is correct
36 Correct 1196 ms 20676 KB Output is correct
37 Correct 984 ms 20396 KB Output is correct
38 Correct 837 ms 20216 KB Output is correct
39 Correct 697 ms 19080 KB Output is correct
40 Correct 629 ms 18924 KB Output is correct
41 Correct 746 ms 21744 KB Output is correct
42 Correct 662 ms 21836 KB Output is correct
43 Correct 1651 ms 24920 KB Output is correct
44 Correct 34 ms 2092 KB Output is correct
45 Correct 163 ms 2700 KB Output is correct
46 Correct 81 ms 2696 KB Output is correct
47 Correct 828 ms 24872 KB Output is correct
48 Correct 1583 ms 24912 KB Output is correct
49 Correct 837 ms 24940 KB Output is correct
50 Correct 788 ms 23844 KB Output is correct
51 Correct 782 ms 23908 KB Output is correct
52 Correct 770 ms 24064 KB Output is correct
53 Correct 1198 ms 24848 KB Output is correct
54 Correct 1170 ms 24852 KB Output is correct
55 Correct 1211 ms 24996 KB Output is correct
56 Correct 754 ms 24996 KB Output is correct
57 Correct 838 ms 24876 KB Output is correct
58 Correct 1600 ms 25136 KB Output is correct
59 Correct 1613 ms 25124 KB Output is correct
60 Correct 1647 ms 25312 KB Output is correct
61 Correct 1632 ms 25188 KB Output is correct
62 Correct 1330 ms 25304 KB Output is correct
63 Correct 1353 ms 25272 KB Output is correct
64 Correct 1523 ms 24876 KB Output is correct
65 Correct 896 ms 22984 KB Output is correct
66 Correct 1414 ms 28144 KB Output is correct
67 Correct 1645 ms 30036 KB Output is correct
68 Correct 1375 ms 28156 KB Output is correct
69 Correct 995 ms 27612 KB Output is correct
70 Correct 1575 ms 29884 KB Output is correct
71 Correct 1630 ms 29868 KB Output is correct
72 Correct 1635 ms 30056 KB Output is correct
73 Correct 1356 ms 28176 KB Output is correct
74 Correct 1400 ms 28268 KB Output is correct
75 Correct 1387 ms 28256 KB Output is correct
76 Correct 1062 ms 27624 KB Output is correct
77 Correct 1084 ms 27860 KB Output is correct
78 Correct 1043 ms 27840 KB Output is correct
79 Correct 880 ms 26240 KB Output is correct
80 Correct 862 ms 26344 KB Output is correct
81 Correct 884 ms 26288 KB Output is correct
82 Correct 867 ms 28320 KB Output is correct
83 Correct 871 ms 28136 KB Output is correct
84 Correct 852 ms 28128 KB Output is correct
85 Correct 2072 ms 28992 KB Output is correct
86 Correct 207 ms 6588 KB Output is correct
87 Correct 126 ms 7948 KB Output is correct
88 Correct 1232 ms 30872 KB Output is correct
89 Correct 2017 ms 29236 KB Output is correct
90 Correct 1274 ms 30928 KB Output is correct
91 Correct 1412 ms 28124 KB Output is correct
92 Correct 1410 ms 28036 KB Output is correct
93 Correct 2012 ms 29496 KB Output is correct
94 Correct 1687 ms 29160 KB Output is correct
95 Correct 1723 ms 29140 KB Output is correct
96 Correct 1989 ms 30668 KB Output is correct
97 Correct 1010 ms 27292 KB Output is correct
98 Correct 1018 ms 30552 KB Output is correct
99 Correct 2054 ms 29460 KB Output is correct
100 Correct 2029 ms 29216 KB Output is correct
101 Correct 2093 ms 29440 KB Output is correct
102 Correct 2078 ms 29624 KB Output is correct
103 Correct 2162 ms 30848 KB Output is correct
104 Correct 2193 ms 31100 KB Output is correct
105 Correct 1665 ms 30776 KB Output is correct
106 Correct 1359 ms 30284 KB Output is correct
107 Correct 1550 ms 27796 KB Output is correct
108 Correct 2087 ms 29664 KB Output is correct
109 Correct 1475 ms 27344 KB Output is correct