oj.uz

Submission #372336

# Submission time Handle Problem Language Result Execution time Memory
372336 2021-02-27T17:20:48 Z two_sides Bridges (APIO19_bridges) C++17
100 / 100
 2797 ms 127248 KB 
#include <bits/stdc++.h>

using namespace std;

struct item {
    int a, b, c;
};

const int N = 100005;
const int K = 1000;

int root[N], siz[N], ans[N];
vector <int> pot[N], change;
bool vis[N], mark[N];
item edge[N], quer[N];

int Find(int u) {
    while (root[u] != u) u = root[u];
    return u;
}

void Union(int u, int v, bool type) {
    u = Find(u); v = Find(v);
    if (u == v) return;
    if (siz[u] < siz[v]) swap(u, v);
    siz[u] += siz[v]; root[v] = u;
    if (type) change.push_back(v);
}

void rollBack() {
    while (change.size()) {
        int u = change.back();
        change.pop_back();
        siz[root[u]] -= siz[u];
        root[u] = u;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m; cin >> n >> m;
    for (int i = 1; i <= m; i++)
        cin >> edge[i].a >> edge[i].b >> edge[i].c;
    int q; cin >> q;
    for (int i = 1; i <= q; i++)
        cin >> quer[i].a >> quer[i].b >> quer[i].c;
    for (int l = 1; l <= q; l += K) {
        int r = min(q, l + K - 1);
        fill(mark + 1, mark + m + 1, 0);
        iota(root + 1, root + n + 1, 1);
        fill(siz + 1, siz + n + 1, 1);
        vector <int> same, upd, ask;
        for (int i = l; i <= r; i++)
            if (quer[i].a == 1)
                mark[quer[i].b] = 1;
            else ask.push_back(i);
        for (int i = 1; i <= m; i++)
            if (!mark[i])
                same.push_back(i);
            else upd.push_back(i);
        for (int i = l; i <= r; i++) {
            if (quer[i].a == 1)
                edge[quer[i].b].c = quer[i].c;
            else {
                for (int j : upd)
                    if (edge[j].c >= quer[i].c)
                        pot[i].push_back(j);
            }
        }
        sort(same.begin(), same.end(),
        [&](int i, int j) {
            return edge[i].c > edge[j].c;
        });
        sort(ask.begin(), ask.end(),
        [&](int i, int j) {
            return quer[i].c > quer[j].c;
        });
        int ptr = 0;
        for (int i : ask) {
            while (ptr < same.size() &&
            edge[same[ptr]].c >= quer[i].c) {
                Union(edge[same[ptr]].a,
                edge[same[ptr]].b, 0); ptr++;
            }
            for (int j : pot[i])
                Union(edge[j].a, edge[j].b, 1);
            ans[i] = siz[Find(quer[i].b)];
            rollBack();
        }
    }
    for (int i = 1; i <= q; i++)
        if (quer[i].a == 2)
            cout << ans[i] << '\n';
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:80:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             while (ptr < same.size() &&
      |                    ~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 43 ms 8824 KB Output is correct
4 Correct 6 ms 3052 KB Output is correct
5 Correct 15 ms 4588 KB Output is correct
6 Correct 13 ms 4588 KB Output is correct
7 Correct 15 ms 4588 KB Output is correct
8 Correct 16 ms 4460 KB Output is correct
9 Correct 18 ms 5612 KB Output is correct
10 Correct 17 ms 4608 KB Output is correct
11 Correct 16 ms 4588 KB Output is correct
12 Correct 19 ms 4984 KB Output is correct
13 Correct 22 ms 5484 KB Output is correct
14 Correct 21 ms 5100 KB Output is correct
15 Correct 19 ms 4588 KB Output is correct
16 Correct 17 ms 4972 KB Output is correct
17 Correct 17 ms 4972 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1553 ms 72492 KB Output is correct
2 Correct 1481 ms 75052 KB Output is correct
3 Correct 1505 ms 75564 KB Output is correct
4 Correct 1478 ms 74888 KB Output is correct
5 Correct 1515 ms 75428 KB Output is correct
6 Correct 2124 ms 127248 KB Output is correct
7 Correct 2089 ms 126728 KB Output is correct
8 Correct 2101 ms 124568 KB Output is correct
9 Correct 44 ms 5868 KB Output is correct
10 Correct 1248 ms 97324 KB Output is correct
11 Correct 1177 ms 97964 KB Output is correct
12 Correct 1365 ms 55084 KB Output is correct
13 Correct 1242 ms 48816 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1218 ms 72264 KB Output is correct
2 Correct 866 ms 91628 KB Output is correct
3 Correct 1393 ms 99692 KB Output is correct
4 Correct 1174 ms 74168 KB Output is correct
5 Correct 43 ms 5868 KB Output is correct
6 Correct 1358 ms 94008 KB Output is correct
7 Correct 1089 ms 66064 KB Output is correct
8 Correct 937 ms 50304 KB Output is correct
9 Correct 826 ms 42584 KB Output is correct
10 Correct 760 ms 30996 KB Output is correct
11 Correct 793 ms 39980 KB Output is correct
12 Correct 693 ms 29676 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1772 ms 6944 KB Output is correct
2 Correct 43 ms 4460 KB Output is correct
3 Correct 194 ms 5076 KB Output is correct
4 Correct 99 ms 5252 KB Output is correct
5 Correct 976 ms 7044 KB Output is correct
6 Correct 1753 ms 7000 KB Output is correct
7 Correct 908 ms 6892 KB Output is correct
8 Correct 866 ms 5844 KB Output is correct
9 Correct 843 ms 6008 KB Output is correct
10 Correct 840 ms 5884 KB Output is correct
11 Correct 1311 ms 6724 KB Output is correct
12 Correct 1301 ms 6964 KB Output is correct
13 Correct 1355 ms 6472 KB Output is correct
14 Correct 820 ms 7044 KB Output is correct
15 Correct 868 ms 7036 KB Output is correct
16 Correct 1776 ms 7244 KB Output is correct
17 Correct 1796 ms 7024 KB Output is correct
18 Correct 1765 ms 7152 KB Output is correct
19 Correct 1764 ms 6880 KB Output is correct
20 Correct 1483 ms 6692 KB Output is correct
21 Correct 1499 ms 7032 KB Output is correct
22 Correct 1738 ms 6988 KB Output is correct
23 Correct 1002 ms 6608 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1553 ms 72492 KB Output is correct
2 Correct 1481 ms 75052 KB Output is correct
3 Correct 1505 ms 75564 KB Output is correct
4 Correct 1478 ms 74888 KB Output is correct
5 Correct 1515 ms 75428 KB Output is correct
6 Correct 2124 ms 127248 KB Output is correct
7 Correct 2089 ms 126728 KB Output is correct
8 Correct 2101 ms 124568 KB Output is correct
9 Correct 44 ms 5868 KB Output is correct
10 Correct 1248 ms 97324 KB Output is correct
11 Correct 1177 ms 97964 KB Output is correct
12 Correct 1365 ms 55084 KB Output is correct
13 Correct 1242 ms 48816 KB Output is correct
14 Correct 1218 ms 72264 KB Output is correct
15 Correct 866 ms 91628 KB Output is correct
16 Correct 1393 ms 99692 KB Output is correct
17 Correct 1174 ms 74168 KB Output is correct
18 Correct 43 ms 5868 KB Output is correct
19 Correct 1358 ms 94008 KB Output is correct
20 Correct 1089 ms 66064 KB Output is correct
21 Correct 937 ms 50304 KB Output is correct
22 Correct 826 ms 42584 KB Output is correct
23 Correct 760 ms 30996 KB Output is correct
24 Correct 793 ms 39980 KB Output is correct
25 Correct 693 ms 29676 KB Output is correct
26 Correct 1545 ms 75352 KB Output is correct
27 Correct 1941 ms 101908 KB Output is correct
28 Correct 1644 ms 73444 KB Output is correct
29 Correct 1127 ms 30764 KB Output is correct
30 Correct 1849 ms 89668 KB Output is correct
31 Correct 1899 ms 91920 KB Output is correct
32 Correct 1890 ms 92204 KB Output is correct
33 Correct 1624 ms 74044 KB Output is correct
34 Correct 1597 ms 74036 KB Output is correct
35 Correct 1604 ms 74132 KB Output is correct
36 Correct 1205 ms 37580 KB Output is correct
37 Correct 1196 ms 36464 KB Output is correct
38 Correct 1170 ms 34860 KB Output is correct
39 Correct 981 ms 20904 KB Output is correct
40 Correct 981 ms 20136 KB Output is correct
41 Correct 976 ms 19672 KB Output is correct
42 Correct 979 ms 19520 KB Output is correct
43 Correct 935 ms 18744 KB Output is correct
44 Correct 943 ms 18228 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 43 ms 8824 KB Output is correct
4 Correct 6 ms 3052 KB Output is correct
5 Correct 15 ms 4588 KB Output is correct
6 Correct 13 ms 4588 KB Output is correct
7 Correct 15 ms 4588 KB Output is correct
8 Correct 16 ms 4460 KB Output is correct
9 Correct 18 ms 5612 KB Output is correct
10 Correct 17 ms 4608 KB Output is correct
11 Correct 16 ms 4588 KB Output is correct
12 Correct 19 ms 4984 KB Output is correct
13 Correct 22 ms 5484 KB Output is correct
14 Correct 21 ms 5100 KB Output is correct
15 Correct 19 ms 4588 KB Output is correct
16 Correct 17 ms 4972 KB Output is correct
17 Correct 17 ms 4972 KB Output is correct
18 Correct 1553 ms 72492 KB Output is correct
19 Correct 1481 ms 75052 KB Output is correct
20 Correct 1505 ms 75564 KB Output is correct
21 Correct 1478 ms 74888 KB Output is correct
22 Correct 1515 ms 75428 KB Output is correct
23 Correct 2124 ms 127248 KB Output is correct
24 Correct 2089 ms 126728 KB Output is correct
25 Correct 2101 ms 124568 KB Output is correct
26 Correct 44 ms 5868 KB Output is correct
27 Correct 1248 ms 97324 KB Output is correct
28 Correct 1177 ms 97964 KB Output is correct
29 Correct 1365 ms 55084 KB Output is correct
30 Correct 1242 ms 48816 KB Output is correct
31 Correct 1218 ms 72264 KB Output is correct
32 Correct 866 ms 91628 KB Output is correct
33 Correct 1393 ms 99692 KB Output is correct
34 Correct 1174 ms 74168 KB Output is correct
35 Correct 43 ms 5868 KB Output is correct
36 Correct 1358 ms 94008 KB Output is correct
37 Correct 1089 ms 66064 KB Output is correct
38 Correct 937 ms 50304 KB Output is correct
39 Correct 826 ms 42584 KB Output is correct
40 Correct 760 ms 30996 KB Output is correct
41 Correct 793 ms 39980 KB Output is correct
42 Correct 693 ms 29676 KB Output is correct
43 Correct 1772 ms 6944 KB Output is correct
44 Correct 43 ms 4460 KB Output is correct
45 Correct 194 ms 5076 KB Output is correct
46 Correct 99 ms 5252 KB Output is correct
47 Correct 976 ms 7044 KB Output is correct
48 Correct 1753 ms 7000 KB Output is correct
49 Correct 908 ms 6892 KB Output is correct
50 Correct 866 ms 5844 KB Output is correct
51 Correct 843 ms 6008 KB Output is correct
52 Correct 840 ms 5884 KB Output is correct
53 Correct 1311 ms 6724 KB Output is correct
54 Correct 1301 ms 6964 KB Output is correct
55 Correct 1355 ms 6472 KB Output is correct
56 Correct 820 ms 7044 KB Output is correct
57 Correct 868 ms 7036 KB Output is correct
58 Correct 1776 ms 7244 KB Output is correct
59 Correct 1796 ms 7024 KB Output is correct
60 Correct 1765 ms 7152 KB Output is correct
61 Correct 1764 ms 6880 KB Output is correct
62 Correct 1483 ms 6692 KB Output is correct
63 Correct 1499 ms 7032 KB Output is correct
64 Correct 1738 ms 6988 KB Output is correct
65 Correct 1002 ms 6608 KB Output is correct
66 Correct 1545 ms 75352 KB Output is correct
67 Correct 1941 ms 101908 KB Output is correct
68 Correct 1644 ms 73444 KB Output is correct
69 Correct 1127 ms 30764 KB Output is correct
70 Correct 1849 ms 89668 KB Output is correct
71 Correct 1899 ms 91920 KB Output is correct
72 Correct 1890 ms 92204 KB Output is correct
73 Correct 1624 ms 74044 KB Output is correct
74 Correct 1597 ms 74036 KB Output is correct
75 Correct 1604 ms 74132 KB Output is correct
76 Correct 1205 ms 37580 KB Output is correct
77 Correct 1196 ms 36464 KB Output is correct
78 Correct 1170 ms 34860 KB Output is correct
79 Correct 981 ms 20904 KB Output is correct
80 Correct 981 ms 20136 KB Output is correct
81 Correct 976 ms 19672 KB Output is correct
82 Correct 979 ms 19520 KB Output is correct
83 Correct 935 ms 18744 KB Output is correct
84 Correct 943 ms 18228 KB Output is correct
85 Correct 2327 ms 77536 KB Output is correct
86 Correct 227 ms 13284 KB Output is correct
87 Correct 142 ms 17636 KB Output is correct
88 Correct 1436 ms 88736 KB Output is correct
89 Correct 2318 ms 76036 KB Output is correct
90 Correct 1457 ms 96484 KB Output is correct
91 Correct 1656 ms 75180 KB Output is correct
92 Correct 1650 ms 75180 KB Output is correct
93 Correct 2309 ms 112036 KB Output is correct
94 Correct 1966 ms 76236 KB Output is correct
95 Correct 1963 ms 76556 KB Output is correct
96 Correct 2317 ms 115660 KB Output is correct
97 Correct 1189 ms 42300 KB Output is correct
98 Correct 1122 ms 39092 KB Output is correct
99 Correct 2399 ms 78268 KB Output is correct
100 Correct 2480 ms 77064 KB Output is correct
101 Correct 2504 ms 77108 KB Output is correct
102 Correct 2428 ms 77152 KB Output is correct
103 Correct 2558 ms 119928 KB Output is correct
104 Correct 2797 ms 119980 KB Output is correct
105 Correct 2101 ms 49760 KB Output is correct
106 Correct 1501 ms 30088 KB Output is correct
107 Correct 1805 ms 56500 KB Output is correct
108 Correct 2362 ms 112348 KB Output is correct
109 Correct 1683 ms 114900 KB Output is correct