oj.uz

Submission #317498

# Submission time Handle Problem Language Result Execution time Memory
317498 2020-10-29T20:57:53 Z Plasmatic Bridges (APIO19_bridges) C++11
100 / 100
 2769 ms 13560 KB 
// ./apio-19-p2-bridges.yml
#include "bits/stdc++.h"
using namespace std;

// Defines
#define fs first
#define sn second
#define pb push_back
#define eb emplace_back
#define mpr make_pair
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
// Basic type definitions
using ll = long long; using ull = unsigned long long; using ld = long double;
using pii = pair<int, int>; using pll = pair<long long, long long>;
// PBDS order statistic tree
#include <ext/pb_ds/assoc_container.hpp> // Common file 
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; 
template <typename T, class comp = less<T>> using os_tree = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>;
template <typename K, typename V, class comp = less<K>> using treemap = tree<K, V, comp, rb_tree_tag, tree_order_statistics_node_update>;
// HashSet
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
const ll RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash { ll operator()(ll x) const { return x ^ RANDOM; } };
template <typename T, class Hash> using hashset = gp_hash_table<T, null_type, Hash>;
template <typename K, typename V, class Hash> using hashmap = gp_hash_table<K, V, Hash>;
// More utilities
int SZ(string &v) { return v.length(); }
template <typename C> int SZ(C &v) { return v.size(); }
template <typename C> void UNIQUE(vector<C> &v) { sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); }
template <typename T, typename U> void maxa(T &a, U b) { a = max(a, b); }
template <typename T, typename U> void mina(T &a, U b) { a = min(a, b); }
const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f;

struct query {
    int a, b, i;
    bool operator<(const query &o) const {
        return b > o.b;
    }
};
struct edge {
    int a, b, c, i, qo;
    bool operator<(const edge &o) const {
        return c < o.c;
    }
};
bool cmpi(const edge a, const edge b) {
    return a.qo > b.qo;
}
ostream& operator<<(ostream& out, const query o) {
    out << "(a=" << o.a << ", b=" << o.b << ", i=" << o.i << ")";
    return out;
}
ostream& operator<<(ostream& out, const edge o) {
    out << "(a=" << o.a << ", b=" << o.b << ", c=" << o.c << ", i=" << o.i << ", qo=" << o.qo << ")";
    return out;
}

struct gedge {
    int c, i;
    bool operator<(const gedge &o) const {
        return c == o.c ? i < o.i : c > o.c;
    }
};

const int MN = 5e4 + 1, MQ = 1e5 + 1, BSZ = 2*317;
// const int MN = 5e4 + 1, MQ = 1e5 + 1, BSZ = 4;
int N, M, Q;
set<gedge> edges;

struct DSU {
    int dsu[MN], sz[MN];
    void init(int N) {
        iota(dsu, dsu + N + 1, 0);
        fill(sz, sz + N + 1, 1);
    }
    int rt(int x) { return dsu[x] == x ? x : dsu[x] = rt(dsu[x]); }
    void merge(int x, int y) { // x -> y
        x = rt(x); y = rt(y);
        if (x == y) return;
        if (sz[y] > sz[x]) swap(x, y);
        sz[x] += sz[y];
        dsu[y] = x;
    }
    int getsz(int x) { return sz[rt(x)]; }
    bool same(int x, int y) { return rt(x) == rt(y); }
};

int W[MQ], A[MQ], B[MQ], ans[MQ];
bool rem[MQ];
DSU dsu;

// per query
bool cuse[MQ], vis[MN];
vector<int> found, tmpg[MN];

int stk[MN], spt = 0;
int dfs(int c) {
    int res = 0;
    stk[spt++] = c;
    vis[c] = true;
    while (spt) {
        int c = stk[--spt];
        res += dsu.sz[c];
        // cout<<"[dfs]: "; cout<<"c="<<(c)<<", "; cout<<"dsu.sz[c]="<<(dsu.sz[c])<<", "; cout << endl; // db l:dfs,c,dsu.sz[c]
        found.pb(c);
        for (int to : tmpg[c]) {
            if (!vis[to]) {
                vis[to] = true;
                stk[spt++] = to;
            }
        }
    }
    return res;
}

// for block
vector<query> qs;
vector<edge> uedges;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> (N) >> (M);
    for (auto i = 1; i <= M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        edges.insert({c, i});
        W[i] = c; A[i] = a; B[i] = b;
    }

    cin >> (Q);
    for (auto i = 0; i < Q; i += BSZ) {
        // collect queries
        for (auto j = i; j < min(Q, i + BSZ); j++) {
            int t, a, b;
            cin >> t >> a >> b;

            if (t == 1) {
                uedges.pb({A[a], B[a], b, a, j});
                if (!rem[a] && b < W[a]) {
                    uedges.pb({A[a], B[a], W[a], a, -INF});
                    rem[a] = true;
                }
            }
            else if (t == 2) 
                qs.pb({a, b, j});
        }
        sort(all(qs));
        sort(all(uedges), cmpi);

        // cout << "qs=["; for (auto __x:qs)cout<<__x<<", "; cout<<"], "; cout << endl; // db I:qs
        // cout << "uedges=["; for (auto __x:uedges)cout<<__x<<", "; cout<<"], "; cout << endl; // db I:uedges

        // solve queries
        dsu.init(N);
        auto ptr = edges.begin();
        for (auto &q : qs) {
            while (ptr != edges.end() && (rem[ptr->i] || ptr->c >= q.b)) {
                if (!rem[ptr->i])
                    dsu.merge(A[ptr->i], B[ptr->i]);
                ptr++;
            }

            // cout<<"[q]: "; cout<<"q="<<(q)<<", "; cout << endl; // db l:q,q
            // build graph man
            for (auto &e : uedges) {
                if (!cuse[e.i] && e.qo < q.i) {
                    cuse[e.i] = true;
                    if (e.c >= q.b) {
                        // cout<<"[use]: "; cout<<"e="<<(e)<<", "; cout << endl; // db l:use,e
                        int a = dsu.rt(e.a), b = dsu.rt(e.b);
                        if (a != b) {
                            tmpg[a].pb(b);
                            tmpg[b].pb(a);
                        }
                    }
                }
            }

            // bruh
            int cans = dfs(dsu.rt(q.a));
            ans[q.i] = cans;

            // cleanup per query
            for (auto &e : uedges) {
                if (cuse[e.i]) {
                    cuse[e.i] = false;
                    tmpg[dsu.rt(e.a)].clear();
                    tmpg[dsu.rt(e.b)].clear();
                }
            }
            for (auto &x : found)
                vis[x] = false;
            found.clear();
        }

        // undo and reset DS
        for (auto it = uedges.rbegin(); it != uedges.rend(); it++) {
            auto &e = *it;
            if (W[e.i] != e.c) {
                edges.erase(edges.find({W[e.i], e.i}));
                W[e.i] = e.c;
                edges.insert({W[e.i], e.i});
            }
            rem[e.i] = false;
        }

        qs.clear();
        uedges.clear();
    }

    for (auto i = 0; i < Q; i++)
        if (ans[i])
            cout << (ans[i]) << '\n';


    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 34 ms 1920 KB Output is correct
4 Correct 5 ms 1792 KB Output is correct
5 Correct 24 ms 1792 KB Output is correct
6 Correct 18 ms 1792 KB Output is correct
7 Correct 24 ms 1664 KB Output is correct
8 Correct 27 ms 1792 KB Output is correct
9 Correct 25 ms 1664 KB Output is correct
10 Correct 29 ms 1920 KB Output is correct
11 Correct 26 ms 1792 KB Output is correct
12 Correct 27 ms 1792 KB Output is correct
13 Correct 33 ms 1792 KB Output is correct
14 Correct 31 ms 1792 KB Output is correct
15 Correct 28 ms 1792 KB Output is correct
16 Correct 24 ms 1792 KB Output is correct
17 Correct 26 ms 1664 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1459 ms 9704 KB Output is correct
2 Correct 1539 ms 9712 KB Output is correct
3 Correct 1398 ms 9672 KB Output is correct
4 Correct 1343 ms 9768 KB Output is correct
5 Correct 1382 ms 10064 KB Output is correct
6 Correct 1525 ms 8468 KB Output is correct
7 Correct 1555 ms 8568 KB Output is correct
8 Correct 1520 ms 8668 KB Output is correct
9 Correct 40 ms 3576 KB Output is correct
10 Correct 765 ms 8312 KB Output is correct
11 Correct 845 ms 8376 KB Output is correct
12 Correct 892 ms 8696 KB Output is correct
13 Correct 1038 ms 8700 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1047 ms 7672 KB Output is correct
2 Correct 695 ms 4612 KB Output is correct
3 Correct 1068 ms 7536 KB Output is correct
4 Correct 1046 ms 7628 KB Output is correct
5 Correct 39 ms 3576 KB Output is correct
6 Correct 1072 ms 7596 KB Output is correct
7 Correct 963 ms 7544 KB Output is correct
8 Correct 897 ms 7796 KB Output is correct
9 Correct 617 ms 7224 KB Output is correct
10 Correct 594 ms 7288 KB Output is correct
11 Correct 736 ms 7544 KB Output is correct
12 Correct 695 ms 7544 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1884 ms 12552 KB Output is correct
2 Correct 41 ms 3516 KB Output is correct
3 Correct 196 ms 9336 KB Output is correct
4 Correct 80 ms 9464 KB Output is correct
5 Correct 964 ms 11160 KB Output is correct
6 Correct 1846 ms 12620 KB Output is correct
7 Correct 969 ms 11024 KB Output is correct
8 Correct 764 ms 8196 KB Output is correct
9 Correct 760 ms 8576 KB Output is correct
10 Correct 765 ms 8216 KB Output is correct
11 Correct 1404 ms 10424 KB Output is correct
12 Correct 1375 ms 10488 KB Output is correct
13 Correct 1385 ms 10372 KB Output is correct
14 Correct 746 ms 11128 KB Output is correct
15 Correct 925 ms 11200 KB Output is correct
16 Correct 2115 ms 12388 KB Output is correct
17 Correct 1987 ms 12600 KB Output is correct
18 Correct 2032 ms 12600 KB Output is correct
19 Correct 2058 ms 12596 KB Output is correct
20 Correct 1580 ms 11148 KB Output is correct
21 Correct 1554 ms 11064 KB Output is correct
22 Correct 1938 ms 12136 KB Output is correct
23 Correct 1195 ms 9868 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1459 ms 9704 KB Output is correct
2 Correct 1539 ms 9712 KB Output is correct
3 Correct 1398 ms 9672 KB Output is correct
4 Correct 1343 ms 9768 KB Output is correct
5 Correct 1382 ms 10064 KB Output is correct
6 Correct 1525 ms 8468 KB Output is correct
7 Correct 1555 ms 8568 KB Output is correct
8 Correct 1520 ms 8668 KB Output is correct
9 Correct 40 ms 3576 KB Output is correct
10 Correct 765 ms 8312 KB Output is correct
11 Correct 845 ms 8376 KB Output is correct
12 Correct 892 ms 8696 KB Output is correct
13 Correct 1038 ms 8700 KB Output is correct
14 Correct 1047 ms 7672 KB Output is correct
15 Correct 695 ms 4612 KB Output is correct
16 Correct 1068 ms 7536 KB Output is correct
17 Correct 1046 ms 7628 KB Output is correct
18 Correct 39 ms 3576 KB Output is correct
19 Correct 1072 ms 7596 KB Output is correct
20 Correct 963 ms 7544 KB Output is correct
21 Correct 897 ms 7796 KB Output is correct
22 Correct 617 ms 7224 KB Output is correct
23 Correct 594 ms 7288 KB Output is correct
24 Correct 736 ms 7544 KB Output is correct
25 Correct 695 ms 7544 KB Output is correct
26 Correct 1519 ms 9740 KB Output is correct
27 Correct 1632 ms 9564 KB Output is correct
28 Correct 1527 ms 9752 KB Output is correct
29 Correct 1267 ms 9464 KB Output is correct
30 Correct 1667 ms 9464 KB Output is correct
31 Correct 1707 ms 9464 KB Output is correct
32 Correct 1725 ms 9428 KB Output is correct
33 Correct 1717 ms 9828 KB Output is correct
34 Correct 1598 ms 9780 KB Output is correct
35 Correct 1649 ms 9592 KB Output is correct
36 Correct 1301 ms 9752 KB Output is correct
37 Correct 1472 ms 9464 KB Output is correct
38 Correct 1440 ms 9600 KB Output is correct
39 Correct 961 ms 8964 KB Output is correct
40 Correct 960 ms 9052 KB Output is correct
41 Correct 966 ms 9020 KB Output is correct
42 Correct 1088 ms 9592 KB Output is correct
43 Correct 1034 ms 9600 KB Output is correct
44 Correct 1044 ms 9592 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 34 ms 1920 KB Output is correct
4 Correct 5 ms 1792 KB Output is correct
5 Correct 24 ms 1792 KB Output is correct
6 Correct 18 ms 1792 KB Output is correct
7 Correct 24 ms 1664 KB Output is correct
8 Correct 27 ms 1792 KB Output is correct
9 Correct 25 ms 1664 KB Output is correct
10 Correct 29 ms 1920 KB Output is correct
11 Correct 26 ms 1792 KB Output is correct
12 Correct 27 ms 1792 KB Output is correct
13 Correct 33 ms 1792 KB Output is correct
14 Correct 31 ms 1792 KB Output is correct
15 Correct 28 ms 1792 KB Output is correct
16 Correct 24 ms 1792 KB Output is correct
17 Correct 26 ms 1664 KB Output is correct
18 Correct 1459 ms 9704 KB Output is correct
19 Correct 1539 ms 9712 KB Output is correct
20 Correct 1398 ms 9672 KB Output is correct
21 Correct 1343 ms 9768 KB Output is correct
22 Correct 1382 ms 10064 KB Output is correct
23 Correct 1525 ms 8468 KB Output is correct
24 Correct 1555 ms 8568 KB Output is correct
25 Correct 1520 ms 8668 KB Output is correct
26 Correct 40 ms 3576 KB Output is correct
27 Correct 765 ms 8312 KB Output is correct
28 Correct 845 ms 8376 KB Output is correct
29 Correct 892 ms 8696 KB Output is correct
30 Correct 1038 ms 8700 KB Output is correct
31 Correct 1047 ms 7672 KB Output is correct
32 Correct 695 ms 4612 KB Output is correct
33 Correct 1068 ms 7536 KB Output is correct
34 Correct 1046 ms 7628 KB Output is correct
35 Correct 39 ms 3576 KB Output is correct
36 Correct 1072 ms 7596 KB Output is correct
37 Correct 963 ms 7544 KB Output is correct
38 Correct 897 ms 7796 KB Output is correct
39 Correct 617 ms 7224 KB Output is correct
40 Correct 594 ms 7288 KB Output is correct
41 Correct 736 ms 7544 KB Output is correct
42 Correct 695 ms 7544 KB Output is correct
43 Correct 1884 ms 12552 KB Output is correct
44 Correct 41 ms 3516 KB Output is correct
45 Correct 196 ms 9336 KB Output is correct
46 Correct 80 ms 9464 KB Output is correct
47 Correct 964 ms 11160 KB Output is correct
48 Correct 1846 ms 12620 KB Output is correct
49 Correct 969 ms 11024 KB Output is correct
50 Correct 764 ms 8196 KB Output is correct
51 Correct 760 ms 8576 KB Output is correct
52 Correct 765 ms 8216 KB Output is correct
53 Correct 1404 ms 10424 KB Output is correct
54 Correct 1375 ms 10488 KB Output is correct
55 Correct 1385 ms 10372 KB Output is correct
56 Correct 746 ms 11128 KB Output is correct
57 Correct 925 ms 11200 KB Output is correct
58 Correct 2115 ms 12388 KB Output is correct
59 Correct 1987 ms 12600 KB Output is correct
60 Correct 2032 ms 12600 KB Output is correct
61 Correct 2058 ms 12596 KB Output is correct
62 Correct 1580 ms 11148 KB Output is correct
63 Correct 1554 ms 11064 KB Output is correct
64 Correct 1938 ms 12136 KB Output is correct
65 Correct 1195 ms 9868 KB Output is correct
66 Correct 1519 ms 9740 KB Output is correct
67 Correct 1632 ms 9564 KB Output is correct
68 Correct 1527 ms 9752 KB Output is correct
69 Correct 1267 ms 9464 KB Output is correct
70 Correct 1667 ms 9464 KB Output is correct
71 Correct 1707 ms 9464 KB Output is correct
72 Correct 1725 ms 9428 KB Output is correct
73 Correct 1717 ms 9828 KB Output is correct
74 Correct 1598 ms 9780 KB Output is correct
75 Correct 1649 ms 9592 KB Output is correct
76 Correct 1301 ms 9752 KB Output is correct
77 Correct 1472 ms 9464 KB Output is correct
78 Correct 1440 ms 9600 KB Output is correct
79 Correct 961 ms 8964 KB Output is correct
80 Correct 960 ms 9052 KB Output is correct
81 Correct 966 ms 9020 KB Output is correct
82 Correct 1088 ms 9592 KB Output is correct
83 Correct 1034 ms 9600 KB Output is correct
84 Correct 1044 ms 9592 KB Output is correct
85 Correct 2682 ms 13528 KB Output is correct
86 Correct 216 ms 9592 KB Output is correct
87 Correct 103 ms 9720 KB Output is correct
88 Correct 1524 ms 11704 KB Output is correct
89 Correct 2599 ms 13432 KB Output is correct
90 Correct 1396 ms 11384 KB Output is correct
91 Correct 1516 ms 9464 KB Output is correct
92 Correct 1534 ms 9592 KB Output is correct
93 Correct 1676 ms 8696 KB Output is correct
94 Correct 1925 ms 11384 KB Output is correct
95 Correct 2131 ms 11516 KB Output is correct
96 Correct 1765 ms 10360 KB Output is correct
97 Correct 1158 ms 11256 KB Output is correct
98 Correct 1300 ms 11384 KB Output is correct
99 Correct 2656 ms 13332 KB Output is correct
100 Correct 2654 ms 13304 KB Output is correct
101 Correct 2769 ms 13560 KB Output is correct
102 Correct 2757 ms 13432 KB Output is correct
103 Correct 1980 ms 11000 KB Output is correct
104 Correct 2013 ms 10872 KB Output is correct
105 Correct 1839 ms 10744 KB Output is correct
106 Correct 1614 ms 10488 KB Output is correct
107 Correct 1678 ms 11256 KB Output is correct
108 Correct 2367 ms 12100 KB Output is correct
109 Correct 1635 ms 9608 KB Output is correct