oj.uz

Submission #355432

# Submission time Handle Problem Language Result Execution time Memory
355432 2021-01-22T13:07:32 Z parsabahrami Bridges (APIO19_bridges) C++17
100 / 100
 2836 ms 111272 KB 
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 5e4 + 5, SQ = 700;
int P[N], S[N], ret[N * 2], M[N * 2], W[N * 2], U[N * 2], V[N * 2], t[N * 2], X[N * 2], Y[N * 2], n, q, m;
vector<pii> hist; vector<int> vec[N * 2], ask, upd, gd;

int Find(int v) {
    return !P[v] ? v : Find(P[v]);
}

int Union(int u, int v) {
    u = Find(u), v = Find(v);
    if (u == v) return 0;
    if (S[u] > S[v]) swap(u, v);
    hist.push_back({v, u});
    P[u] = v, S[v] += S[u];
    return 1;  
}

void Undo(int C) {
    while (C--) {
        int u, v; tie(v, u) = hist.back(); hist.pop_back();
        P[u] = 0, S[v] -= S[u];
    }
}

int main() {
    fill(S, S + N, 1);
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d", &U[i], &V[i], &W[i]);
    }
    scanf("%d", &q);
    for (int i = 1; i <= q; i++) scanf("%d%d%d", &t[i], &X[i], &Y[i]);
    for (int l = 1; l <= q; l += SQ) {
        int r = min(q, l + SQ - 1);
        Undo(SZ(hist));
        memset(M, 0, sizeof M); 
        upd = ask = gd = {};
        for (int i = l; i <= r; i++) {
            if (t[i] == 1) {
                M[X[i]] = 1;
                upd.push_back(i);
            } else {
                ask.push_back(i);
            }
        }
        for (int i = 1; i <= m; i++) {
            if (!M[i]) gd.push_back(i);
        }
        for (int i = l; i <= r; i++) {
            if (t[i] == 1) {
                W[X[i]] = Y[i];
            } else {
                for (int j : upd) if (W[X[j]] >= Y[i]) vec[i].push_back(X[j]);
            }
        }
        sort(ask.begin(), ask.end(), [&] (int u, int v) { return Y[u] > Y[v]; });
        sort(gd.begin(), gd.end(), [&] (int u, int v) { return W[u] > W[v]; });
        int ptr = 0;
        for (int &i : ask) {
            while (ptr < SZ(gd) && W[gd[ptr]] >= Y[i]) Union(U[gd[ptr]], V[gd[ptr]]), ptr++;
            int C = 0;
            for (int &j : vec[i]) C += Union(U[j], V[j]);
            ret[i] = S[Find(X[i])];
            Undo(C);
        }
    }
    for (int i = 1; i <= q; i++) if (t[i] == 2) printf("%d\n", ret[i]);
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   41 |         scanf("%d%d%d", &U[i], &V[i], &W[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   43 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
bridges.cpp:44:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |     for (int i = 1; i <= q; i++) scanf("%d%d%d", &t[i], &X[i], &Y[i]);
      |                                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3340 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 34 ms 8576 KB Output is correct
4 Correct 7 ms 3436 KB Output is correct
5 Correct 34 ms 9452 KB Output is correct
6 Correct 27 ms 9324 KB Output is correct
7 Correct 31 ms 9412 KB Output is correct
8 Correct 35 ms 8172 KB Output is correct
9 Correct 38 ms 13292 KB Output is correct
10 Correct 35 ms 8812 KB Output is correct
11 Correct 35 ms 8428 KB Output is correct
12 Correct 41 ms 10220 KB Output is correct
13 Correct 39 ms 9068 KB Output is correct
14 Correct 39 ms 8428 KB Output is correct
15 Correct 46 ms 8812 KB Output is correct
16 Correct 38 ms 10852 KB Output is correct
17 Correct 38 ms 9708 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1500 ms 58340 KB Output is correct
2 Correct 1521 ms 58160 KB Output is correct
3 Correct 1563 ms 58248 KB Output is correct
4 Correct 1545 ms 58124 KB Output is correct
5 Correct 1534 ms 58424 KB Output is correct
6 Correct 1952 ms 107300 KB Output is correct
7 Correct 1968 ms 107896 KB Output is correct
8 Correct 1963 ms 107500 KB Output is correct
9 Correct 49 ms 4972 KB Output is correct
10 Correct 1004 ms 82276 KB Output is correct
11 Correct 949 ms 67084 KB Output is correct
12 Correct 1412 ms 48132 KB Output is correct
13 Correct 1369 ms 46432 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1167 ms 57880 KB Output is correct
2 Correct 710 ms 81772 KB Output is correct
3 Correct 1286 ms 82600 KB Output is correct
4 Correct 1131 ms 57600 KB Output is correct
5 Correct 51 ms 4972 KB Output is correct
6 Correct 1262 ms 73796 KB Output is correct
7 Correct 1075 ms 50588 KB Output is correct
8 Correct 1012 ms 38376 KB Output is correct
9 Correct 885 ms 30312 KB Output is correct
10 Correct 834 ms 22448 KB Output is correct
11 Correct 890 ms 30080 KB Output is correct
12 Correct 809 ms 22092 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2379 ms 7828 KB Output is correct
2 Correct 48 ms 6380 KB Output is correct
3 Correct 244 ms 7140 KB Output is correct
4 Correct 113 ms 7272 KB Output is correct
5 Correct 1174 ms 10024 KB Output is correct
6 Correct 2344 ms 11760 KB Output is correct
7 Correct 1206 ms 10144 KB Output is correct
8 Correct 1102 ms 9508 KB Output is correct
9 Correct 1082 ms 9448 KB Output is correct
10 Correct 1100 ms 9324 KB Output is correct
11 Correct 1743 ms 10468 KB Output is correct
12 Correct 1704 ms 10316 KB Output is correct
13 Correct 1777 ms 10212 KB Output is correct
14 Correct 1092 ms 9972 KB Output is correct
15 Correct 1149 ms 10212 KB Output is correct
16 Correct 2369 ms 11524 KB Output is correct
17 Correct 2405 ms 11244 KB Output is correct
18 Correct 2363 ms 11424 KB Output is correct
19 Correct 2343 ms 11548 KB Output is correct
20 Correct 1985 ms 10596 KB Output is correct
21 Correct 1975 ms 10700 KB Output is correct
22 Correct 2269 ms 11200 KB Output is correct
23 Correct 1325 ms 9536 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1500 ms 58340 KB Output is correct
2 Correct 1521 ms 58160 KB Output is correct
3 Correct 1563 ms 58248 KB Output is correct
4 Correct 1545 ms 58124 KB Output is correct
5 Correct 1534 ms 58424 KB Output is correct
6 Correct 1952 ms 107300 KB Output is correct
7 Correct 1968 ms 107896 KB Output is correct
8 Correct 1963 ms 107500 KB Output is correct
9 Correct 49 ms 4972 KB Output is correct
10 Correct 1004 ms 82276 KB Output is correct
11 Correct 949 ms 67084 KB Output is correct
12 Correct 1412 ms 48132 KB Output is correct
13 Correct 1369 ms 46432 KB Output is correct
14 Correct 1167 ms 57880 KB Output is correct
15 Correct 710 ms 81772 KB Output is correct
16 Correct 1286 ms 82600 KB Output is correct
17 Correct 1131 ms 57600 KB Output is correct
18 Correct 51 ms 4972 KB Output is correct
19 Correct 1262 ms 73796 KB Output is correct
20 Correct 1075 ms 50588 KB Output is correct
21 Correct 1012 ms 38376 KB Output is correct
22 Correct 885 ms 30312 KB Output is correct
23 Correct 834 ms 22448 KB Output is correct
24 Correct 890 ms 30080 KB Output is correct
25 Correct 809 ms 22092 KB Output is correct
26 Correct 1598 ms 58080 KB Output is correct
27 Correct 1810 ms 83464 KB Output is correct
28 Correct 1590 ms 57060 KB Output is correct
29 Correct 1313 ms 23608 KB Output is correct
30 Correct 1721 ms 71672 KB Output is correct
31 Correct 1744 ms 73776 KB Output is correct
32 Correct 1744 ms 74148 KB Output is correct
33 Correct 1588 ms 56292 KB Output is correct
34 Correct 1574 ms 56812 KB Output is correct
35 Correct 1586 ms 56876 KB Output is correct
36 Correct 1329 ms 28684 KB Output is correct
37 Correct 1324 ms 27640 KB Output is correct
38 Correct 1318 ms 26428 KB Output is correct
39 Correct 1198 ms 15336 KB Output is correct
40 Correct 1264 ms 14820 KB Output is correct
41 Correct 1187 ms 14368 KB Output is correct
42 Correct 1155 ms 14404 KB Output is correct
43 Correct 1155 ms 13600 KB Output is correct
44 Correct 1135 ms 13424 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3340 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 34 ms 8576 KB Output is correct
4 Correct 7 ms 3436 KB Output is correct
5 Correct 34 ms 9452 KB Output is correct
6 Correct 27 ms 9324 KB Output is correct
7 Correct 31 ms 9412 KB Output is correct
8 Correct 35 ms 8172 KB Output is correct
9 Correct 38 ms 13292 KB Output is correct
10 Correct 35 ms 8812 KB Output is correct
11 Correct 35 ms 8428 KB Output is correct
12 Correct 41 ms 10220 KB Output is correct
13 Correct 39 ms 9068 KB Output is correct
14 Correct 39 ms 8428 KB Output is correct
15 Correct 46 ms 8812 KB Output is correct
16 Correct 38 ms 10852 KB Output is correct
17 Correct 38 ms 9708 KB Output is correct
18 Correct 1500 ms 58340 KB Output is correct
19 Correct 1521 ms 58160 KB Output is correct
20 Correct 1563 ms 58248 KB Output is correct
21 Correct 1545 ms 58124 KB Output is correct
22 Correct 1534 ms 58424 KB Output is correct
23 Correct 1952 ms 107300 KB Output is correct
24 Correct 1968 ms 107896 KB Output is correct
25 Correct 1963 ms 107500 KB Output is correct
26 Correct 49 ms 4972 KB Output is correct
27 Correct 1004 ms 82276 KB Output is correct
28 Correct 949 ms 67084 KB Output is correct
29 Correct 1412 ms 48132 KB Output is correct
30 Correct 1369 ms 46432 KB Output is correct
31 Correct 1167 ms 57880 KB Output is correct
32 Correct 710 ms 81772 KB Output is correct
33 Correct 1286 ms 82600 KB Output is correct
34 Correct 1131 ms 57600 KB Output is correct
35 Correct 51 ms 4972 KB Output is correct
36 Correct 1262 ms 73796 KB Output is correct
37 Correct 1075 ms 50588 KB Output is correct
38 Correct 1012 ms 38376 KB Output is correct
39 Correct 885 ms 30312 KB Output is correct
40 Correct 834 ms 22448 KB Output is correct
41 Correct 890 ms 30080 KB Output is correct
42 Correct 809 ms 22092 KB Output is correct
43 Correct 2379 ms 7828 KB Output is correct
44 Correct 48 ms 6380 KB Output is correct
45 Correct 244 ms 7140 KB Output is correct
46 Correct 113 ms 7272 KB Output is correct
47 Correct 1174 ms 10024 KB Output is correct
48 Correct 2344 ms 11760 KB Output is correct
49 Correct 1206 ms 10144 KB Output is correct
50 Correct 1102 ms 9508 KB Output is correct
51 Correct 1082 ms 9448 KB Output is correct
52 Correct 1100 ms 9324 KB Output is correct
53 Correct 1743 ms 10468 KB Output is correct
54 Correct 1704 ms 10316 KB Output is correct
55 Correct 1777 ms 10212 KB Output is correct
56 Correct 1092 ms 9972 KB Output is correct
57 Correct 1149 ms 10212 KB Output is correct
58 Correct 2369 ms 11524 KB Output is correct
59 Correct 2405 ms 11244 KB Output is correct
60 Correct 2363 ms 11424 KB Output is correct
61 Correct 2343 ms 11548 KB Output is correct
62 Correct 1985 ms 10596 KB Output is correct
63 Correct 1975 ms 10700 KB Output is correct
64 Correct 2269 ms 11200 KB Output is correct
65 Correct 1325 ms 9536 KB Output is correct
66 Correct 1598 ms 58080 KB Output is correct
67 Correct 1810 ms 83464 KB Output is correct
68 Correct 1590 ms 57060 KB Output is correct
69 Correct 1313 ms 23608 KB Output is correct
70 Correct 1721 ms 71672 KB Output is correct
71 Correct 1744 ms 73776 KB Output is correct
72 Correct 1744 ms 74148 KB Output is correct
73 Correct 1588 ms 56292 KB Output is correct
74 Correct 1574 ms 56812 KB Output is correct
75 Correct 1586 ms 56876 KB Output is correct
76 Correct 1329 ms 28684 KB Output is correct
77 Correct 1324 ms 27640 KB Output is correct
78 Correct 1318 ms 26428 KB Output is correct
79 Correct 1198 ms 15336 KB Output is correct
80 Correct 1264 ms 14820 KB Output is correct
81 Correct 1187 ms 14368 KB Output is correct
82 Correct 1155 ms 14404 KB Output is correct
83 Correct 1155 ms 13600 KB Output is correct
84 Correct 1135 ms 13424 KB Output is correct
85 Correct 2798 ms 63040 KB Output is correct
86 Correct 287 ms 12132 KB Output is correct
87 Correct 145 ms 16996 KB Output is correct
88 Correct 1625 ms 73712 KB Output is correct
89 Correct 2775 ms 61924 KB Output is correct
90 Correct 1585 ms 75000 KB Output is correct
91 Correct 1596 ms 61004 KB Output is correct
92 Correct 1596 ms 60828 KB Output is correct
93 Correct 2007 ms 110220 KB Output is correct
94 Correct 2231 ms 62028 KB Output is correct
95 Correct 2158 ms 61728 KB Output is correct
96 Correct 2524 ms 110904 KB Output is correct
97 Correct 1379 ms 34344 KB Output is correct
98 Correct 1374 ms 32740 KB Output is correct
99 Correct 2830 ms 63872 KB Output is correct
100 Correct 2836 ms 63120 KB Output is correct
101 Correct 2803 ms 62540 KB Output is correct
102 Correct 2817 ms 62748 KB Output is correct
103 Correct 2807 ms 111272 KB Output is correct
104 Correct 2812 ms 111188 KB Output is correct
105 Correct 2268 ms 50360 KB Output is correct
106 Correct 1888 ms 30204 KB Output is correct
107 Correct 2206 ms 50164 KB Output is correct
108 Correct 2796 ms 102408 KB Output is correct
109 Correct 1897 ms 109736 KB Output is correct