oj.uz

Submission #922247

# Submission time Handle Problem Language Result Execution time Memory
922247 2024-02-05T09:43:29 Z bohicob493 Bridges (APIO19_bridges) C++17
100 / 100
 1486 ms 36220 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VL;
#define PB push_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define endl '\n'
#define dbg(x) cerr << '[' << #x << ": " << x << "]\n"
#define dbg2(x, y) cerr << '[' << #x << ": " << x << ", " << #y << ": " << y << "]\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"

const ll INF = (ll)2e18 + 1386;
const ld EPS = 0.000000000000001;
const int MOD = 1e9 + 7;

inline int _add(int a, int b){ int res = a + b; return (res >= MOD ? res - MOD : res); }
inline int _neg(int a, int b){ int res = (abs(a - b) < MOD ? a - b : (a - b) % MOD); return (res < 0 ? res + MOD : res); }
inline int _mlt(ll a, ll b){ return (a * b % MOD); }
inline void fileIO(string i, string o){ freopen(i.c_str(), "r", stdin); freopen(o.c_str(), "w", stdout); }

const int MAXN = 5e4 + 1, SQ = 900;

int wei[MAXN * 2], par[MAXN], sz[MAXN];
PII edg[MAXN * 2];
bool marke[MAXN * 2];
struct Query {
    int t, x, y;
} quer[MAXN * 2];
VI bucket[MAXN * 4];
int ans[MAXN * 2];
VI N[MAXN];
bool mark[MAXN];
int lstw[MAXN * 2];

int gp(int v){
    return par[v] == v ? v : par[v] = gp(par[v]);
}

void merge(int u, int v){
    u = gp(u), v = gp(v);
    if (u == v) return;
    par[u] = v;
    sz[v] += sz[u];
}

int sigma, globpnt;
int trash[MAXN];
int dfsarr[MAXN];
void dfs(int v){
    /*
    trash[++globpnt] = v;
    mark[v] = 1;
    sigma += sz[v];
    for (int u : N[v]){
        if (!mark[u]) dfs(u);
    }
    */
    int curpnt = 1, szz = 1;
    dfsarr[1] = v;
    mark[v] = 1;
    while (curpnt <= szz){
        int u = dfsarr[curpnt];
        trash[++globpnt] = u;
        sigma += sz[u];
        for (int w : N[u]){
            if (!mark[w]){
                dfsarr[++szz] = w;
                mark[w] = 1;
            }
        }
        curpnt++;
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m;
    cin >> n >> m;
    VI cmpr;
    for (int i = 1; i <= m; i++){
        int u, v;
        cin >> u >> v >> wei[i];
        edg[i] = MP(u, v);
        cmpr.PB(wei[i]);
    }
    int q; cin >> q;
    for (int i = 0; i < q; i++){
        cin >> quer[i].t >> quer[i].x >> quer[i].y;
        cmpr.PB(quer[i].y);
    }
    sort(all(cmpr));
    cmpr.resize(unique(all(cmpr)) - cmpr.begin());
    for (int i = 1; i <= m; i++){
        wei[i] = lower_bound(all(cmpr), wei[i]) - cmpr.begin() + 1;
        lstw[i] = wei[i];
    }
    for (int i = 0; i < q; i++){
        quer[i].y = lower_bound(all(cmpr), quer[i].y) - cmpr.begin() + 1;
    }
    int mxwei = cmpr.size();
    for (int i = 0; i < q; i++){
        if (i % SQ) continue;
        //cout << "#1" << endl;
        vector<PII> procs;
        VI upds;
        for (int j = i; j < min(i + SQ, q); j++){
            if (quer[j].t == 1){
                marke[quer[j].x] = 1;
                upds.PB(j);
            } else {
                procs.PB(MP(-quer[j].y, j));
            }
        }
        //for (int j = 1; j <= m; j++) cout << marke[j];
        //cout << endl;
        for (int j = 1; j <= m; j++){
            if (marke[j]) continue;
            bucket[wei[j]].PB(j);
            //cout << "added " << j << ' ' << wei[j] << ' ' << " to bucket" << endl;
        }
        fill(sz, sz + n + 1, 1);
        iota(par, par + n + 1, 0);
        sort(all(procs));
        int pnt = mxwei;
        for (auto [tmpw, id] : procs){
            int W = -tmpw;
            //cout << "proces : ";
            //cout << id+1 << ' ' << W << endl;
            while (pnt >= W){
                for (int E : bucket[pnt]){
                    merge(edg[E].first, edg[E].second);
                    //cout << "merged " << edg[E].first << ' ' << edg[E].second << endl;
                }
                pnt--;
            }
            for (int j : upds){
                if (j > id) break;
                lstw[quer[j].x] = quer[j].y;
            }
            for (int j : upds){
                if (lstw[quer[j].x] && lstw[quer[j].x] >= W){
                    auto [u, v] = edg[quer[j].x];
                    u = gp(u);
                    v = gp(v);
                    N[u].PB(v);
                    N[v].PB(u);
                    //cout << "add edg " << u << ' ' << v << endl;
                }
            }
            sigma = 0;
            globpnt = 0;
            dfs(gp(quer[id].x));
            ans[id] = sigma;
            for (int j = 1; j <= globpnt; j++) mark[trash[j]] = 0;
            ////////////////////////////////////////////
            for (int j : upds){
                if (lstw[quer[j].x] && lstw[quer[j].x] >= W){
                    auto [u, v] = edg[quer[j].x];
                    u = gp(u);
                    v = gp(v);
                    N[u].pop_back();
                    N[v].pop_back();
                    //cout << "rmv edg " << u << ' ' << v << endl;
                }
            }
            for (int j : upds){
                if (j > id) break;
                lstw[quer[j].x] = wei[quer[j].x];
            }
        }
        for (int j = 1; j <= m; j++){
            if (marke[j]) continue;
            bucket[wei[j]].clear();
        }
        for (int j = i; j < min(i + SQ, q); j++){
            if (quer[j].t == 1){
                marke[quer[j].x] = 0;
                lstw[quer[j].x] = wei[quer[j].x] = quer[j].y;
            }
        }
    }
    for (int i = 0; i < q; i++){
        if (ans[i]) cout << ans[i] << endl;
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 43 ms 8848 KB Output is correct
4 Correct 7 ms 8792 KB Output is correct
5 Correct 38 ms 8780 KB Output is correct
6 Correct 28 ms 8796 KB Output is correct
7 Correct 31 ms 8768 KB Output is correct
8 Correct 33 ms 8736 KB Output is correct
9 Correct 39 ms 8796 KB Output is correct
10 Correct 35 ms 8540 KB Output is correct
11 Correct 38 ms 8536 KB Output is correct
12 Correct 37 ms 8540 KB Output is correct
13 Correct 40 ms 8536 KB Output is correct
14 Correct 34 ms 8796 KB Output is correct
15 Correct 43 ms 8784 KB Output is correct
16 Correct 34 ms 8792 KB Output is correct
17 Correct 32 ms 8536 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 735 ms 14700 KB Output is correct
2 Correct 881 ms 14488 KB Output is correct
3 Correct 768 ms 14604 KB Output is correct
4 Correct 762 ms 14688 KB Output is correct
5 Correct 859 ms 14544 KB Output is correct
6 Correct 1184 ms 14456 KB Output is correct
7 Correct 1077 ms 14336 KB Output is correct
8 Correct 863 ms 14528 KB Output is correct
9 Correct 78 ms 9200 KB Output is correct
10 Correct 671 ms 11644 KB Output is correct
11 Correct 585 ms 11984 KB Output is correct
12 Correct 442 ms 12772 KB Output is correct
13 Correct 624 ms 15716 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 728 ms 17992 KB Output is correct
2 Correct 648 ms 15312 KB Output is correct
3 Correct 875 ms 22780 KB Output is correct
4 Correct 778 ms 28240 KB Output is correct
5 Correct 70 ms 9192 KB Output is correct
6 Correct 887 ms 25536 KB Output is correct
7 Correct 793 ms 24476 KB Output is correct
8 Correct 732 ms 20944 KB Output is correct
9 Correct 492 ms 14828 KB Output is correct
10 Correct 465 ms 13820 KB Output is correct
11 Correct 627 ms 25032 KB Output is correct
12 Correct 560 ms 20776 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 817 ms 14400 KB Output is correct
2 Correct 65 ms 9424 KB Output is correct
3 Correct 66 ms 13204 KB Output is correct
4 Correct 33 ms 10832 KB Output is correct
5 Correct 426 ms 12116 KB Output is correct
6 Correct 760 ms 14396 KB Output is correct
7 Correct 389 ms 11932 KB Output is correct
8 Correct 329 ms 11980 KB Output is correct
9 Correct 325 ms 11800 KB Output is correct
10 Correct 268 ms 12028 KB Output is correct
11 Correct 545 ms 13264 KB Output is correct
12 Correct 559 ms 13240 KB Output is correct
13 Correct 449 ms 13228 KB Output is correct
14 Correct 383 ms 12276 KB Output is correct
15 Correct 388 ms 12184 KB Output is correct
16 Correct 744 ms 14280 KB Output is correct
17 Correct 773 ms 14360 KB Output is correct
18 Correct 796 ms 14388 KB Output is correct
19 Correct 783 ms 14368 KB Output is correct
20 Correct 501 ms 13876 KB Output is correct
21 Correct 495 ms 13888 KB Output is correct
22 Correct 691 ms 14684 KB Output is correct
23 Correct 335 ms 11728 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 735 ms 14700 KB Output is correct
2 Correct 881 ms 14488 KB Output is correct
3 Correct 768 ms 14604 KB Output is correct
4 Correct 762 ms 14688 KB Output is correct
5 Correct 859 ms 14544 KB Output is correct
6 Correct 1184 ms 14456 KB Output is correct
7 Correct 1077 ms 14336 KB Output is correct
8 Correct 863 ms 14528 KB Output is correct
9 Correct 78 ms 9200 KB Output is correct
10 Correct 671 ms 11644 KB Output is correct
11 Correct 585 ms 11984 KB Output is correct
12 Correct 442 ms 12772 KB Output is correct
13 Correct 624 ms 15716 KB Output is correct
14 Correct 728 ms 17992 KB Output is correct
15 Correct 648 ms 15312 KB Output is correct
16 Correct 875 ms 22780 KB Output is correct
17 Correct 778 ms 28240 KB Output is correct
18 Correct 70 ms 9192 KB Output is correct
19 Correct 887 ms 25536 KB Output is correct
20 Correct 793 ms 24476 KB Output is correct
21 Correct 732 ms 20944 KB Output is correct
22 Correct 492 ms 14828 KB Output is correct
23 Correct 465 ms 13820 KB Output is correct
24 Correct 627 ms 25032 KB Output is correct
25 Correct 560 ms 20776 KB Output is correct
26 Correct 989 ms 21272 KB Output is correct
27 Correct 968 ms 18088 KB Output is correct
28 Correct 942 ms 23852 KB Output is correct
29 Correct 696 ms 17824 KB Output is correct
30 Correct 907 ms 14720 KB Output is correct
31 Correct 931 ms 14584 KB Output is correct
32 Correct 965 ms 14812 KB Output is correct
33 Correct 755 ms 14644 KB Output is correct
34 Correct 776 ms 14552 KB Output is correct
35 Correct 782 ms 14716 KB Output is correct
36 Correct 637 ms 14828 KB Output is correct
37 Correct 613 ms 14804 KB Output is correct
38 Correct 613 ms 14604 KB Output is correct
39 Correct 478 ms 12952 KB Output is correct
40 Correct 433 ms 13304 KB Output is correct
41 Correct 440 ms 13008 KB Output is correct
42 Correct 495 ms 15820 KB Output is correct
43 Correct 494 ms 15816 KB Output is correct
44 Correct 489 ms 15984 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 43 ms 8848 KB Output is correct
4 Correct 7 ms 8792 KB Output is correct
5 Correct 38 ms 8780 KB Output is correct
6 Correct 28 ms 8796 KB Output is correct
7 Correct 31 ms 8768 KB Output is correct
8 Correct 33 ms 8736 KB Output is correct
9 Correct 39 ms 8796 KB Output is correct
10 Correct 35 ms 8540 KB Output is correct
11 Correct 38 ms 8536 KB Output is correct
12 Correct 37 ms 8540 KB Output is correct
13 Correct 40 ms 8536 KB Output is correct
14 Correct 34 ms 8796 KB Output is correct
15 Correct 43 ms 8784 KB Output is correct
16 Correct 34 ms 8792 KB Output is correct
17 Correct 32 ms 8536 KB Output is correct
18 Correct 735 ms 14700 KB Output is correct
19 Correct 881 ms 14488 KB Output is correct
20 Correct 768 ms 14604 KB Output is correct
21 Correct 762 ms 14688 KB Output is correct
22 Correct 859 ms 14544 KB Output is correct
23 Correct 1184 ms 14456 KB Output is correct
24 Correct 1077 ms 14336 KB Output is correct
25 Correct 863 ms 14528 KB Output is correct
26 Correct 78 ms 9200 KB Output is correct
27 Correct 671 ms 11644 KB Output is correct
28 Correct 585 ms 11984 KB Output is correct
29 Correct 442 ms 12772 KB Output is correct
30 Correct 624 ms 15716 KB Output is correct
31 Correct 728 ms 17992 KB Output is correct
32 Correct 648 ms 15312 KB Output is correct
33 Correct 875 ms 22780 KB Output is correct
34 Correct 778 ms 28240 KB Output is correct
35 Correct 70 ms 9192 KB Output is correct
36 Correct 887 ms 25536 KB Output is correct
37 Correct 793 ms 24476 KB Output is correct
38 Correct 732 ms 20944 KB Output is correct
39 Correct 492 ms 14828 KB Output is correct
40 Correct 465 ms 13820 KB Output is correct
41 Correct 627 ms 25032 KB Output is correct
42 Correct 560 ms 20776 KB Output is correct
43 Correct 817 ms 14400 KB Output is correct
44 Correct 65 ms 9424 KB Output is correct
45 Correct 66 ms 13204 KB Output is correct
46 Correct 33 ms 10832 KB Output is correct
47 Correct 426 ms 12116 KB Output is correct
48 Correct 760 ms 14396 KB Output is correct
49 Correct 389 ms 11932 KB Output is correct
50 Correct 329 ms 11980 KB Output is correct
51 Correct 325 ms 11800 KB Output is correct
52 Correct 268 ms 12028 KB Output is correct
53 Correct 545 ms 13264 KB Output is correct
54 Correct 559 ms 13240 KB Output is correct
55 Correct 449 ms 13228 KB Output is correct
56 Correct 383 ms 12276 KB Output is correct
57 Correct 388 ms 12184 KB Output is correct
58 Correct 744 ms 14280 KB Output is correct
59 Correct 773 ms 14360 KB Output is correct
60 Correct 796 ms 14388 KB Output is correct
61 Correct 783 ms 14368 KB Output is correct
62 Correct 501 ms 13876 KB Output is correct
63 Correct 495 ms 13888 KB Output is correct
64 Correct 691 ms 14684 KB Output is correct
65 Correct 335 ms 11728 KB Output is correct
66 Correct 989 ms 21272 KB Output is correct
67 Correct 968 ms 18088 KB Output is correct
68 Correct 942 ms 23852 KB Output is correct
69 Correct 696 ms 17824 KB Output is correct
70 Correct 907 ms 14720 KB Output is correct
71 Correct 931 ms 14584 KB Output is correct
72 Correct 965 ms 14812 KB Output is correct
73 Correct 755 ms 14644 KB Output is correct
74 Correct 776 ms 14552 KB Output is correct
75 Correct 782 ms 14716 KB Output is correct
76 Correct 637 ms 14828 KB Output is correct
77 Correct 613 ms 14804 KB Output is correct
78 Correct 613 ms 14604 KB Output is correct
79 Correct 478 ms 12952 KB Output is correct
80 Correct 433 ms 13304 KB Output is correct
81 Correct 440 ms 13008 KB Output is correct
82 Correct 495 ms 15820 KB Output is correct
83 Correct 494 ms 15816 KB Output is correct
84 Correct 489 ms 15984 KB Output is correct
85 Correct 1450 ms 35972 KB Output is correct
86 Correct 95 ms 13504 KB Output is correct
87 Correct 73 ms 10960 KB Output is correct
88 Correct 790 ms 12732 KB Output is correct
89 Correct 1482 ms 36220 KB Output is correct
90 Correct 758 ms 12288 KB Output is correct
91 Correct 785 ms 14748 KB Output is correct
92 Correct 756 ms 14540 KB Output is correct
93 Correct 850 ms 14028 KB Output is correct
94 Correct 987 ms 16596 KB Output is correct
95 Correct 995 ms 17020 KB Output is correct
96 Correct 1018 ms 15696 KB Output is correct
97 Correct 539 ms 11920 KB Output is correct
98 Correct 543 ms 12156 KB Output is correct
99 Correct 1397 ms 34468 KB Output is correct
100 Correct 1372 ms 35128 KB Output is correct
101 Correct 1486 ms 29264 KB Output is correct
102 Correct 1429 ms 29088 KB Output is correct
103 Correct 1141 ms 15356 KB Output is correct
104 Correct 1147 ms 15244 KB Output is correct
105 Correct 803 ms 16700 KB Output is correct
106 Correct 659 ms 16932 KB Output is correct
107 Correct 729 ms 14292 KB Output is correct
108 Correct 1328 ms 26652 KB Output is correct
109 Correct 807 ms 11484 KB Output is correct