oj.uz

Submission #158151

# Submission time Handle Problem Language Result Execution time Memory
158151 2019-10-15T05:36:25 Z PeppaPig Bridges (APIO19_bridges) C++14
100 / 100
 2872 ms 32828 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1e5+5;
const int B = 1e3+5;

struct UnionFindDisjointSet {
    int par[N], sz[N];
    stack<int> S;

    void reset() { iota(par, par+N, 0), fill_n(sz, N, 1); }

    int find(int x) { return x == par[x] ? x : find(par[x]); }

    void unite(int a, int b) {
        a = find(a), b = find(b);
        if(a == b) return;
        if(sz[a] > sz[b]) swap(a, b);
        par[a] = b, sz[b] += sz[a];
        S.emplace(a);
    }

    void rollback(int x) {
        while(S.size() > x) {
            int now = S.top(); S.pop();
            sz[par[now]] -= sz[now];
            par[now] = now;
        }
    }
} dsu;

int n, m, q, ans[N];
int u[N], v[N], w[N], t[N], x[N], y[N];
bool chk[N];
vector<int> join[B];

int main() {
    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, r; l <= q; l += B) {
        r = min(q, l + B - 1);
        dsu.reset();
        fill(chk + 1, chk + m + 1, 0);

        vector<int> upd, ask, E;
        for(int i = l; i <= r; i++) {
            if(t[i] == 1) {
                upd.emplace_back(i);
                chk[x[i]] = true;
            } else ask.emplace_back(i);
        }
        for(int i = 1; i <= m; i++) if(!chk[i]) E.emplace_back(i);
        for(int i = l; i <= r; i++) {
            if(t[i] == 1) w[x[i]] = y[i];
            else {
                join[i - l].clear();
                for(int &z : upd) if(w[x[z]] >= y[i])
                    join[i - l].emplace_back(z);
            }
        }

        sort(ask.begin(), ask.end(), [&](int a, int b) { return y[a] > y[b]; });
        sort(E.begin(), E.end(), [&](int a, int b) { return w[a] > w[b]; });

        int ptr = 0;
        for(int &i : ask) {
            int idx = x[i], cost = y[i];
            while(ptr < E.size() && w[E[ptr]] >= cost)
                dsu.unite(u[E[ptr]], v[E[ptr]]), ++ptr;
            int tmp = dsu.S.size();
            for(int &z : join[i - l]) dsu.unite(u[x[z]], v[x[z]]);
            ans[i] = dsu.sz[dsu.find(idx)];
            dsu.rollback(tmp);
        }
    }
    for(int i = 1; i <= q; i++) if(t[i] == 2) printf("%d\n", ans[i]);

    return 0;
}

Compilation message

bridges.cpp: In member function 'void UnionFindDisjointSet::rollback(int)':
bridges.cpp:29:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(S.size() > x) {
                        ^
bridges.cpp: In function 'int main()':
bridges.cpp:76:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(ptr < E.size() && w[E[ptr]] >= cost)
                   ~~~~^~~~~~~~~~
bridges.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:44:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= m; i++) scanf("%d %d %d", u+i, v+i, w+i);
                                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
     ~~~~~^~~~~~~~~~
bridges.cpp:46:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     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 3 ms 1144 KB Output is correct
2 Correct 2 ms 1012 KB Output is correct
3 Correct 44 ms 3452 KB Output is correct
4 Correct 8 ms 1400 KB Output is correct
5 Correct 43 ms 3960 KB Output is correct
6 Correct 30 ms 3576 KB Output is correct
7 Correct 36 ms 4232 KB Output is correct
8 Correct 47 ms 3576 KB Output is correct
9 Correct 41 ms 5060 KB Output is correct
10 Correct 48 ms 3704 KB Output is correct
11 Correct 48 ms 3576 KB Output is correct
12 Correct 57 ms 3576 KB Output is correct
13 Correct 55 ms 3560 KB Output is correct
14 Correct 52 ms 3704 KB Output is correct
15 Correct 56 ms 3404 KB Output is correct
16 Correct 41 ms 4440 KB Output is correct
17 Correct 44 ms 4236 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1715 ms 28184 KB Output is correct
2 Correct 1720 ms 29020 KB Output is correct
3 Correct 1781 ms 28912 KB Output is correct
4 Correct 1749 ms 28784 KB Output is correct
5 Correct 1759 ms 26636 KB Output is correct
6 Correct 2501 ms 29216 KB Output is correct
7 Correct 2502 ms 30264 KB Output is correct
8 Correct 2540 ms 30756 KB Output is correct
9 Correct 62 ms 4216 KB Output is correct
10 Correct 1402 ms 30080 KB Output is correct
11 Correct 1295 ms 30248 KB Output is correct
12 Correct 1497 ms 27244 KB Output is correct
13 Correct 1598 ms 30176 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1394 ms 21236 KB Output is correct
2 Correct 918 ms 10840 KB Output is correct
3 Correct 1578 ms 22604 KB Output is correct
4 Correct 1328 ms 21108 KB Output is correct
5 Correct 62 ms 4216 KB Output is correct
6 Correct 1502 ms 21432 KB Output is correct
7 Correct 1225 ms 20980 KB Output is correct
8 Correct 1049 ms 20736 KB Output is correct
9 Correct 847 ms 19396 KB Output is correct
10 Correct 771 ms 19256 KB Output is correct
11 Correct 965 ms 22224 KB Output is correct
12 Correct 836 ms 22360 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1899 ms 27576 KB Output is correct
2 Correct 62 ms 4216 KB Output is correct
3 Correct 200 ms 5564 KB Output is correct
4 Correct 96 ms 5428 KB Output is correct
5 Correct 967 ms 27004 KB Output is correct
6 Correct 1849 ms 28112 KB Output is correct
7 Correct 962 ms 27084 KB Output is correct
8 Correct 977 ms 26176 KB Output is correct
9 Correct 1008 ms 26060 KB Output is correct
10 Correct 1012 ms 26256 KB Output is correct
11 Correct 1450 ms 27064 KB Output is correct
12 Correct 1435 ms 27292 KB Output is correct
13 Correct 1460 ms 27104 KB Output is correct
14 Correct 858 ms 26992 KB Output is correct
15 Correct 914 ms 27060 KB Output is correct
16 Correct 1901 ms 27888 KB Output is correct
17 Correct 1868 ms 27828 KB Output is correct
18 Correct 1904 ms 27968 KB Output is correct
19 Correct 1898 ms 27840 KB Output is correct
20 Correct 1587 ms 27012 KB Output is correct
21 Correct 1564 ms 27128 KB Output is correct
22 Correct 1960 ms 27016 KB Output is correct
23 Correct 1120 ms 24964 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1715 ms 28184 KB Output is correct
2 Correct 1720 ms 29020 KB Output is correct
3 Correct 1781 ms 28912 KB Output is correct
4 Correct 1749 ms 28784 KB Output is correct
5 Correct 1759 ms 26636 KB Output is correct
6 Correct 2501 ms 29216 KB Output is correct
7 Correct 2502 ms 30264 KB Output is correct
8 Correct 2540 ms 30756 KB Output is correct
9 Correct 62 ms 4216 KB Output is correct
10 Correct 1402 ms 30080 KB Output is correct
11 Correct 1295 ms 30248 KB Output is correct
12 Correct 1497 ms 27244 KB Output is correct
13 Correct 1598 ms 30176 KB Output is correct
14 Correct 1394 ms 21236 KB Output is correct
15 Correct 918 ms 10840 KB Output is correct
16 Correct 1578 ms 22604 KB Output is correct
17 Correct 1328 ms 21108 KB Output is correct
18 Correct 62 ms 4216 KB Output is correct
19 Correct 1502 ms 21432 KB Output is correct
20 Correct 1225 ms 20980 KB Output is correct
21 Correct 1049 ms 20736 KB Output is correct
22 Correct 847 ms 19396 KB Output is correct
23 Correct 771 ms 19256 KB Output is correct
24 Correct 965 ms 22224 KB Output is correct
25 Correct 836 ms 22360 KB Output is correct
26 Correct 1906 ms 28236 KB Output is correct
27 Correct 2310 ms 29808 KB Output is correct
28 Correct 1869 ms 27984 KB Output is correct
29 Correct 1342 ms 27712 KB Output is correct
30 Correct 2211 ms 29440 KB Output is correct
31 Correct 2211 ms 29364 KB Output is correct
32 Correct 2240 ms 29460 KB Output is correct
33 Correct 1863 ms 27664 KB Output is correct
34 Correct 1883 ms 27656 KB Output is correct
35 Correct 1929 ms 27772 KB Output is correct
36 Correct 1428 ms 27432 KB Output is correct
37 Correct 1403 ms 27448 KB Output is correct
38 Correct 1438 ms 27356 KB Output is correct
39 Correct 1152 ms 25912 KB Output is correct
40 Correct 1103 ms 25772 KB Output is correct
41 Correct 1118 ms 25928 KB Output is correct
42 Correct 1127 ms 27916 KB Output is correct
43 Correct 1150 ms 27952 KB Output is correct
44 Correct 1115 ms 28008 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 2 ms 1012 KB Output is correct
3 Correct 44 ms 3452 KB Output is correct
4 Correct 8 ms 1400 KB Output is correct
5 Correct 43 ms 3960 KB Output is correct
6 Correct 30 ms 3576 KB Output is correct
7 Correct 36 ms 4232 KB Output is correct
8 Correct 47 ms 3576 KB Output is correct
9 Correct 41 ms 5060 KB Output is correct
10 Correct 48 ms 3704 KB Output is correct
11 Correct 48 ms 3576 KB Output is correct
12 Correct 57 ms 3576 KB Output is correct
13 Correct 55 ms 3560 KB Output is correct
14 Correct 52 ms 3704 KB Output is correct
15 Correct 56 ms 3404 KB Output is correct
16 Correct 41 ms 4440 KB Output is correct
17 Correct 44 ms 4236 KB Output is correct
18 Correct 1715 ms 28184 KB Output is correct
19 Correct 1720 ms 29020 KB Output is correct
20 Correct 1781 ms 28912 KB Output is correct
21 Correct 1749 ms 28784 KB Output is correct
22 Correct 1759 ms 26636 KB Output is correct
23 Correct 2501 ms 29216 KB Output is correct
24 Correct 2502 ms 30264 KB Output is correct
25 Correct 2540 ms 30756 KB Output is correct
26 Correct 62 ms 4216 KB Output is correct
27 Correct 1402 ms 30080 KB Output is correct
28 Correct 1295 ms 30248 KB Output is correct
29 Correct 1497 ms 27244 KB Output is correct
30 Correct 1598 ms 30176 KB Output is correct
31 Correct 1394 ms 21236 KB Output is correct
32 Correct 918 ms 10840 KB Output is correct
33 Correct 1578 ms 22604 KB Output is correct
34 Correct 1328 ms 21108 KB Output is correct
35 Correct 62 ms 4216 KB Output is correct
36 Correct 1502 ms 21432 KB Output is correct
37 Correct 1225 ms 20980 KB Output is correct
38 Correct 1049 ms 20736 KB Output is correct
39 Correct 847 ms 19396 KB Output is correct
40 Correct 771 ms 19256 KB Output is correct
41 Correct 965 ms 22224 KB Output is correct
42 Correct 836 ms 22360 KB Output is correct
43 Correct 1899 ms 27576 KB Output is correct
44 Correct 62 ms 4216 KB Output is correct
45 Correct 200 ms 5564 KB Output is correct
46 Correct 96 ms 5428 KB Output is correct
47 Correct 967 ms 27004 KB Output is correct
48 Correct 1849 ms 28112 KB Output is correct
49 Correct 962 ms 27084 KB Output is correct
50 Correct 977 ms 26176 KB Output is correct
51 Correct 1008 ms 26060 KB Output is correct
52 Correct 1012 ms 26256 KB Output is correct
53 Correct 1450 ms 27064 KB Output is correct
54 Correct 1435 ms 27292 KB Output is correct
55 Correct 1460 ms 27104 KB Output is correct
56 Correct 858 ms 26992 KB Output is correct
57 Correct 914 ms 27060 KB Output is correct
58 Correct 1901 ms 27888 KB Output is correct
59 Correct 1868 ms 27828 KB Output is correct
60 Correct 1904 ms 27968 KB Output is correct
61 Correct 1898 ms 27840 KB Output is correct
62 Correct 1587 ms 27012 KB Output is correct
63 Correct 1564 ms 27128 KB Output is correct
64 Correct 1960 ms 27016 KB Output is correct
65 Correct 1120 ms 24964 KB Output is correct
66 Correct 1906 ms 28236 KB Output is correct
67 Correct 2310 ms 29808 KB Output is correct
68 Correct 1869 ms 27984 KB Output is correct
69 Correct 1342 ms 27712 KB Output is correct
70 Correct 2211 ms 29440 KB Output is correct
71 Correct 2211 ms 29364 KB Output is correct
72 Correct 2240 ms 29460 KB Output is correct
73 Correct 1863 ms 27664 KB Output is correct
74 Correct 1883 ms 27656 KB Output is correct
75 Correct 1929 ms 27772 KB Output is correct
76 Correct 1428 ms 27432 KB Output is correct
77 Correct 1403 ms 27448 KB Output is correct
78 Correct 1438 ms 27356 KB Output is correct
79 Correct 1152 ms 25912 KB Output is correct
80 Correct 1103 ms 25772 KB Output is correct
81 Correct 1118 ms 25928 KB Output is correct
82 Correct 1127 ms 27916 KB Output is correct
83 Correct 1150 ms 27952 KB Output is correct
84 Correct 1115 ms 28008 KB Output is correct
85 Correct 2473 ms 28752 KB Output is correct
86 Correct 236 ms 6732 KB Output is correct
87 Correct 127 ms 6672 KB Output is correct
88 Correct 1396 ms 30564 KB Output is correct
89 Correct 2497 ms 28968 KB Output is correct
90 Correct 1459 ms 30656 KB Output is correct
91 Correct 2003 ms 28144 KB Output is correct
92 Correct 1936 ms 28112 KB Output is correct
93 Correct 2872 ms 29708 KB Output is correct
94 Correct 2088 ms 30796 KB Output is correct
95 Correct 2193 ms 31000 KB Output is correct
96 Correct 2198 ms 32352 KB Output is correct
97 Correct 1124 ms 28420 KB Output is correct
98 Correct 1206 ms 31228 KB Output is correct
99 Correct 2458 ms 31844 KB Output is correct
100 Correct 2444 ms 31688 KB Output is correct
101 Correct 2643 ms 31988 KB Output is correct
102 Correct 2534 ms 31904 KB Output is correct
103 Correct 2390 ms 32828 KB Output is correct
104 Correct 2372 ms 32656 KB Output is correct
105 Correct 1981 ms 32452 KB Output is correct
106 Correct 1640 ms 32216 KB Output is correct
107 Correct 1765 ms 29252 KB Output is correct
108 Correct 2388 ms 31656 KB Output is correct
109 Correct 1566 ms 29484 KB Output is correct