oj.uz

Submission #364211

# Submission time Handle Problem Language Result Execution time Memory
364211 2021-02-08T12:34:44 Z grace0068 Bridges (APIO19_bridges) C++17
100 / 100
 1633 ms 16244 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();
    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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 17 ms 748 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 15 ms 620 KB Output is correct
6 Correct 13 ms 620 KB Output is correct
7 Correct 11 ms 620 KB Output is correct
8 Correct 14 ms 620 KB Output is correct
9 Correct 12 ms 620 KB Output is correct
10 Correct 14 ms 620 KB Output is correct
11 Correct 14 ms 620 KB Output is correct
12 Correct 14 ms 620 KB Output is correct
13 Correct 15 ms 748 KB Output is correct
14 Correct 14 ms 620 KB Output is correct
15 Correct 14 ms 620 KB Output is correct
16 Correct 10 ms 620 KB Output is correct
17 Correct 10 ms 620 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1075 ms 7832 KB Output is correct
2 Correct 1098 ms 7680 KB Output is correct
3 Correct 1113 ms 7788 KB Output is correct
4 Correct 1063 ms 7704 KB Output is correct
5 Correct 1067 ms 7672 KB Output is correct
6 Correct 1232 ms 7920 KB Output is correct
7 Correct 1219 ms 10628 KB Output is correct
8 Correct 1197 ms 10620 KB Output is correct
9 Correct 28 ms 1900 KB Output is correct
10 Correct 829 ms 9428 KB Output is correct
11 Correct 828 ms 9556 KB Output is correct
12 Correct 665 ms 11092 KB Output is correct
13 Correct 820 ms 10388 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 918 ms 6020 KB Output is correct
2 Correct 482 ms 3796 KB Output is correct
3 Correct 928 ms 6020 KB Output is correct
4 Correct 913 ms 6120 KB Output is correct
5 Correct 27 ms 492 KB Output is correct
6 Correct 922 ms 6044 KB Output is correct
7 Correct 815 ms 5988 KB Output is correct
8 Correct 797 ms 5920 KB Output is correct
9 Correct 501 ms 6180 KB Output is correct
10 Correct 494 ms 6308 KB Output is correct
11 Correct 640 ms 5456 KB Output is correct
12 Correct 640 ms 5464 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 745 ms 12768 KB Output is correct
2 Correct 27 ms 620 KB Output is correct
3 Correct 124 ms 9372 KB Output is correct
4 Correct 102 ms 9492 KB Output is correct
5 Correct 532 ms 12904 KB Output is correct
6 Correct 740 ms 12944 KB Output is correct
7 Correct 575 ms 12840 KB Output is correct
8 Correct 479 ms 8488 KB Output is correct
9 Correct 474 ms 8392 KB Output is correct
10 Correct 481 ms 8648 KB Output is correct
11 Correct 660 ms 10884 KB Output is correct
12 Correct 637 ms 11012 KB Output is correct
13 Correct 677 ms 11164 KB Output is correct
14 Correct 511 ms 13024 KB Output is correct
15 Correct 509 ms 12768 KB Output is correct
16 Correct 728 ms 12752 KB Output is correct
17 Correct 755 ms 12760 KB Output is correct
18 Correct 770 ms 12696 KB Output is correct
19 Correct 747 ms 12716 KB Output is correct
20 Correct 714 ms 11864 KB Output is correct
21 Correct 709 ms 11776 KB Output is correct
22 Correct 748 ms 12496 KB Output is correct
23 Correct 653 ms 11408 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1075 ms 7832 KB Output is correct
2 Correct 1098 ms 7680 KB Output is correct
3 Correct 1113 ms 7788 KB Output is correct
4 Correct 1063 ms 7704 KB Output is correct
5 Correct 1067 ms 7672 KB Output is correct
6 Correct 1232 ms 7920 KB Output is correct
7 Correct 1219 ms 10628 KB Output is correct
8 Correct 1197 ms 10620 KB Output is correct
9 Correct 28 ms 1900 KB Output is correct
10 Correct 829 ms 9428 KB Output is correct
11 Correct 828 ms 9556 KB Output is correct
12 Correct 665 ms 11092 KB Output is correct
13 Correct 820 ms 10388 KB Output is correct
14 Correct 918 ms 6020 KB Output is correct
15 Correct 482 ms 3796 KB Output is correct
16 Correct 928 ms 6020 KB Output is correct
17 Correct 913 ms 6120 KB Output is correct
18 Correct 27 ms 492 KB Output is correct
19 Correct 922 ms 6044 KB Output is correct
20 Correct 815 ms 5988 KB Output is correct
21 Correct 797 ms 5920 KB Output is correct
22 Correct 501 ms 6180 KB Output is correct
23 Correct 494 ms 6308 KB Output is correct
24 Correct 640 ms 5456 KB Output is correct
25 Correct 640 ms 5464 KB Output is correct
26 Correct 1162 ms 10556 KB Output is correct
27 Correct 1232 ms 10348 KB Output is correct
28 Correct 1166 ms 10684 KB Output is correct
29 Correct 924 ms 10468 KB Output is correct
30 Correct 1215 ms 10556 KB Output is correct
31 Correct 1182 ms 10392 KB Output is correct
32 Correct 1189 ms 10624 KB Output is correct
33 Correct 1132 ms 10580 KB Output is correct
34 Correct 1142 ms 10608 KB Output is correct
35 Correct 1138 ms 10684 KB Output is correct
36 Correct 955 ms 10592 KB Output is correct
37 Correct 937 ms 10592 KB Output is correct
38 Correct 947 ms 10508 KB Output is correct
39 Correct 649 ms 11380 KB Output is correct
40 Correct 648 ms 11188 KB Output is correct
41 Correct 611 ms 11124 KB Output is correct
42 Correct 785 ms 10456 KB Output is correct
43 Correct 781 ms 10308 KB Output is correct
44 Correct 759 ms 10456 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 17 ms 748 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 15 ms 620 KB Output is correct
6 Correct 13 ms 620 KB Output is correct
7 Correct 11 ms 620 KB Output is correct
8 Correct 14 ms 620 KB Output is correct
9 Correct 12 ms 620 KB Output is correct
10 Correct 14 ms 620 KB Output is correct
11 Correct 14 ms 620 KB Output is correct
12 Correct 14 ms 620 KB Output is correct
13 Correct 15 ms 748 KB Output is correct
14 Correct 14 ms 620 KB Output is correct
15 Correct 14 ms 620 KB Output is correct
16 Correct 10 ms 620 KB Output is correct
17 Correct 10 ms 620 KB Output is correct
18 Correct 1075 ms 7832 KB Output is correct
19 Correct 1098 ms 7680 KB Output is correct
20 Correct 1113 ms 7788 KB Output is correct
21 Correct 1063 ms 7704 KB Output is correct
22 Correct 1067 ms 7672 KB Output is correct
23 Correct 1232 ms 7920 KB Output is correct
24 Correct 1219 ms 10628 KB Output is correct
25 Correct 1197 ms 10620 KB Output is correct
26 Correct 28 ms 1900 KB Output is correct
27 Correct 829 ms 9428 KB Output is correct
28 Correct 828 ms 9556 KB Output is correct
29 Correct 665 ms 11092 KB Output is correct
30 Correct 820 ms 10388 KB Output is correct
31 Correct 918 ms 6020 KB Output is correct
32 Correct 482 ms 3796 KB Output is correct
33 Correct 928 ms 6020 KB Output is correct
34 Correct 913 ms 6120 KB Output is correct
35 Correct 27 ms 492 KB Output is correct
36 Correct 922 ms 6044 KB Output is correct
37 Correct 815 ms 5988 KB Output is correct
38 Correct 797 ms 5920 KB Output is correct
39 Correct 501 ms 6180 KB Output is correct
40 Correct 494 ms 6308 KB Output is correct
41 Correct 640 ms 5456 KB Output is correct
42 Correct 640 ms 5464 KB Output is correct
43 Correct 745 ms 12768 KB Output is correct
44 Correct 27 ms 620 KB Output is correct
45 Correct 124 ms 9372 KB Output is correct
46 Correct 102 ms 9492 KB Output is correct
47 Correct 532 ms 12904 KB Output is correct
48 Correct 740 ms 12944 KB Output is correct
49 Correct 575 ms 12840 KB Output is correct
50 Correct 479 ms 8488 KB Output is correct
51 Correct 474 ms 8392 KB Output is correct
52 Correct 481 ms 8648 KB Output is correct
53 Correct 660 ms 10884 KB Output is correct
54 Correct 637 ms 11012 KB Output is correct
55 Correct 677 ms 11164 KB Output is correct
56 Correct 511 ms 13024 KB Output is correct
57 Correct 509 ms 12768 KB Output is correct
58 Correct 728 ms 12752 KB Output is correct
59 Correct 755 ms 12760 KB Output is correct
60 Correct 770 ms 12696 KB Output is correct
61 Correct 747 ms 12716 KB Output is correct
62 Correct 714 ms 11864 KB Output is correct
63 Correct 709 ms 11776 KB Output is correct
64 Correct 748 ms 12496 KB Output is correct
65 Correct 653 ms 11408 KB Output is correct
66 Correct 1162 ms 10556 KB Output is correct
67 Correct 1232 ms 10348 KB Output is correct
68 Correct 1166 ms 10684 KB Output is correct
69 Correct 924 ms 10468 KB Output is correct
70 Correct 1215 ms 10556 KB Output is correct
71 Correct 1182 ms 10392 KB Output is correct
72 Correct 1189 ms 10624 KB Output is correct
73 Correct 1132 ms 10580 KB Output is correct
74 Correct 1142 ms 10608 KB Output is correct
75 Correct 1138 ms 10684 KB Output is correct
76 Correct 955 ms 10592 KB Output is correct
77 Correct 937 ms 10592 KB Output is correct
78 Correct 947 ms 10508 KB Output is correct
79 Correct 649 ms 11380 KB Output is correct
80 Correct 648 ms 11188 KB Output is correct
81 Correct 611 ms 11124 KB Output is correct
82 Correct 785 ms 10456 KB Output is correct
83 Correct 781 ms 10308 KB Output is correct
84 Correct 759 ms 10456 KB Output is correct
85 Correct 1531 ms 16204 KB Output is correct
86 Correct 170 ms 11260 KB Output is correct
87 Correct 159 ms 11476 KB Output is correct
88 Correct 1094 ms 14792 KB Output is correct
89 Correct 1451 ms 16052 KB Output is correct
90 Correct 1113 ms 14804 KB Output is correct
91 Correct 1126 ms 10476 KB Output is correct
92 Correct 1141 ms 10760 KB Output is correct
93 Correct 1280 ms 10928 KB Output is correct
94 Correct 1446 ms 13996 KB Output is correct
95 Correct 1395 ms 13724 KB Output is correct
96 Correct 1583 ms 14028 KB Output is correct
97 Correct 729 ms 15520 KB Output is correct
98 Correct 908 ms 14292 KB Output is correct
99 Correct 1469 ms 16112 KB Output is correct
100 Correct 1460 ms 16028 KB Output is correct
101 Correct 1503 ms 16244 KB Output is correct
102 Correct 1507 ms 15964 KB Output is correct
103 Correct 1633 ms 15040 KB Output is correct
104 Correct 1597 ms 14616 KB Output is correct
105 Correct 1255 ms 14236 KB Output is correct
106 Correct 1072 ms 13580 KB Output is correct
107 Correct 968 ms 14960 KB Output is correct
108 Correct 1589 ms 15688 KB Output is correct
109 Correct 1304 ms 13040 KB Output is correct