oj.uz

Submission #425135

# Submission time Handle Problem Language Result Execution time Memory
425135 2021-06-12T13:50:18 Z yp155136 Bridges (APIO19_bridges) C++14
100 / 100
 1658 ms 16432 KB 
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
typedef unsigned long long ull;
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
const int INF = (int) 1e9 + 23111992;

void sol() {
    int n_lim = 5e4, m_lim = 1e5, q_lim = 2e5;
    int t, n, m; cin >> n >> m;
    assert(1 <= n && n <= n_lim);
    assert(0 <= m && m <= m_lim);
    vector<tuple<int, int, int>> edges;
    FOR(i, 0, m) {
        int u, v, w; cin >> u >> v >> w; u--, v--, w = -w;
        assert(0 <= u && u < n);
        assert(0 <= v && v < n);
        assert(0 <= -w && -w <= 1e9);
        edges.pb(make_tuple(u, v, w));
    }
    vector<tuple<int, int, int>> queries;
    vector<tuple<int, int, int, int>> events;
    vi lst_t(m, 0);
    int q; cin >> q;
    if (n == 1) {
        for (int i = 0; i < q; ++i) {
            int t, a, b;
            cin >> t >> a >> b;
            if (t == 2) {
                cout << "1\n";
            }
        }
        return;
    }
    assert(1 <= q && q <= q_lim);
    FOR(i, 0, q) {
        int op, u, w; cin >> op >> u >> w, u--, w = -w;
        assert(1 <= op && op <= 2);
        assert(0 <= -w && -w <= 1e9);
        if (op == 1) {
            events.pb(make_tuple(-get<2>(edges[u]), lst_t[u], i - 1, u));
            lst_t[u] = i;
            get<2>(edges[u]) = w;
            assert(0 <= u && u < m);
        }
        else {
            queries.pb(make_tuple(w, u, i));
            assert(0 <= u && u < n);
        }
    }
    FOR(i, 0, m) {
        events.pb(make_tuple(-get<2>(edges[i]), lst_t[i], q - 1, i));
    }
    reverse(all(queries)), sort(all(events));
    vii res;
    vi adj(m << 1), nxt(m << 1), lst(n, -1);
    vi dj(n), size(n);
    vi qs(n), vis(n, -1);
    int magic = 3 * isqrt(n + m);
    for (int lo = 0; lo < q; lo += magic) {
        int hi = min(lo + magic - 1, q - 1);
        vector<tuple<int, int, int>> queries_t;
        while (sz(queries) && get<2>(queries.back()) <= hi) {
            queries_t.pb(queries.back());
            queries.pop_back();
        }
        sort(all(queries_t)), reverse(all(queries_t));
        FOR(i, 0, n) dj[i] = i, size[i] = 1;
        auto find = [&] (int u) {
            while (dj[u] ^ u) {
                dj[u] = dj[dj[u]];
                u = dj[u];
            }
            return u;
        };
        auto join = [&] (int u, int v) {
            u = find(u), v = find(v);
            if (u ^ v) {
                if (size[v] < size[u]) {
                    swap(u, v);
                }
                dj[u] = v, size[v] += size[u];
            }
        };
        vi use(m);
        vector<tuple<int, int, int, int>> events_t, events_o;
        for (auto e : events) {
            int w, l, r, ix;
            tie(w, l, r, ix) = e;
            if (!(r < lo) && !(hi < l) && !(l <= lo && hi <= r)) {
                events_t.pb(e);
            }
            if (!use[ix] && !(r < lo) && !(hi < l)) {
                use[ix] = 1;
                events_o.pb(e);
            }
        }
        reverse(all(events_o));
        events_o.pb(make_tuple(-INF, +INF, -INF, 0));
        for (auto e : events_o) {
            int w, l, r, ix;
            tie(w, l, r, ix) = e, w = -w;
            while (sz(queries_t) && get<0>(queries_t.back()) < w) {
                int wt = get<0>(queries_t.back());
                int u = find(get<1>(queries_t.back()));
                int t = get<2>(queries_t.back());
                int ne = 0;
                for (auto ee : events_t) {
                    int w, l, r, ix;
                    tie(w, l, r, ix) = ee, w = -w;
                    if (l <= t && t <= r && w <= wt) {
                        int u = find(get<0>(edges[ix]));
                        int v = find(get<1>(edges[ix]));
                        auto addedge = [&] (int u, int v) {
                            adj[ne] = v, nxt[ne] = lst[u], lst[u] = ne++;
                        };
                        if (u ^ v) {
                            addedge(u, v), addedge(v, u);
                        }
                    }
                }
                int qh = 0, qe = 0;
                vis[u] = t, qs[qe++] = u;
                int total = 0;
                while (qh < qe) {
                    int u = qs[qh++];
                    total += size[u];
                    for (int ee = lst[u]; ~ee; ee = nxt[ee]) {
                        int v = adj[ee];
                        if (vis[v] ^ t) {
                            vis[v] = t, qs[qe++] = v;
                        }
                    }
                }
                res.pb(mp(t, total));
                for (int i = 0; i < ne; i++) {
                    int u = adj[i];
                    lst[u] = -1;
                }
                queries_t.pop_back();
            }
            int u = get<0>(edges[ix]);
            int v = get<1>(edges[ix]);
            join(u, v);
        }
    }
    sort(all(res));
    FOR(i, 0, sz(res)) cout << res[i].se << "\n";
}

int main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
        cerr << "Generating output for: " << argv[1] << "\n";
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    sol();
    cerr << "Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n\n";
    return 0;
}

Compilation message

bridges.cpp: In function 'void sol()':
bridges.cpp:21:9: warning: unused variable 't' [-Wunused-variable]
   21 |     int t, n, m; cin >> n >> m;
      |         ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 19 ms 640 KB Output is correct
4 Correct 4 ms 316 KB Output is correct
5 Correct 26 ms 708 KB Output is correct
6 Correct 21 ms 768 KB Output is correct
7 Correct 19 ms 716 KB Output is correct
8 Correct 22 ms 768 KB Output is correct
9 Correct 15 ms 588 KB Output is correct
10 Correct 20 ms 764 KB Output is correct
11 Correct 20 ms 708 KB Output is correct
12 Correct 20 ms 772 KB Output is correct
13 Correct 19 ms 724 KB Output is correct
14 Correct 19 ms 796 KB Output is correct
15 Correct 21 ms 732 KB Output is correct
16 Correct 15 ms 696 KB Output is correct
17 Correct 16 ms 652 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1160 ms 7584 KB Output is correct
2 Correct 1095 ms 7660 KB Output is correct
3 Correct 1061 ms 7700 KB Output is correct
4 Correct 1065 ms 7648 KB Output is correct
5 Correct 1092 ms 7648 KB Output is correct
6 Correct 1248 ms 7832 KB Output is correct
7 Correct 1284 ms 8048 KB Output is correct
8 Correct 1273 ms 7824 KB Output is correct
9 Correct 30 ms 456 KB Output is correct
10 Correct 905 ms 9392 KB Output is correct
11 Correct 841 ms 9440 KB Output is correct
12 Correct 644 ms 11144 KB Output is correct
13 Correct 841 ms 10172 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 933 ms 5912 KB Output is correct
2 Correct 540 ms 3520 KB Output is correct
3 Correct 959 ms 6000 KB Output is correct
4 Correct 909 ms 5808 KB Output is correct
5 Correct 29 ms 520 KB Output is correct
6 Correct 931 ms 8104 KB Output is correct
7 Correct 859 ms 8232 KB Output is correct
8 Correct 837 ms 8228 KB Output is correct
9 Correct 518 ms 8440 KB Output is correct
10 Correct 485 ms 8408 KB Output is correct
11 Correct 730 ms 7576 KB Output is correct
12 Correct 682 ms 7744 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 713 ms 12612 KB Output is correct
2 Correct 29 ms 456 KB Output is correct
3 Correct 123 ms 11212 KB Output is correct
4 Correct 105 ms 11256 KB Output is correct
5 Correct 551 ms 15056 KB Output is correct
6 Correct 714 ms 16432 KB Output is correct
7 Correct 530 ms 14928 KB Output is correct
8 Correct 510 ms 11032 KB Output is correct
9 Correct 448 ms 11064 KB Output is correct
10 Correct 506 ms 11064 KB Output is correct
11 Correct 684 ms 14000 KB Output is correct
12 Correct 642 ms 14148 KB Output is correct
13 Correct 652 ms 14016 KB Output is correct
14 Correct 516 ms 14976 KB Output is correct
15 Correct 511 ms 15036 KB Output is correct
16 Correct 744 ms 16296 KB Output is correct
17 Correct 722 ms 16300 KB Output is correct
18 Correct 705 ms 16404 KB Output is correct
19 Correct 795 ms 16404 KB Output is correct
20 Correct 668 ms 14800 KB Output is correct
21 Correct 717 ms 14772 KB Output is correct
22 Correct 690 ms 15980 KB Output is correct
23 Correct 602 ms 13564 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1160 ms 7584 KB Output is correct
2 Correct 1095 ms 7660 KB Output is correct
3 Correct 1061 ms 7700 KB Output is correct
4 Correct 1065 ms 7648 KB Output is correct
5 Correct 1092 ms 7648 KB Output is correct
6 Correct 1248 ms 7832 KB Output is correct
7 Correct 1284 ms 8048 KB Output is correct
8 Correct 1273 ms 7824 KB Output is correct
9 Correct 30 ms 456 KB Output is correct
10 Correct 905 ms 9392 KB Output is correct
11 Correct 841 ms 9440 KB Output is correct
12 Correct 644 ms 11144 KB Output is correct
13 Correct 841 ms 10172 KB Output is correct
14 Correct 933 ms 5912 KB Output is correct
15 Correct 540 ms 3520 KB Output is correct
16 Correct 959 ms 6000 KB Output is correct
17 Correct 909 ms 5808 KB Output is correct
18 Correct 29 ms 520 KB Output is correct
19 Correct 931 ms 8104 KB Output is correct
20 Correct 859 ms 8232 KB Output is correct
21 Correct 837 ms 8228 KB Output is correct
22 Correct 518 ms 8440 KB Output is correct
23 Correct 485 ms 8408 KB Output is correct
24 Correct 730 ms 7576 KB Output is correct
25 Correct 682 ms 7744 KB Output is correct
26 Correct 1134 ms 10516 KB Output is correct
27 Correct 1286 ms 10284 KB Output is correct
28 Correct 1121 ms 10508 KB Output is correct
29 Correct 928 ms 10388 KB Output is correct
30 Correct 1195 ms 10356 KB Output is correct
31 Correct 1204 ms 10356 KB Output is correct
32 Correct 1197 ms 10328 KB Output is correct
33 Correct 1159 ms 10364 KB Output is correct
34 Correct 1118 ms 10376 KB Output is correct
35 Correct 1135 ms 10372 KB Output is correct
36 Correct 953 ms 10488 KB Output is correct
37 Correct 972 ms 10424 KB Output is correct
38 Correct 906 ms 10312 KB Output is correct
39 Correct 591 ms 11012 KB Output is correct
40 Correct 601 ms 10976 KB Output is correct
41 Correct 641 ms 11032 KB Output is correct
42 Correct 767 ms 10104 KB Output is correct
43 Correct 808 ms 10156 KB Output is correct
44 Correct 786 ms 10176 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 19 ms 640 KB Output is correct
4 Correct 4 ms 316 KB Output is correct
5 Correct 26 ms 708 KB Output is correct
6 Correct 21 ms 768 KB Output is correct
7 Correct 19 ms 716 KB Output is correct
8 Correct 22 ms 768 KB Output is correct
9 Correct 15 ms 588 KB Output is correct
10 Correct 20 ms 764 KB Output is correct
11 Correct 20 ms 708 KB Output is correct
12 Correct 20 ms 772 KB Output is correct
13 Correct 19 ms 724 KB Output is correct
14 Correct 19 ms 796 KB Output is correct
15 Correct 21 ms 732 KB Output is correct
16 Correct 15 ms 696 KB Output is correct
17 Correct 16 ms 652 KB Output is correct
18 Correct 1160 ms 7584 KB Output is correct
19 Correct 1095 ms 7660 KB Output is correct
20 Correct 1061 ms 7700 KB Output is correct
21 Correct 1065 ms 7648 KB Output is correct
22 Correct 1092 ms 7648 KB Output is correct
23 Correct 1248 ms 7832 KB Output is correct
24 Correct 1284 ms 8048 KB Output is correct
25 Correct 1273 ms 7824 KB Output is correct
26 Correct 30 ms 456 KB Output is correct
27 Correct 905 ms 9392 KB Output is correct
28 Correct 841 ms 9440 KB Output is correct
29 Correct 644 ms 11144 KB Output is correct
30 Correct 841 ms 10172 KB Output is correct
31 Correct 933 ms 5912 KB Output is correct
32 Correct 540 ms 3520 KB Output is correct
33 Correct 959 ms 6000 KB Output is correct
34 Correct 909 ms 5808 KB Output is correct
35 Correct 29 ms 520 KB Output is correct
36 Correct 931 ms 8104 KB Output is correct
37 Correct 859 ms 8232 KB Output is correct
38 Correct 837 ms 8228 KB Output is correct
39 Correct 518 ms 8440 KB Output is correct
40 Correct 485 ms 8408 KB Output is correct
41 Correct 730 ms 7576 KB Output is correct
42 Correct 682 ms 7744 KB Output is correct
43 Correct 713 ms 12612 KB Output is correct
44 Correct 29 ms 456 KB Output is correct
45 Correct 123 ms 11212 KB Output is correct
46 Correct 105 ms 11256 KB Output is correct
47 Correct 551 ms 15056 KB Output is correct
48 Correct 714 ms 16432 KB Output is correct
49 Correct 530 ms 14928 KB Output is correct
50 Correct 510 ms 11032 KB Output is correct
51 Correct 448 ms 11064 KB Output is correct
52 Correct 506 ms 11064 KB Output is correct
53 Correct 684 ms 14000 KB Output is correct
54 Correct 642 ms 14148 KB Output is correct
55 Correct 652 ms 14016 KB Output is correct
56 Correct 516 ms 14976 KB Output is correct
57 Correct 511 ms 15036 KB Output is correct
58 Correct 744 ms 16296 KB Output is correct
59 Correct 722 ms 16300 KB Output is correct
60 Correct 705 ms 16404 KB Output is correct
61 Correct 795 ms 16404 KB Output is correct
62 Correct 668 ms 14800 KB Output is correct
63 Correct 717 ms 14772 KB Output is correct
64 Correct 690 ms 15980 KB Output is correct
65 Correct 602 ms 13564 KB Output is correct
66 Correct 1134 ms 10516 KB Output is correct
67 Correct 1286 ms 10284 KB Output is correct
68 Correct 1121 ms 10508 KB Output is correct
69 Correct 928 ms 10388 KB Output is correct
70 Correct 1195 ms 10356 KB Output is correct
71 Correct 1204 ms 10356 KB Output is correct
72 Correct 1197 ms 10328 KB Output is correct
73 Correct 1159 ms 10364 KB Output is correct
74 Correct 1118 ms 10376 KB Output is correct
75 Correct 1135 ms 10372 KB Output is correct
76 Correct 953 ms 10488 KB Output is correct
77 Correct 972 ms 10424 KB Output is correct
78 Correct 906 ms 10312 KB Output is correct
79 Correct 591 ms 11012 KB Output is correct
80 Correct 601 ms 10976 KB Output is correct
81 Correct 641 ms 11032 KB Output is correct
82 Correct 767 ms 10104 KB Output is correct
83 Correct 808 ms 10156 KB Output is correct
84 Correct 786 ms 10176 KB Output is correct
85 Correct 1431 ms 16180 KB Output is correct
86 Correct 163 ms 11144 KB Output is correct
87 Correct 160 ms 11320 KB Output is correct
88 Correct 1119 ms 14516 KB Output is correct
89 Correct 1440 ms 16040 KB Output is correct
90 Correct 1128 ms 14692 KB Output is correct
91 Correct 1117 ms 10384 KB Output is correct
92 Correct 1118 ms 10596 KB Output is correct
93 Correct 1310 ms 10496 KB Output is correct
94 Correct 1336 ms 13664 KB Output is correct
95 Correct 1341 ms 13748 KB Output is correct
96 Correct 1534 ms 13828 KB Output is correct
97 Correct 720 ms 15512 KB Output is correct
98 Correct 907 ms 14408 KB Output is correct
99 Correct 1556 ms 16036 KB Output is correct
100 Correct 1436 ms 15792 KB Output is correct
101 Correct 1433 ms 16096 KB Output is correct
102 Correct 1600 ms 15880 KB Output is correct
103 Correct 1623 ms 14576 KB Output is correct
104 Correct 1658 ms 14428 KB Output is correct
105 Correct 1285 ms 14164 KB Output is correct
106 Correct 1116 ms 13384 KB Output is correct
107 Correct 976 ms 14764 KB Output is correct
108 Correct 1595 ms 15604 KB Output is correct
109 Correct 1385 ms 12980 KB Output is correct