oj.uz

Submission #696548

# Submission time Handle Problem Language Result Execution time Memory
696548 2023-02-06T18:20:35 Z stevancv Bridges (APIO19_bridges) C++14
100 / 100
 2507 ms 126620 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 5e4 + 2;
const int M = 1e5 + 2;
const int S = 1500;
const int inf = 2e9;
struct Dsu {
    int link[N], sz[N];
    void Init(int n) {
        for (int i = 1; i <= n; i++) {
            link[i] = i;
            sz[i] = 1;
        }
    }
    int Find(int x) {
        if (x == link[x]) return x;
        return Find(link[x]);
    }
    stack<array<int, 4>> s;
    void Unite(int x, int y) {
        x = Find(x); y = Find(y);
        if (sz[x] < sz[y]) swap(x, y);
        s.push({x, y, sz[x], sz[y]});
        if (x == y) return;
        sz[x] += sz[y];
        link[y] = x;
    }
    void RollBack() {
        auto aa = s.top(); s.pop();
        link[aa[0]] = aa[0];
        link[aa[1]] = aa[1];
        sz[aa[0]] = aa[2];
        sz[aa[1]] = aa[3];
    }
}dsu;
int a[M], b[M], c[M], is[M];
int t[M], x[M], y[M], ans[M];
vector<int> qq[S];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> a[i] >> b[i] >> c[i];
    }
    int q; cin >> q;
    for (int i = 1; i <= q; i++) {
        cin >> t[i] >> x[i] >> y[i];
    }
    for (int l = 1; l <= q; l += S) {
        int r = min(l + S - 1, q);
        for (int i = l; i <= r; i++) qq[i - l].clear();
        for (int i = 1; i <= m; i++) is[i] = 0;
        vector<int> cx, cy, v;
        for (int i = l; i <= r; i++) {
            if (t[i] == 1) {
                if (is[x[i]] == 0) cx.push_back(x[i]);
                is[x[i]] = 1;
            }
        }
        for (int i = l; i <= r; i++) {
            if (t[i] == 1) c[x[i]] = y[i];
            else {
                for (int j : cx) if (c[j] >= y[i]) qq[i - l].push_back(j);
                v.push_back(i);
            }
        }
        for (int i = 1; i <= m; i++) if (!is[i]) cy.push_back(i);
        sort(cy.begin(), cy.end(), [&] (int i, int j) {
            return c[i] > c[j];
        });
        sort(v.begin(), v.end(), [&] (int i, int j) {
            return y[i] > y[j];
        });
        dsu.Init(n);
        int j = 0;
        for (int i : v) {
            while (j < cy.size() && c[cy[j]] >= y[i]) {
                dsu.Unite(a[cy[j]], b[cy[j]]);
                j += 1;
            }
            for (auto o : qq[i - l]) dsu.Unite(a[o], b[o]);
            ans[i] = dsu.sz[dsu.Find(x[i])];
            for (int j = 0; j < qq[i - l].size(); j++) dsu.RollBack();
        }
    }
    for (int i = 1; i <= q; i++)
        if (t[i] == 2)
            cout << ans[i] << en;
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:86:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |             while (j < cy.size() && c[cy[j]] >= y[i]) {
      |                    ~~^~~~~~~~~~~
bridges.cpp:92:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             for (int j = 0; j < qq[i - l].size(); j++) dsu.RollBack();
      |                             ~~^~~~~~~~~~~~~~~~~~

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 45 ms 3660 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 16 ms 1236 KB Output is correct
6 Correct 11 ms 1108 KB Output is correct
7 Correct 12 ms 1292 KB Output is correct
8 Correct 13 ms 1244 KB Output is correct
9 Correct 14 ms 1284 KB Output is correct
10 Correct 12 ms 1184 KB Output is correct
11 Correct 12 ms 1176 KB Output is correct
12 Correct 13 ms 1236 KB Output is correct
13 Correct 17 ms 1748 KB Output is correct
14 Correct 16 ms 1492 KB Output is correct
15 Correct 14 ms 1236 KB Output is correct
16 Correct 12 ms 1236 KB Output is correct
17 Correct 12 ms 1440 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1341 ms 63668 KB Output is correct
2 Correct 1336 ms 63764 KB Output is correct
3 Correct 1327 ms 63844 KB Output is correct
4 Correct 1417 ms 63740 KB Output is correct
5 Correct 1408 ms 63980 KB Output is correct
6 Correct 2166 ms 63732 KB Output is correct
7 Correct 2194 ms 63716 KB Output is correct
8 Correct 2189 ms 63780 KB Output is correct
9 Correct 39 ms 2068 KB Output is correct
10 Correct 1318 ms 63784 KB Output is correct
11 Correct 1195 ms 63900 KB Output is correct
12 Correct 1064 ms 60236 KB Output is correct
13 Correct 1097 ms 69060 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1118 ms 44340 KB Output is correct
2 Correct 992 ms 16724 KB Output is correct
3 Correct 1407 ms 44448 KB Output is correct
4 Correct 1086 ms 44352 KB Output is correct
5 Correct 31 ms 2084 KB Output is correct
6 Correct 1314 ms 44348 KB Output is correct
7 Correct 980 ms 44428 KB Output is correct
8 Correct 818 ms 44360 KB Output is correct
9 Correct 618 ms 40568 KB Output is correct
10 Correct 537 ms 40456 KB Output is correct
11 Correct 695 ms 48780 KB Output is correct
12 Correct 575 ms 47176 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 994 ms 114452 KB Output is correct
2 Correct 33 ms 2380 KB Output is correct
3 Correct 112 ms 14108 KB Output is correct
4 Correct 61 ms 14120 KB Output is correct
5 Correct 560 ms 114876 KB Output is correct
6 Correct 943 ms 114728 KB Output is correct
7 Correct 550 ms 114888 KB Output is correct
8 Correct 479 ms 58632 KB Output is correct
9 Correct 491 ms 58616 KB Output is correct
10 Correct 497 ms 58792 KB Output is correct
11 Correct 725 ms 86684 KB Output is correct
12 Correct 718 ms 86688 KB Output is correct
13 Correct 758 ms 86952 KB Output is correct
14 Correct 479 ms 114884 KB Output is correct
15 Correct 484 ms 114820 KB Output is correct
16 Correct 977 ms 113712 KB Output is correct
17 Correct 989 ms 113608 KB Output is correct
18 Correct 961 ms 114004 KB Output is correct
19 Correct 988 ms 113812 KB Output is correct
20 Correct 818 ms 96232 KB Output is correct
21 Correct 813 ms 96260 KB Output is correct
22 Correct 930 ms 109408 KB Output is correct
23 Correct 579 ms 92904 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1341 ms 63668 KB Output is correct
2 Correct 1336 ms 63764 KB Output is correct
3 Correct 1327 ms 63844 KB Output is correct
4 Correct 1417 ms 63740 KB Output is correct
5 Correct 1408 ms 63980 KB Output is correct
6 Correct 2166 ms 63732 KB Output is correct
7 Correct 2194 ms 63716 KB Output is correct
8 Correct 2189 ms 63780 KB Output is correct
9 Correct 39 ms 2068 KB Output is correct
10 Correct 1318 ms 63784 KB Output is correct
11 Correct 1195 ms 63900 KB Output is correct
12 Correct 1064 ms 60236 KB Output is correct
13 Correct 1097 ms 69060 KB Output is correct
14 Correct 1118 ms 44340 KB Output is correct
15 Correct 992 ms 16724 KB Output is correct
16 Correct 1407 ms 44448 KB Output is correct
17 Correct 1086 ms 44352 KB Output is correct
18 Correct 31 ms 2084 KB Output is correct
19 Correct 1314 ms 44348 KB Output is correct
20 Correct 980 ms 44428 KB Output is correct
21 Correct 818 ms 44360 KB Output is correct
22 Correct 618 ms 40568 KB Output is correct
23 Correct 537 ms 40456 KB Output is correct
24 Correct 695 ms 48780 KB Output is correct
25 Correct 575 ms 47176 KB Output is correct
26 Correct 1329 ms 63744 KB Output is correct
27 Correct 1784 ms 63896 KB Output is correct
28 Correct 1389 ms 63740 KB Output is correct
29 Correct 821 ms 63320 KB Output is correct
30 Correct 1657 ms 63896 KB Output is correct
31 Correct 1720 ms 63808 KB Output is correct
32 Correct 1758 ms 63768 KB Output is correct
33 Correct 1397 ms 63744 KB Output is correct
34 Correct 1382 ms 63696 KB Output is correct
35 Correct 1399 ms 63732 KB Output is correct
36 Correct 907 ms 63520 KB Output is correct
37 Correct 896 ms 63416 KB Output is correct
38 Correct 863 ms 63428 KB Output is correct
39 Correct 623 ms 59680 KB Output is correct
40 Correct 627 ms 59724 KB Output is correct
41 Correct 620 ms 59764 KB Output is correct
42 Correct 635 ms 63368 KB Output is correct
43 Correct 624 ms 63500 KB Output is correct
44 Correct 619 ms 62928 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 45 ms 3660 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 16 ms 1236 KB Output is correct
6 Correct 11 ms 1108 KB Output is correct
7 Correct 12 ms 1292 KB Output is correct
8 Correct 13 ms 1244 KB Output is correct
9 Correct 14 ms 1284 KB Output is correct
10 Correct 12 ms 1184 KB Output is correct
11 Correct 12 ms 1176 KB Output is correct
12 Correct 13 ms 1236 KB Output is correct
13 Correct 17 ms 1748 KB Output is correct
14 Correct 16 ms 1492 KB Output is correct
15 Correct 14 ms 1236 KB Output is correct
16 Correct 12 ms 1236 KB Output is correct
17 Correct 12 ms 1440 KB Output is correct
18 Correct 1341 ms 63668 KB Output is correct
19 Correct 1336 ms 63764 KB Output is correct
20 Correct 1327 ms 63844 KB Output is correct
21 Correct 1417 ms 63740 KB Output is correct
22 Correct 1408 ms 63980 KB Output is correct
23 Correct 2166 ms 63732 KB Output is correct
24 Correct 2194 ms 63716 KB Output is correct
25 Correct 2189 ms 63780 KB Output is correct
26 Correct 39 ms 2068 KB Output is correct
27 Correct 1318 ms 63784 KB Output is correct
28 Correct 1195 ms 63900 KB Output is correct
29 Correct 1064 ms 60236 KB Output is correct
30 Correct 1097 ms 69060 KB Output is correct
31 Correct 1118 ms 44340 KB Output is correct
32 Correct 992 ms 16724 KB Output is correct
33 Correct 1407 ms 44448 KB Output is correct
34 Correct 1086 ms 44352 KB Output is correct
35 Correct 31 ms 2084 KB Output is correct
36 Correct 1314 ms 44348 KB Output is correct
37 Correct 980 ms 44428 KB Output is correct
38 Correct 818 ms 44360 KB Output is correct
39 Correct 618 ms 40568 KB Output is correct
40 Correct 537 ms 40456 KB Output is correct
41 Correct 695 ms 48780 KB Output is correct
42 Correct 575 ms 47176 KB Output is correct
43 Correct 994 ms 114452 KB Output is correct
44 Correct 33 ms 2380 KB Output is correct
45 Correct 112 ms 14108 KB Output is correct
46 Correct 61 ms 14120 KB Output is correct
47 Correct 560 ms 114876 KB Output is correct
48 Correct 943 ms 114728 KB Output is correct
49 Correct 550 ms 114888 KB Output is correct
50 Correct 479 ms 58632 KB Output is correct
51 Correct 491 ms 58616 KB Output is correct
52 Correct 497 ms 58792 KB Output is correct
53 Correct 725 ms 86684 KB Output is correct
54 Correct 718 ms 86688 KB Output is correct
55 Correct 758 ms 86952 KB Output is correct
56 Correct 479 ms 114884 KB Output is correct
57 Correct 484 ms 114820 KB Output is correct
58 Correct 977 ms 113712 KB Output is correct
59 Correct 989 ms 113608 KB Output is correct
60 Correct 961 ms 114004 KB Output is correct
61 Correct 988 ms 113812 KB Output is correct
62 Correct 818 ms 96232 KB Output is correct
63 Correct 813 ms 96260 KB Output is correct
64 Correct 930 ms 109408 KB Output is correct
65 Correct 579 ms 92904 KB Output is correct
66 Correct 1329 ms 63744 KB Output is correct
67 Correct 1784 ms 63896 KB Output is correct
68 Correct 1389 ms 63740 KB Output is correct
69 Correct 821 ms 63320 KB Output is correct
70 Correct 1657 ms 63896 KB Output is correct
71 Correct 1720 ms 63808 KB Output is correct
72 Correct 1758 ms 63768 KB Output is correct
73 Correct 1397 ms 63744 KB Output is correct
74 Correct 1382 ms 63696 KB Output is correct
75 Correct 1399 ms 63732 KB Output is correct
76 Correct 907 ms 63520 KB Output is correct
77 Correct 896 ms 63416 KB Output is correct
78 Correct 863 ms 63428 KB Output is correct
79 Correct 623 ms 59680 KB Output is correct
80 Correct 627 ms 59724 KB Output is correct
81 Correct 620 ms 59764 KB Output is correct
82 Correct 635 ms 63368 KB Output is correct
83 Correct 624 ms 63500 KB Output is correct
84 Correct 619 ms 62928 KB Output is correct
85 Correct 1771 ms 123500 KB Output is correct
86 Correct 181 ms 20644 KB Output is correct
87 Correct 159 ms 21652 KB Output is correct
88 Correct 1275 ms 122004 KB Output is correct
89 Correct 1765 ms 123472 KB Output is correct
90 Correct 1297 ms 122196 KB Output is correct
91 Correct 1477 ms 66396 KB Output is correct
92 Correct 1423 ms 66532 KB Output is correct
93 Correct 2384 ms 66168 KB Output is correct
94 Correct 1697 ms 94740 KB Output is correct
95 Correct 1616 ms 94940 KB Output is correct
96 Correct 2300 ms 94796 KB Output is correct
97 Correct 749 ms 118476 KB Output is correct
98 Correct 840 ms 126620 KB Output is correct
99 Correct 1845 ms 122548 KB Output is correct
100 Correct 1798 ms 122220 KB Output is correct
101 Correct 1894 ms 122676 KB Output is correct
102 Correct 1872 ms 122520 KB Output is correct
103 Correct 2493 ms 104196 KB Output is correct
104 Correct 2507 ms 104252 KB Output is correct
105 Correct 1474 ms 109440 KB Output is correct
106 Correct 1056 ms 99472 KB Output is correct
107 Correct 1276 ms 100644 KB Output is correct
108 Correct 2129 ms 117672 KB Output is correct
109 Correct 1778 ms 99496 KB Output is correct