oj.uz

Submission #558974

# Submission time Handle Problem Language Result Execution time Memory
558974 2022-05-09T05:08:42 Z nutella Bridges (APIO19_bridges) C++17
100 / 100
 2249 ms 14376 KB 
//#define _GLIBCXX_DEBUG

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//
//using namespace __gnu_pbds;
//
//template<typename T>
//using ordered_set = tree<T, null_type, less < T>, rb_tree_tag, tree_order_statistics_node_update>;

template<typename T>
using normal_queue = priority_queue<T, vector<T>, greater<>>;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

#define trace(x) cout << #x << ": " << (x) << endl;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define uniq(x) x.resize(unique(all(x)) - begin(x))
#define sz(s) ((int) size(s))
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define int128 __int128
#define pb push_back
#define popb pop_back
#define eb emplace_back
#define fi first
#define se second
#define itn int

typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;


template<typename T>
bool ckmn(T &x, T y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template<typename T>
bool ckmx(T &x, T y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

int bit(int x, int b) {
    return (x >> b) & 1;
}

int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }


const ll infL = 3e18;
const int infI = 1000000000 + 7;
const int infM = 0x3f3f3f3f; //a little bigger than 1e9
const ll infML = 0x3f3f3f3f3f3f3f3fLL; //4.5e18
const int N = 50002, M = 100001, B = 500, Q = 100001;
const int mod = 998244353;
const ld eps = 1e-9;

int p[N], sz[N];

void init(int n) {
    fill(sz, sz + n, 1);
    iota(p, p + n, 0);
}

int get(int a) {
    return (a == p[a] ? a : p[a] = get(p[a]));
}

void mrg(int a, int b) {
    a = get(a), b = get(b);
    if (a == b) return;
    if (sz[a] < sz[b]) swap(a, b);
    p[b] = a;
    sz[a] += sz[b];
}

bool used[N], nww[M];
vector<pair<int, int>> g[N];
int now = 0, wnow, U[M], V[M], W[M], prv[M + Q], nxt[M + Q], tp[Q], x[Q], y[Q], ans[Q], prvv[Q];

vector<int> vis;

void dfs(int v) {
    vis.push_back(v);
    used[v] = true;
    now += sz[v];
    for (auto [to, ww]: g[v]) {
        if (!used[to] && ww >= wnow) {
            dfs(to);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        cin >> U[i] >> V[i] >> W[i];
        --U[i], --V[i];
        prv[i] = i;
    }
    int q;
    cin >> q;
    vector<array<int, 3>> qu(q + m); //w, type, i
    for (int i = 0; i < q; ++i) {
        cin >> tp[i] >> x[i] >> y[i];
        --x[i];
        qu[i + m] = {-y[i], tp[i], i + m};
        if (tp[i] == 1) {
            nxt[prv[x[i]]] = i;
            prvv[i] = prv[x[i]];
            prv[x[i]] = i + m;
        }
    }
    for (int i = 0; i < m; ++i) {
        nxt[prv[i]] = infI;
        qu[i] = {-W[i], 1, i};
    }
    sort(all(qu));
    for (int i = 0; i < q; i += B) {
        int r = min(i + B, q);
        init(n);
        for (auto t: qu) {
            if (t[1] == 1 && nxt[t[2]] >= r) {
                if (t[2] >= m) {
                    int id = t[2] - m;
                    if (id < i) {
                        mrg(U[x[id]], V[x[id]]);
                    }
                } else {
                    mrg(U[t[2]], V[t[2]]);
                }
            } else if (t[1] == 2) {
                int j = t[2] - m;
                if (j < i || j >= r) continue;
                for (int k = j; k >= i; --k) {
                    if (tp[k] == 1 && !nww[x[k]]) {
                        nww[x[k]] = true;
                        int a = get(U[x[k]]), b = get(V[x[k]]);
                        g[a].emplace_back(b, y[k]), g[b].emplace_back(a, y[k]);
                    }
                }
                for (int k = j; k < r; ++k) {
                    if (tp[k] == 1 && !nww[x[k]]) {
                        int z = prvv[k];
                        int w;
                        if (z >= m) {
                            w = y[z - m];
                        } else {
                            w = W[z];
                        }
                        nww[x[k]] = true;
                        int a = get(U[x[k]]), b = get(V[x[k]]);
                        g[a].emplace_back(b, w), g[b].emplace_back(a, w);
                    }
                }
                wnow = y[j];
                dfs(get(x[j]));
                ans[j] = now;
                now = 0;
                for (int z: vis) {
                    used[z] = false;
                }
                vis.clear();
                for (int k = r - 1; k >= i; --k) {
                    if (tp[k] == 1 && nww[x[k]]) {
                        nww[x[k]] = false;
                        int a = get(U[x[k]]), b = get(V[x[k]]);
                        g[a].clear(), g[b].clear();
                    }
                }
            }
        }
    }
    for (int i = 0; i < q; ++i) {
        if (tp[i] == 2) {
            cout << ans[i] << '\n';
        }
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 45 ms 2120 KB Output is correct
4 Correct 12 ms 1924 KB Output is correct
5 Correct 30 ms 2040 KB Output is correct
6 Correct 28 ms 2068 KB Output is correct
7 Correct 26 ms 1996 KB Output is correct
8 Correct 26 ms 2064 KB Output is correct
9 Correct 28 ms 1984 KB Output is correct
10 Correct 27 ms 2040 KB Output is correct
11 Correct 25 ms 2060 KB Output is correct
12 Correct 26 ms 2004 KB Output is correct
13 Correct 33 ms 2052 KB Output is correct
14 Correct 30 ms 2004 KB Output is correct
15 Correct 30 ms 2048 KB Output is correct
16 Correct 24 ms 1980 KB Output is correct
17 Correct 26 ms 1976 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1696 ms 11108 KB Output is correct
2 Correct 1677 ms 10980 KB Output is correct
3 Correct 1700 ms 11032 KB Output is correct
4 Correct 1700 ms 11108 KB Output is correct
5 Correct 1649 ms 10968 KB Output is correct
6 Correct 1713 ms 10232 KB Output is correct
7 Correct 1599 ms 10200 KB Output is correct
8 Correct 1566 ms 10220 KB Output is correct
9 Correct 171 ms 5784 KB Output is correct
10 Correct 1295 ms 10052 KB Output is correct
11 Correct 1237 ms 10212 KB Output is correct
12 Correct 906 ms 10004 KB Output is correct
13 Correct 1104 ms 10388 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1429 ms 10112 KB Output is correct
2 Correct 1006 ms 7392 KB Output is correct
3 Correct 1429 ms 9748 KB Output is correct
4 Correct 1463 ms 9932 KB Output is correct
5 Correct 179 ms 5776 KB Output is correct
6 Correct 1400 ms 9772 KB Output is correct
7 Correct 1417 ms 9812 KB Output is correct
8 Correct 1368 ms 9788 KB Output is correct
9 Correct 759 ms 9516 KB Output is correct
10 Correct 766 ms 9416 KB Output is correct
11 Correct 940 ms 9748 KB Output is correct
12 Correct 931 ms 9892 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1095 ms 11320 KB Output is correct
2 Correct 175 ms 5796 KB Output is correct
3 Correct 88 ms 6744 KB Output is correct
4 Correct 66 ms 6932 KB Output is correct
5 Correct 606 ms 10508 KB Output is correct
6 Correct 1084 ms 12132 KB Output is correct
7 Correct 621 ms 10832 KB Output is correct
8 Correct 743 ms 9116 KB Output is correct
9 Correct 733 ms 9344 KB Output is correct
10 Correct 643 ms 9048 KB Output is correct
11 Correct 1129 ms 10432 KB Output is correct
12 Correct 1022 ms 10608 KB Output is correct
13 Correct 890 ms 10524 KB Output is correct
14 Correct 550 ms 10672 KB Output is correct
15 Correct 587 ms 10532 KB Output is correct
16 Correct 1192 ms 11972 KB Output is correct
17 Correct 1148 ms 11992 KB Output is correct
18 Correct 1168 ms 12044 KB Output is correct
19 Correct 1168 ms 12020 KB Output is correct
20 Correct 901 ms 10940 KB Output is correct
21 Correct 908 ms 10940 KB Output is correct
22 Correct 1006 ms 11720 KB Output is correct
23 Correct 718 ms 9832 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1696 ms 11108 KB Output is correct
2 Correct 1677 ms 10980 KB Output is correct
3 Correct 1700 ms 11032 KB Output is correct
4 Correct 1700 ms 11108 KB Output is correct
5 Correct 1649 ms 10968 KB Output is correct
6 Correct 1713 ms 10232 KB Output is correct
7 Correct 1599 ms 10200 KB Output is correct
8 Correct 1566 ms 10220 KB Output is correct
9 Correct 171 ms 5784 KB Output is correct
10 Correct 1295 ms 10052 KB Output is correct
11 Correct 1237 ms 10212 KB Output is correct
12 Correct 906 ms 10004 KB Output is correct
13 Correct 1104 ms 10388 KB Output is correct
14 Correct 1429 ms 10112 KB Output is correct
15 Correct 1006 ms 7392 KB Output is correct
16 Correct 1429 ms 9748 KB Output is correct
17 Correct 1463 ms 9932 KB Output is correct
18 Correct 179 ms 5776 KB Output is correct
19 Correct 1400 ms 9772 KB Output is correct
20 Correct 1417 ms 9812 KB Output is correct
21 Correct 1368 ms 9788 KB Output is correct
22 Correct 759 ms 9516 KB Output is correct
23 Correct 766 ms 9416 KB Output is correct
24 Correct 940 ms 9748 KB Output is correct
25 Correct 931 ms 9892 KB Output is correct
26 Correct 1654 ms 11264 KB Output is correct
27 Correct 1758 ms 11320 KB Output is correct
28 Correct 1770 ms 11336 KB Output is correct
29 Correct 1613 ms 11548 KB Output is correct
30 Correct 1861 ms 11244 KB Output is correct
31 Correct 1798 ms 11308 KB Output is correct
32 Correct 1880 ms 11376 KB Output is correct
33 Correct 1823 ms 11640 KB Output is correct
34 Correct 1793 ms 11436 KB Output is correct
35 Correct 1870 ms 11376 KB Output is correct
36 Correct 1771 ms 11244 KB Output is correct
37 Correct 1668 ms 11216 KB Output is correct
38 Correct 1661 ms 11404 KB Output is correct
39 Correct 1010 ms 10824 KB Output is correct
40 Correct 1002 ms 10724 KB Output is correct
41 Correct 1006 ms 10728 KB Output is correct
42 Correct 1235 ms 11356 KB Output is correct
43 Correct 1241 ms 11384 KB Output is correct
44 Correct 1275 ms 11476 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 45 ms 2120 KB Output is correct
4 Correct 12 ms 1924 KB Output is correct
5 Correct 30 ms 2040 KB Output is correct
6 Correct 28 ms 2068 KB Output is correct
7 Correct 26 ms 1996 KB Output is correct
8 Correct 26 ms 2064 KB Output is correct
9 Correct 28 ms 1984 KB Output is correct
10 Correct 27 ms 2040 KB Output is correct
11 Correct 25 ms 2060 KB Output is correct
12 Correct 26 ms 2004 KB Output is correct
13 Correct 33 ms 2052 KB Output is correct
14 Correct 30 ms 2004 KB Output is correct
15 Correct 30 ms 2048 KB Output is correct
16 Correct 24 ms 1980 KB Output is correct
17 Correct 26 ms 1976 KB Output is correct
18 Correct 1696 ms 11108 KB Output is correct
19 Correct 1677 ms 10980 KB Output is correct
20 Correct 1700 ms 11032 KB Output is correct
21 Correct 1700 ms 11108 KB Output is correct
22 Correct 1649 ms 10968 KB Output is correct
23 Correct 1713 ms 10232 KB Output is correct
24 Correct 1599 ms 10200 KB Output is correct
25 Correct 1566 ms 10220 KB Output is correct
26 Correct 171 ms 5784 KB Output is correct
27 Correct 1295 ms 10052 KB Output is correct
28 Correct 1237 ms 10212 KB Output is correct
29 Correct 906 ms 10004 KB Output is correct
30 Correct 1104 ms 10388 KB Output is correct
31 Correct 1429 ms 10112 KB Output is correct
32 Correct 1006 ms 7392 KB Output is correct
33 Correct 1429 ms 9748 KB Output is correct
34 Correct 1463 ms 9932 KB Output is correct
35 Correct 179 ms 5776 KB Output is correct
36 Correct 1400 ms 9772 KB Output is correct
37 Correct 1417 ms 9812 KB Output is correct
38 Correct 1368 ms 9788 KB Output is correct
39 Correct 759 ms 9516 KB Output is correct
40 Correct 766 ms 9416 KB Output is correct
41 Correct 940 ms 9748 KB Output is correct
42 Correct 931 ms 9892 KB Output is correct
43 Correct 1095 ms 11320 KB Output is correct
44 Correct 175 ms 5796 KB Output is correct
45 Correct 88 ms 6744 KB Output is correct
46 Correct 66 ms 6932 KB Output is correct
47 Correct 606 ms 10508 KB Output is correct
48 Correct 1084 ms 12132 KB Output is correct
49 Correct 621 ms 10832 KB Output is correct
50 Correct 743 ms 9116 KB Output is correct
51 Correct 733 ms 9344 KB Output is correct
52 Correct 643 ms 9048 KB Output is correct
53 Correct 1129 ms 10432 KB Output is correct
54 Correct 1022 ms 10608 KB Output is correct
55 Correct 890 ms 10524 KB Output is correct
56 Correct 550 ms 10672 KB Output is correct
57 Correct 587 ms 10532 KB Output is correct
58 Correct 1192 ms 11972 KB Output is correct
59 Correct 1148 ms 11992 KB Output is correct
60 Correct 1168 ms 12044 KB Output is correct
61 Correct 1168 ms 12020 KB Output is correct
62 Correct 901 ms 10940 KB Output is correct
63 Correct 908 ms 10940 KB Output is correct
64 Correct 1006 ms 11720 KB Output is correct
65 Correct 718 ms 9832 KB Output is correct
66 Correct 1654 ms 11264 KB Output is correct
67 Correct 1758 ms 11320 KB Output is correct
68 Correct 1770 ms 11336 KB Output is correct
69 Correct 1613 ms 11548 KB Output is correct
70 Correct 1861 ms 11244 KB Output is correct
71 Correct 1798 ms 11308 KB Output is correct
72 Correct 1880 ms 11376 KB Output is correct
73 Correct 1823 ms 11640 KB Output is correct
74 Correct 1793 ms 11436 KB Output is correct
75 Correct 1870 ms 11376 KB Output is correct
76 Correct 1771 ms 11244 KB Output is correct
77 Correct 1668 ms 11216 KB Output is correct
78 Correct 1661 ms 11404 KB Output is correct
79 Correct 1010 ms 10824 KB Output is correct
80 Correct 1002 ms 10724 KB Output is correct
81 Correct 1006 ms 10728 KB Output is correct
82 Correct 1235 ms 11356 KB Output is correct
83 Correct 1241 ms 11384 KB Output is correct
84 Correct 1275 ms 11476 KB Output is correct
85 Correct 2147 ms 14260 KB Output is correct
86 Correct 130 ms 6980 KB Output is correct
87 Correct 112 ms 7100 KB Output is correct
88 Correct 1326 ms 12652 KB Output is correct
89 Correct 2100 ms 14236 KB Output is correct
90 Correct 1317 ms 12028 KB Output is correct
91 Correct 1887 ms 11216 KB Output is correct
92 Correct 1798 ms 11532 KB Output is correct
93 Correct 1701 ms 10708 KB Output is correct
94 Correct 2087 ms 13380 KB Output is correct
95 Correct 2151 ms 13092 KB Output is correct
96 Correct 1716 ms 12168 KB Output is correct
97 Correct 803 ms 11620 KB Output is correct
98 Correct 949 ms 12080 KB Output is correct
99 Correct 2194 ms 14284 KB Output is correct
100 Correct 2168 ms 14376 KB Output is correct
101 Correct 2231 ms 14156 KB Output is correct
102 Correct 2249 ms 14140 KB Output is correct
103 Correct 1703 ms 12004 KB Output is correct
104 Correct 1721 ms 12108 KB Output is correct
105 Correct 1513 ms 12376 KB Output is correct
106 Correct 1306 ms 12656 KB Output is correct
107 Correct 1183 ms 11864 KB Output is correct
108 Correct 1887 ms 12752 KB Output is correct
109 Correct 1370 ms 10736 KB Output is correct