oj.uz

Submission #743920

# Submission time Handle Problem Language Result Execution time Memory
743920 2023-05-18T06:10:59 Z PixelCat Bridges (APIO19_bridges) C++14
100 / 100
 2652 ms 13196 KB 
/*     code by PixelCat     */
/*         meow owo         */

#include <bits/stdc++.h>
#define int LL  //__int128
#define double long double
using namespace std;
using LL = long long;
// using i128 = __int128_t;
using ull = unsigned long long;
using pii = pair<int, int>;

#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fors(i, a, b, s) for (int i = a; i <= b; i += s)
#define Forr(i, a, b) for (int i = a; i >= b; i--)
#define F first
#define S second

#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair

#define MOD (int)(998244353)
// #define MOD (int)((LL)1'000'000'007)
#define INF (int)(4e18)
#define EPS (1e-6)

namespace PixelCat {

#ifdef NYAOWO
#include "/home/pixelcat/yodayo/meow/library/debug.hpp"
inline void USACO(const string &s) {
    cerr << "USACO: " << s << "\n";
}

#else
#define debug(...)
inline void timer() {}
inline void USACO(const string &s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

#endif

inline void NYA() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}
inline int gcd(int a, int b) {
    return __gcd(a, b);
}
inline int lcm(int a, int b) {
    return a / gcd(a, b) * b;
}
int fpow(int b, int p, const int &mod = MOD) {
    int ans = 1;
    for (; p; p >>= 1, b = b * b % mod)
        if (p & 1) ans = ans * b % mod;
    return ans;
}
template <typename T>
inline void chmin(T &_a, const T &_b) {
    if (_b < _a) _a = _b;
}
template <typename T>
inline void chmax(T &_a, const T &_b) {
    if (_b > _a) _a = _b;
}
mt19937_64 rng(
    chrono::steady_clock::now().time_since_epoch().count());

} // namespace PixelCat
using namespace PixelCat;

const int MAXN = 50010;
const int MAXM = 100010;
const int MAXQ = 100010;
const int BLK = 600;

struct DSU {
    int p[MAXN];
    int siz[MAXN];
    vector<pii> op;
    void init() {
        memset(p, 0, sizeof(p));
        fill(siz, siz + MAXN, 1);
        op.clear();
    }
    int find(int n) {
        if(!p[n]) return n;
        return find(p[n]);
    }
    void uni(int a, int b, bool rec = false) {
        a = find(a); b = find(b);
        if(siz[a] < siz[b]) swap(a, b);
        if(rec) op.eb(a, b);
        if(a == b) return;
        p[b] = a;
        siz[a] += siz[b];
    }
    void undo() {
        int a, b;
        tie(a, b) = op.back();
        op.pop_back();
        if(a == b) return;
        siz[a] -= siz[b];
        p[b] = 0;
    }
    void undo_all() {
        while(sz(op)) undo();
    }
    int size(int n) {
        return siz[find(n)];
    }
} dsu;

struct Query {
    int op, x, y;
    // op: 0 for update, 1~q for queries
} qry[MAXQ];
int ans[MAXQ];

pii ed[MAXM];
int w[MAXM];

void solve(int m, int l, int r) {
    // identify bad edges
    // sort good edges
    // sort queries
    vector<pair<pii, int>> e;
    For(i, 1, m) e.eb(ed[i], w[i]);
    vector<int> bad;
    vector<pii> vq;  // {index, weight}
    For(i, l, r) {
        if(!qry[i].op) {
            int eid = qry[i].x;
            e[eid - 1].S = -1;
            bad.eb(eid);
        } else {
            vq.eb(i, qry[i].y);
        }
    }
    sort(all(bad)); bad.erase(unique(all(bad)), bad.end());
    sort(all(e), [&](pair<pii, int> &a, pair<pii, int> &b) {
        return a.S < b.S;
    });
    sort(all(vq), [&](pii &a, pii &b) {
        return a.S < b.S;
    });

    dsu.init();

    // do queries while adding edges
    while(!vq.empty()) {
        int qid = vq.back().F;
        Query &q = qry[qid];
        vq.pop_back();

        // add good edges
        while(sz(e) && e.back().S >= q.y) {
            pii p = e.back().F;
            e.pop_back();
            dsu.uni(p.F, p.S);
        }

        // update bad edges & add to dsu
        For(i, l, qid) if(!qry[i].op) {
            swap(w[qry[i].x], qry[i].y);
        }
        for(int &eid:bad) if(w[eid] >= q.y) {
            dsu.uni(ed[eid].F, ed[eid].S, true);
        }

        // make query
        ans[qid] = dsu.size(q.x);

        // recover bad edges & undo dsu
        dsu.undo_all();
        Forr(i, qid, l) if(!qry[i].op) {
            swap(w[qry[i].x], qry[i].y);
        }
    }

    // actually make updates
    For(i, l, r) if(!qry[i].op) {
        Query &q = qry[i];
        w[q.x] = q.y;
    }
}

int32_t main() {
    NYA();
    // nyaacho >/////<
    int n, m; cin >> n >> m;
    For(i, 1, m) {
        cin >> ed[i].F >> ed[i].S >> w[i];
    }
    int q; cin >> q;
    For(i, 1, q) {
        auto &qr = qry[i];
        cin >> qr.op >> qr.x >> qr.y;
        qr.op--;
    }

    for(int i = 1; i <= q; i += BLK) {
        solve(m, i, min(i + BLK - 1, q));
    }
    For(i, 1, q) 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 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 23 ms 1688 KB Output is correct
4 Correct 9 ms 1620 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 13 ms 1560 KB Output is correct
7 Correct 14 ms 1492 KB Output is correct
8 Correct 15 ms 1620 KB Output is correct
9 Correct 14 ms 1492 KB Output is correct
10 Correct 15 ms 1620 KB Output is correct
11 Correct 15 ms 1620 KB Output is correct
12 Correct 16 ms 1604 KB Output is correct
13 Correct 19 ms 1620 KB Output is correct
14 Correct 17 ms 1560 KB Output is correct
15 Correct 17 ms 1620 KB Output is correct
16 Correct 15 ms 1492 KB Output is correct
17 Correct 15 ms 1496 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 8536 KB Output is correct
2 Correct 1294 ms 8448 KB Output is correct
3 Correct 1312 ms 8572 KB Output is correct
4 Correct 1299 ms 8564 KB Output is correct
5 Correct 1253 ms 8808 KB Output is correct
6 Correct 1539 ms 8392 KB Output is correct
7 Correct 1525 ms 8496 KB Output is correct
8 Correct 1545 ms 8520 KB Output is correct
9 Correct 83 ms 4612 KB Output is correct
10 Correct 873 ms 8400 KB Output is correct
11 Correct 867 ms 8496 KB Output is correct
12 Correct 1228 ms 8376 KB Output is correct
13 Correct 1146 ms 8480 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 6808 KB Output is correct
2 Correct 491 ms 5112 KB Output is correct
3 Correct 982 ms 6896 KB Output is correct
4 Correct 901 ms 6944 KB Output is correct
5 Correct 83 ms 4620 KB Output is correct
6 Correct 934 ms 6780 KB Output is correct
7 Correct 910 ms 6796 KB Output is correct
8 Correct 834 ms 7072 KB Output is correct
9 Correct 792 ms 6928 KB Output is correct
10 Correct 754 ms 6868 KB Output is correct
11 Correct 717 ms 6840 KB Output is correct
12 Correct 679 ms 6904 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2195 ms 12564 KB Output is correct
2 Correct 82 ms 4688 KB Output is correct
3 Correct 231 ms 9476 KB Output is correct
4 Correct 131 ms 9460 KB Output is correct
5 Correct 1413 ms 12456 KB Output is correct
6 Correct 2146 ms 12300 KB Output is correct
7 Correct 1388 ms 12336 KB Output is correct
8 Correct 1018 ms 8480 KB Output is correct
9 Correct 1000 ms 8624 KB Output is correct
10 Correct 1026 ms 8376 KB Output is correct
11 Correct 1656 ms 11324 KB Output is correct
12 Correct 1655 ms 11252 KB Output is correct
13 Correct 1698 ms 11336 KB Output is correct
14 Correct 1346 ms 12544 KB Output is correct
15 Correct 1389 ms 12420 KB Output is correct
16 Correct 2196 ms 12556 KB Output is correct
17 Correct 2212 ms 12696 KB Output is correct
18 Correct 2176 ms 12236 KB Output is correct
19 Correct 2162 ms 12568 KB Output is correct
20 Correct 1881 ms 11496 KB Output is correct
21 Correct 1968 ms 11580 KB Output is correct
22 Correct 2080 ms 12244 KB Output is correct
23 Correct 1348 ms 11528 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 8536 KB Output is correct
2 Correct 1294 ms 8448 KB Output is correct
3 Correct 1312 ms 8572 KB Output is correct
4 Correct 1299 ms 8564 KB Output is correct
5 Correct 1253 ms 8808 KB Output is correct
6 Correct 1539 ms 8392 KB Output is correct
7 Correct 1525 ms 8496 KB Output is correct
8 Correct 1545 ms 8520 KB Output is correct
9 Correct 83 ms 4612 KB Output is correct
10 Correct 873 ms 8400 KB Output is correct
11 Correct 867 ms 8496 KB Output is correct
12 Correct 1228 ms 8376 KB Output is correct
13 Correct 1146 ms 8480 KB Output is correct
14 Correct 884 ms 6808 KB Output is correct
15 Correct 491 ms 5112 KB Output is correct
16 Correct 982 ms 6896 KB Output is correct
17 Correct 901 ms 6944 KB Output is correct
18 Correct 83 ms 4620 KB Output is correct
19 Correct 934 ms 6780 KB Output is correct
20 Correct 910 ms 6796 KB Output is correct
21 Correct 834 ms 7072 KB Output is correct
22 Correct 792 ms 6928 KB Output is correct
23 Correct 754 ms 6868 KB Output is correct
24 Correct 717 ms 6840 KB Output is correct
25 Correct 679 ms 6904 KB Output is correct
26 Correct 1231 ms 8592 KB Output is correct
27 Correct 1478 ms 8768 KB Output is correct
28 Correct 1394 ms 8500 KB Output is correct
29 Correct 1202 ms 8672 KB Output is correct
30 Correct 1471 ms 8384 KB Output is correct
31 Correct 1448 ms 8600 KB Output is correct
32 Correct 1457 ms 8580 KB Output is correct
33 Correct 1389 ms 8392 KB Output is correct
34 Correct 1417 ms 8428 KB Output is correct
35 Correct 1489 ms 8384 KB Output is correct
36 Correct 1409 ms 8472 KB Output is correct
37 Correct 1306 ms 8700 KB Output is correct
38 Correct 1162 ms 8952 KB Output is correct
39 Correct 1133 ms 8680 KB Output is correct
40 Correct 1182 ms 8632 KB Output is correct
41 Correct 1234 ms 8644 KB Output is correct
42 Correct 1135 ms 8676 KB Output is correct
43 Correct 1183 ms 8664 KB Output is correct
44 Correct 1146 ms 8744 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 23 ms 1688 KB Output is correct
4 Correct 9 ms 1620 KB Output is correct
5 Correct 16 ms 1620 KB Output is correct
6 Correct 13 ms 1560 KB Output is correct
7 Correct 14 ms 1492 KB Output is correct
8 Correct 15 ms 1620 KB Output is correct
9 Correct 14 ms 1492 KB Output is correct
10 Correct 15 ms 1620 KB Output is correct
11 Correct 15 ms 1620 KB Output is correct
12 Correct 16 ms 1604 KB Output is correct
13 Correct 19 ms 1620 KB Output is correct
14 Correct 17 ms 1560 KB Output is correct
15 Correct 17 ms 1620 KB Output is correct
16 Correct 15 ms 1492 KB Output is correct
17 Correct 15 ms 1496 KB Output is correct
18 Correct 1297 ms 8536 KB Output is correct
19 Correct 1294 ms 8448 KB Output is correct
20 Correct 1312 ms 8572 KB Output is correct
21 Correct 1299 ms 8564 KB Output is correct
22 Correct 1253 ms 8808 KB Output is correct
23 Correct 1539 ms 8392 KB Output is correct
24 Correct 1525 ms 8496 KB Output is correct
25 Correct 1545 ms 8520 KB Output is correct
26 Correct 83 ms 4612 KB Output is correct
27 Correct 873 ms 8400 KB Output is correct
28 Correct 867 ms 8496 KB Output is correct
29 Correct 1228 ms 8376 KB Output is correct
30 Correct 1146 ms 8480 KB Output is correct
31 Correct 884 ms 6808 KB Output is correct
32 Correct 491 ms 5112 KB Output is correct
33 Correct 982 ms 6896 KB Output is correct
34 Correct 901 ms 6944 KB Output is correct
35 Correct 83 ms 4620 KB Output is correct
36 Correct 934 ms 6780 KB Output is correct
37 Correct 910 ms 6796 KB Output is correct
38 Correct 834 ms 7072 KB Output is correct
39 Correct 792 ms 6928 KB Output is correct
40 Correct 754 ms 6868 KB Output is correct
41 Correct 717 ms 6840 KB Output is correct
42 Correct 679 ms 6904 KB Output is correct
43 Correct 2195 ms 12564 KB Output is correct
44 Correct 82 ms 4688 KB Output is correct
45 Correct 231 ms 9476 KB Output is correct
46 Correct 131 ms 9460 KB Output is correct
47 Correct 1413 ms 12456 KB Output is correct
48 Correct 2146 ms 12300 KB Output is correct
49 Correct 1388 ms 12336 KB Output is correct
50 Correct 1018 ms 8480 KB Output is correct
51 Correct 1000 ms 8624 KB Output is correct
52 Correct 1026 ms 8376 KB Output is correct
53 Correct 1656 ms 11324 KB Output is correct
54 Correct 1655 ms 11252 KB Output is correct
55 Correct 1698 ms 11336 KB Output is correct
56 Correct 1346 ms 12544 KB Output is correct
57 Correct 1389 ms 12420 KB Output is correct
58 Correct 2196 ms 12556 KB Output is correct
59 Correct 2212 ms 12696 KB Output is correct
60 Correct 2176 ms 12236 KB Output is correct
61 Correct 2162 ms 12568 KB Output is correct
62 Correct 1881 ms 11496 KB Output is correct
63 Correct 1968 ms 11580 KB Output is correct
64 Correct 2080 ms 12244 KB Output is correct
65 Correct 1348 ms 11528 KB Output is correct
66 Correct 1231 ms 8592 KB Output is correct
67 Correct 1478 ms 8768 KB Output is correct
68 Correct 1394 ms 8500 KB Output is correct
69 Correct 1202 ms 8672 KB Output is correct
70 Correct 1471 ms 8384 KB Output is correct
71 Correct 1448 ms 8600 KB Output is correct
72 Correct 1457 ms 8580 KB Output is correct
73 Correct 1389 ms 8392 KB Output is correct
74 Correct 1417 ms 8428 KB Output is correct
75 Correct 1489 ms 8384 KB Output is correct
76 Correct 1409 ms 8472 KB Output is correct
77 Correct 1306 ms 8700 KB Output is correct
78 Correct 1162 ms 8952 KB Output is correct
79 Correct 1133 ms 8680 KB Output is correct
80 Correct 1182 ms 8632 KB Output is correct
81 Correct 1234 ms 8644 KB Output is correct
82 Correct 1135 ms 8676 KB Output is correct
83 Correct 1183 ms 8664 KB Output is correct
84 Correct 1146 ms 8744 KB Output is correct
85 Correct 2550 ms 13132 KB Output is correct
86 Correct 258 ms 10400 KB Output is correct
87 Correct 154 ms 10356 KB Output is correct
88 Correct 1624 ms 13088 KB Output is correct
89 Correct 2492 ms 13196 KB Output is correct
90 Correct 1672 ms 12912 KB Output is correct
91 Correct 1339 ms 9180 KB Output is correct
92 Correct 1315 ms 8908 KB Output is correct
93 Correct 1576 ms 8924 KB Output is correct
94 Correct 2049 ms 11744 KB Output is correct
95 Correct 2049 ms 11848 KB Output is correct
96 Correct 2113 ms 11724 KB Output is correct
97 Correct 1558 ms 12840 KB Output is correct
98 Correct 1484 ms 13044 KB Output is correct
99 Correct 2530 ms 12944 KB Output is correct
100 Correct 2517 ms 13004 KB Output is correct
101 Correct 2652 ms 12964 KB Output is correct
102 Correct 2623 ms 12800 KB Output is correct
103 Correct 2582 ms 12024 KB Output is correct
104 Correct 2492 ms 12040 KB Output is correct
105 Correct 2140 ms 12116 KB Output is correct
106 Correct 1820 ms 11696 KB Output is correct
107 Correct 2029 ms 12016 KB Output is correct
108 Correct 2412 ms 12608 KB Output is correct
109 Correct 1672 ms 11988 KB Output is correct