oj.uz

Submission #217841

# Submission time Handle Problem Language Result Execution time Memory
217841 2020-03-31T02:18:18 Z lyc Bridges (APIO19_bridges) C++14
100 / 100
 2880 ms 13408 KB 
#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i <= (b); ++i)
#define SZ(x) ((int)(x).size())
typedef pair<int,int> ii;

const int MX_N = 5e4+5;
const int MX_M = 1e5+5;
const int MX_Q = 1e5+5;
//const int B = 800;
const int B = 500;
//const int B = 230;
//const int B = 1;

struct Edge {
    int s, e, b, w;
};

struct Query {
    int t, s, w;
};

int N, M;
ii bridge[MX_M];
int weight[MX_M];
int time_[MX_M];
int Q;
vector<Edge> edges;
vector<Query> queries;
int ans[MX_Q];

struct UnionFind {
    vector<int> sz, p;
    int history[MX_N], hptr = 0;
    UnionFind(int n) { sz.assign(n,1); p.resize(n); iota(p.begin(),p.end(),0); }
    int findset(int i) { return (p[i] == i) ? i : findset(p[i]); }
    bool unionset(int i, int j) {
        //cout << "union " << i << " " << j << endl;
        int x = findset(i), y = findset(j);
        if (x != y) {
            if (sz[x] > sz[y]) {
                sz[x] += sz[y], p[y] = x;
                history[hptr++] = y;
            } else {
                sz[y] += sz[x], p[x] = y;
                history[hptr++] = x;
            }
            return true;
        } else return false;
    }
    inline int getLoc() { return hptr; }
    inline void undo(int loc) {
        while (hptr > loc) {
            int u = history[--hptr];
            //cout << "undo " << u << " " << p[u] << endl;
            sz[p[u]] -= sz[u], p[u] = u;
        }
    }
    inline int getSize(int i) { return sz[findset(i)]; }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> N >> M;
    FOR(i,1,M){
        int U, V, D; cin >> U >> V >> D;
        bridge[i] = {U,V};
        weight[i] = D;
        time_[i] = 0;
    }

    cin >> Q;
    FOR(i,1,Q){
        int T; cin >> T;
        if (T == 1) {
            int B, R; cin >> B >> R;
            edges.emplace_back((Edge){ time_[B],i-1,B,weight[B] });
            time_[B] = i;
            weight[B] = R;

            ans[i] = -1;
        } else {
            int S, W; cin >> S >> W;
            //queries[i/B].emplace_back((Query){ i,S,W });
            queries.emplace_back((Query){ i,S,W });
        }
    }
    FOR(B,1,M){
        edges.emplace_back((Edge){ time_[B],Q+1,B,weight[B] });
    }

    sort(edges.begin(),edges.end(),[](Edge a,Edge b){ return a.w > b.w; });
    sort(queries.begin(),queries.end(),[](Query a,Query b) { if (a.t/B == b.t/B) return a.w > b.w; return a.t < b.t; });
    //for(auto& a : edges) cout << a.s << " " << a.e << " :: " << bridge[a.b].first << " " << bridge[a.b].second << " " << a.w << endl;
    int qi = 0;
    while (qi < SZ(queries)) {
        int b = queries[qi].t/B;
        UnionFind UF(N+1);
        vector<Edge> partial;
        partial.reserve(2*B);
        for (auto& e : edges) {
            if ((e.s >= b*B && e.s <= (b+1)*B-1) || (e.e >= b*B && e.e <= (b+1)*B-1))
                partial.push_back(e);
        }
        //sort(queries[b].begin(),queries[b].end(),[](Query a, Query b){ return a.w > b.w; });
        int fi = 0;
        for (; qi < SZ(queries) && queries[qi].t/B == b; ++qi) {
            Query& q = queries[qi];
            //cout << "BUCKET " << b << " :: " << q.t << " " << q.w << " " << q.s << endl;
            while (fi < SZ(edges) && edges[fi].w >= q.w) {
                //cout << "\tconsider edge " << edges[fi].s << " " << edges[fi].e << " " << bridge[edges[fi].b].first << " " << bridge[edges[fi].b].second << " " << edges[fi].w << endl;
                if (edges[fi].s <= b*B && edges[fi].e >= (b+1)*B-1)
                    UF.unionset(bridge[edges[fi].b].first, bridge[edges[fi].b].second);
                ++fi;
            }
            int loc = UF.getLoc();
            for (auto& e : partial) {
                if (e.s <= q.t && q.t <= e.e && e.w >= q.w) {
                    UF.unionset(bridge[e.b].first, bridge[e.b].second);
                }
            }
            ans[q.t] = UF.getSize(q.s);
            UF.undo(loc);
        }
    }

    FOR(i,1,Q){
        if (ans[i] != -1) cout << ans[i] << '\n';
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 32 ms 896 KB Output is correct
4 Correct 9 ms 824 KB Output is correct
5 Correct 24 ms 888 KB Output is correct
6 Correct 19 ms 888 KB Output is correct
7 Correct 22 ms 768 KB Output is correct
8 Correct 23 ms 768 KB Output is correct
9 Correct 23 ms 768 KB Output is correct
10 Correct 23 ms 768 KB Output is correct
11 Correct 23 ms 768 KB Output is correct
12 Correct 24 ms 856 KB Output is correct
13 Correct 28 ms 896 KB Output is correct
14 Correct 26 ms 896 KB Output is correct
15 Correct 29 ms 896 KB Output is correct
16 Correct 21 ms 768 KB Output is correct
17 Correct 22 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1273 ms 6292 KB Output is correct
2 Correct 1248 ms 6188 KB Output is correct
3 Correct 1235 ms 6132 KB Output is correct
4 Correct 1328 ms 6312 KB Output is correct
5 Correct 1303 ms 6132 KB Output is correct
6 Correct 1992 ms 6296 KB Output is correct
7 Correct 1968 ms 6280 KB Output is correct
8 Correct 1954 ms 6256 KB Output is correct
9 Correct 51 ms 2684 KB Output is correct
10 Correct 1286 ms 6168 KB Output is correct
11 Correct 1202 ms 6148 KB Output is correct
12 Correct 1632 ms 6136 KB Output is correct
13 Correct 1222 ms 6520 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1029 ms 5256 KB Output is correct
2 Correct 669 ms 3212 KB Output is correct
3 Correct 1156 ms 5196 KB Output is correct
4 Correct 1000 ms 5192 KB Output is correct
5 Correct 47 ms 2408 KB Output is correct
6 Correct 1087 ms 5180 KB Output is correct
7 Correct 944 ms 5260 KB Output is correct
8 Correct 877 ms 5284 KB Output is correct
9 Correct 721 ms 5384 KB Output is correct
10 Correct 631 ms 5144 KB Output is correct
11 Correct 822 ms 5376 KB Output is correct
12 Correct 766 ms 5376 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1936 ms 9736 KB Output is correct
2 Correct 70 ms 2412 KB Output is correct
3 Correct 885 ms 7368 KB Output is correct
4 Correct 1311 ms 7512 KB Output is correct
5 Correct 1856 ms 9340 KB Output is correct
6 Correct 1875 ms 9472 KB Output is correct
7 Correct 1902 ms 9476 KB Output is correct
8 Correct 830 ms 6228 KB Output is correct
9 Correct 821 ms 6108 KB Output is correct
10 Correct 1453 ms 6100 KB Output is correct
11 Correct 1513 ms 8176 KB Output is correct
12 Correct 1493 ms 8200 KB Output is correct
13 Correct 2368 ms 8172 KB Output is correct
14 Correct 2217 ms 9476 KB Output is correct
15 Correct 2021 ms 9520 KB Output is correct
16 Correct 2122 ms 9612 KB Output is correct
17 Correct 2095 ms 13168 KB Output is correct
18 Correct 2077 ms 13232 KB Output is correct
19 Correct 2047 ms 13196 KB Output is correct
20 Correct 2800 ms 11924 KB Output is correct
21 Correct 2796 ms 11632 KB Output is correct
22 Correct 2703 ms 12876 KB Output is correct
23 Correct 2373 ms 10300 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1273 ms 6292 KB Output is correct
2 Correct 1248 ms 6188 KB Output is correct
3 Correct 1235 ms 6132 KB Output is correct
4 Correct 1328 ms 6312 KB Output is correct
5 Correct 1303 ms 6132 KB Output is correct
6 Correct 1992 ms 6296 KB Output is correct
7 Correct 1968 ms 6280 KB Output is correct
8 Correct 1954 ms 6256 KB Output is correct
9 Correct 51 ms 2684 KB Output is correct
10 Correct 1286 ms 6168 KB Output is correct
11 Correct 1202 ms 6148 KB Output is correct
12 Correct 1632 ms 6136 KB Output is correct
13 Correct 1222 ms 6520 KB Output is correct
14 Correct 1029 ms 5256 KB Output is correct
15 Correct 669 ms 3212 KB Output is correct
16 Correct 1156 ms 5196 KB Output is correct
17 Correct 1000 ms 5192 KB Output is correct
18 Correct 47 ms 2408 KB Output is correct
19 Correct 1087 ms 5180 KB Output is correct
20 Correct 944 ms 5260 KB Output is correct
21 Correct 877 ms 5284 KB Output is correct
22 Correct 721 ms 5384 KB Output is correct
23 Correct 631 ms 5144 KB Output is correct
24 Correct 822 ms 5376 KB Output is correct
25 Correct 766 ms 5376 KB Output is correct
26 Correct 1351 ms 6336 KB Output is correct
27 Correct 1695 ms 6300 KB Output is correct
28 Correct 1374 ms 6172 KB Output is correct
29 Correct 1037 ms 6168 KB Output is correct
30 Correct 1548 ms 6172 KB Output is correct
31 Correct 1588 ms 6412 KB Output is correct
32 Correct 1593 ms 6172 KB Output is correct
33 Correct 1260 ms 6172 KB Output is correct
34 Correct 1282 ms 6168 KB Output is correct
35 Correct 1287 ms 6168 KB Output is correct
36 Correct 1032 ms 6164 KB Output is correct
37 Correct 1077 ms 6164 KB Output is correct
38 Correct 1020 ms 6164 KB Output is correct
39 Correct 742 ms 6024 KB Output is correct
40 Correct 755 ms 6156 KB Output is correct
41 Correct 743 ms 6152 KB Output is correct
42 Correct 946 ms 6520 KB Output is correct
43 Correct 953 ms 6392 KB Output is correct
44 Correct 939 ms 6392 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 32 ms 896 KB Output is correct
4 Correct 9 ms 824 KB Output is correct
5 Correct 24 ms 888 KB Output is correct
6 Correct 19 ms 888 KB Output is correct
7 Correct 22 ms 768 KB Output is correct
8 Correct 23 ms 768 KB Output is correct
9 Correct 23 ms 768 KB Output is correct
10 Correct 23 ms 768 KB Output is correct
11 Correct 23 ms 768 KB Output is correct
12 Correct 24 ms 856 KB Output is correct
13 Correct 28 ms 896 KB Output is correct
14 Correct 26 ms 896 KB Output is correct
15 Correct 29 ms 896 KB Output is correct
16 Correct 21 ms 768 KB Output is correct
17 Correct 22 ms 768 KB Output is correct
18 Correct 1273 ms 6292 KB Output is correct
19 Correct 1248 ms 6188 KB Output is correct
20 Correct 1235 ms 6132 KB Output is correct
21 Correct 1328 ms 6312 KB Output is correct
22 Correct 1303 ms 6132 KB Output is correct
23 Correct 1992 ms 6296 KB Output is correct
24 Correct 1968 ms 6280 KB Output is correct
25 Correct 1954 ms 6256 KB Output is correct
26 Correct 51 ms 2684 KB Output is correct
27 Correct 1286 ms 6168 KB Output is correct
28 Correct 1202 ms 6148 KB Output is correct
29 Correct 1632 ms 6136 KB Output is correct
30 Correct 1222 ms 6520 KB Output is correct
31 Correct 1029 ms 5256 KB Output is correct
32 Correct 669 ms 3212 KB Output is correct
33 Correct 1156 ms 5196 KB Output is correct
34 Correct 1000 ms 5192 KB Output is correct
35 Correct 47 ms 2408 KB Output is correct
36 Correct 1087 ms 5180 KB Output is correct
37 Correct 944 ms 5260 KB Output is correct
38 Correct 877 ms 5284 KB Output is correct
39 Correct 721 ms 5384 KB Output is correct
40 Correct 631 ms 5144 KB Output is correct
41 Correct 822 ms 5376 KB Output is correct
42 Correct 766 ms 5376 KB Output is correct
43 Correct 1936 ms 9736 KB Output is correct
44 Correct 70 ms 2412 KB Output is correct
45 Correct 885 ms 7368 KB Output is correct
46 Correct 1311 ms 7512 KB Output is correct
47 Correct 1856 ms 9340 KB Output is correct
48 Correct 1875 ms 9472 KB Output is correct
49 Correct 1902 ms 9476 KB Output is correct
50 Correct 830 ms 6228 KB Output is correct
51 Correct 821 ms 6108 KB Output is correct
52 Correct 1453 ms 6100 KB Output is correct
53 Correct 1513 ms 8176 KB Output is correct
54 Correct 1493 ms 8200 KB Output is correct
55 Correct 2368 ms 8172 KB Output is correct
56 Correct 2217 ms 9476 KB Output is correct
57 Correct 2021 ms 9520 KB Output is correct
58 Correct 2122 ms 9612 KB Output is correct
59 Correct 2095 ms 13168 KB Output is correct
60 Correct 2077 ms 13232 KB Output is correct
61 Correct 2047 ms 13196 KB Output is correct
62 Correct 2800 ms 11924 KB Output is correct
63 Correct 2796 ms 11632 KB Output is correct
64 Correct 2703 ms 12876 KB Output is correct
65 Correct 2373 ms 10300 KB Output is correct
66 Correct 1351 ms 6336 KB Output is correct
67 Correct 1695 ms 6300 KB Output is correct
68 Correct 1374 ms 6172 KB Output is correct
69 Correct 1037 ms 6168 KB Output is correct
70 Correct 1548 ms 6172 KB Output is correct
71 Correct 1588 ms 6412 KB Output is correct
72 Correct 1593 ms 6172 KB Output is correct
73 Correct 1260 ms 6172 KB Output is correct
74 Correct 1282 ms 6168 KB Output is correct
75 Correct 1287 ms 6168 KB Output is correct
76 Correct 1032 ms 6164 KB Output is correct
77 Correct 1077 ms 6164 KB Output is correct
78 Correct 1020 ms 6164 KB Output is correct
79 Correct 742 ms 6024 KB Output is correct
80 Correct 755 ms 6156 KB Output is correct
81 Correct 743 ms 6152 KB Output is correct
82 Correct 946 ms 6520 KB Output is correct
83 Correct 953 ms 6392 KB Output is correct
84 Correct 939 ms 6392 KB Output is correct
85 Correct 2119 ms 13348 KB Output is correct
86 Correct 543 ms 9068 KB Output is correct
87 Correct 736 ms 9232 KB Output is correct
88 Correct 2079 ms 11648 KB Output is correct
89 Correct 2103 ms 13408 KB Output is correct
90 Correct 2015 ms 11716 KB Output is correct
91 Correct 1367 ms 8748 KB Output is correct
92 Correct 1357 ms 9132 KB Output is correct
93 Correct 2001 ms 8628 KB Output is correct
94 Correct 1904 ms 11068 KB Output is correct
95 Correct 1895 ms 11516 KB Output is correct
96 Correct 2468 ms 11556 KB Output is correct
97 Correct 2064 ms 11684 KB Output is correct
98 Correct 1500 ms 11904 KB Output is correct
99 Correct 2299 ms 13184 KB Output is correct
100 Correct 2293 ms 13196 KB Output is correct
101 Correct 2226 ms 13316 KB Output is correct
102 Correct 2193 ms 13212 KB Output is correct
103 Correct 2683 ms 11956 KB Output is correct
104 Correct 2687 ms 11872 KB Output is correct
105 Correct 1845 ms 12280 KB Output is correct
106 Correct 1483 ms 11764 KB Output is correct
107 Correct 2880 ms 11768 KB Output is correct
108 Correct 2642 ms 13056 KB Output is correct
109 Correct 2343 ms 10744 KB Output is correct