oj.uz

Submission #982946

# Submission time Handle Problem Language Result Execution time Memory
982946 2024-05-15T05:58:58 Z angella Bridges (APIO19_bridges) C++17
73 / 100
 3000 ms 41260 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18, SQ = 320;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, m, q, ev[N], eu[N], ew[N], par[N], sz[N], ans[N], mark[N], ch[N];
vector<int> comp, Q[N], evec[N];
vector<int> qvec[N], rbk;

int getPar(int v) {return (par[v] == 0 ? v : getPar(par[v]));}
void merge(int v, int u) {
    if(getPar(v) == getPar(u)) return;
    v=getPar(v), u=getPar(u);
    if(sz[u] > sz[v]) swap(v,u);
    par[u] = v, sz[v] += sz[u];
    rbk.pb(u);
}
void rolbak(int tmp) {
    while(size(rbk) > tmp) {
        int v = rbk.back(); sz[par[v]] -= sz[v];
        par[v] = 0; rbk.pop_back();
    }
}

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

	cin>>n>>m;
    for(int i=1; i<=m; i++) {
        cin>>ev[i]>>eu[i]>>ew[i]; comp.pb(ew[i]);
    }
    cin>>q;
    for(int typ,x,y,i=1; i<=q; i++) {
        cin>>typ>>x>>y;
        comp.pb(y);
        Q[i] = {typ, x, y};
    }

    sort(all(comp)); comp.resize(unique(all(comp))-comp.begin());
    for(int i=1; i<=m; i++) {
        ew[i] = lower_bound(all(comp),ew[i])-comp.begin()+1;
    }
    for(int i=1; i<=q; i++) {
        Q[i][2] = lower_bound(all(comp),Q[i][2])-comp.begin()+1;
    }

    fill(sz+1, sz+n+1, 1);
    for(int i=1; i<=q; i+=SQ) {
        vector<int> tmp;
        for(int j=i; j<=q&&j<i+SQ; j++) {
            if(Q[j][0] == 1) {
                tmp.pb(j);
                mark[Q[j][1]] = 1;
            } else {
                qvec[Q[j][2]].pb(j);
            }
        }
        for(int j=1; j<=m; j++) {
            if(mark[j]==0) evec[ew[j]].pb(j);
        }
        for(int j=size(comp); j>=1; j--) {
            for(auto it : evec[j]) {
                // cout<<" ~ "<<ev[it]<<' '<<eu[it]<<endl;
                merge(ev[it], eu[it]);
            }
            for(auto it : qvec[j]) {
                for(auto it2 : tmp) {
                if(it2 <= it) ch[Q[it2][1]]=max(ch[Q[it2][1]],it2);
                }
                int rem = size(rbk);
                for(auto it2 : tmp) { 
                    if(ch[Q[it2][1]] >= 0) {
                    
                    if(ch[Q[it2][1]]==0) {
    if(ew[Q[it2][1]]>=Q[it][2])merge(ev[Q[it2][1]],eu[Q[it2][1]]);
                    } else {
    if(Q[ch[Q[it2][1]]][2]>=Q[it][2])merge(ev[Q[it2][1]],eu[Q[it2][1]]);
                    }
                    ch[Q[it2][1]] = -1;
                    
                    }
                }
                for(auto it2 : tmp) ch[Q[it2][1]] = 0;
                // fuck(getPar(Q[it][1]));
                ans[it] = sz[getPar(Q[it][1])];
                rolbak(rem);
            }
        }
        for(int j=i; j<=q&&j<i+SQ; j++) {
            if(Q[j][0] == 1) ew[Q[j][1]] = Q[j][2];
        }
        for(int j=0;j<=max({m,q,(int)size(comp)});j++) {
            par[j]=mark[j]=0, sz[j]=1;
            evec[j].clear(); qvec[j].clear();
        }
        rbk.clear();
    }

    for(int i=1; i<=q; i++) {
        if(ans[i] > 0) cout<<ans[i]<<'\n';
    }

	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23128 KB Output is correct
2 Correct 12 ms 23204 KB Output is correct
3 Correct 26 ms 24156 KB Output is correct
4 Correct 15 ms 24156 KB Output is correct
5 Correct 24 ms 23900 KB Output is correct
6 Correct 19 ms 23896 KB Output is correct
7 Correct 24 ms 23640 KB Output is correct
8 Correct 25 ms 23900 KB Output is correct
9 Correct 20 ms 23760 KB Output is correct
10 Correct 23 ms 23900 KB Output is correct
11 Correct 24 ms 23900 KB Output is correct
12 Correct 23 ms 23920 KB Output is correct
13 Correct 30 ms 23976 KB Output is correct
14 Correct 25 ms 23896 KB Output is correct
15 Correct 25 ms 23980 KB Output is correct
16 Correct 22 ms 23644 KB Output is correct
17 Correct 20 ms 23784 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1379 ms 36796 KB Output is correct
2 Correct 1431 ms 36764 KB Output is correct
3 Correct 1357 ms 36812 KB Output is correct
4 Correct 1391 ms 36916 KB Output is correct
5 Correct 1448 ms 36864 KB Output is correct
6 Correct 1344 ms 35972 KB Output is correct
7 Correct 1372 ms 36188 KB Output is correct
8 Correct 1381 ms 36592 KB Output is correct
9 Correct 188 ms 32408 KB Output is correct
10 Correct 470 ms 31436 KB Output is correct
11 Correct 469 ms 31028 KB Output is correct
12 Correct 925 ms 36156 KB Output is correct
13 Correct 1273 ms 36628 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 925 ms 35528 KB Output is correct
2 Correct 422 ms 32296 KB Output is correct
3 Correct 882 ms 34280 KB Output is correct
4 Correct 937 ms 35556 KB Output is correct
5 Correct 173 ms 32572 KB Output is correct
6 Correct 933 ms 35420 KB Output is correct
7 Correct 942 ms 35288 KB Output is correct
8 Correct 901 ms 35412 KB Output is correct
9 Correct 775 ms 35428 KB Output is correct
10 Correct 843 ms 35644 KB Output is correct
11 Correct 859 ms 35360 KB Output is correct
12 Correct 847 ms 35276 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2678 ms 41148 KB Output is correct
2 Correct 174 ms 32360 KB Output is correct
3 Correct 195 ms 31144 KB Output is correct
4 Correct 108 ms 27260 KB Output is correct
5 Correct 1081 ms 33196 KB Output is correct
6 Correct 2886 ms 41080 KB Output is correct
7 Correct 1002 ms 33180 KB Output is correct
8 Correct 1234 ms 37040 KB Output is correct
9 Correct 1256 ms 37156 KB Output is correct
10 Correct 910 ms 36876 KB Output is correct
11 Correct 1998 ms 39064 KB Output is correct
12 Correct 1968 ms 39120 KB Output is correct
13 Correct 1484 ms 39376 KB Output is correct
14 Correct 1008 ms 33480 KB Output is correct
15 Correct 1006 ms 33692 KB Output is correct
16 Correct 2732 ms 41008 KB Output is correct
17 Correct 2702 ms 41136 KB Output is correct
18 Correct 2680 ms 41236 KB Output is correct
19 Correct 2713 ms 41260 KB Output is correct
20 Correct 1751 ms 40048 KB Output is correct
21 Correct 1754 ms 39584 KB Output is correct
22 Correct 2268 ms 40892 KB Output is correct
23 Correct 962 ms 32764 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1379 ms 36796 KB Output is correct
2 Correct 1431 ms 36764 KB Output is correct
3 Correct 1357 ms 36812 KB Output is correct
4 Correct 1391 ms 36916 KB Output is correct
5 Correct 1448 ms 36864 KB Output is correct
6 Correct 1344 ms 35972 KB Output is correct
7 Correct 1372 ms 36188 KB Output is correct
8 Correct 1381 ms 36592 KB Output is correct
9 Correct 188 ms 32408 KB Output is correct
10 Correct 470 ms 31436 KB Output is correct
11 Correct 469 ms 31028 KB Output is correct
12 Correct 925 ms 36156 KB Output is correct
13 Correct 1273 ms 36628 KB Output is correct
14 Correct 925 ms 35528 KB Output is correct
15 Correct 422 ms 32296 KB Output is correct
16 Correct 882 ms 34280 KB Output is correct
17 Correct 937 ms 35556 KB Output is correct
18 Correct 173 ms 32572 KB Output is correct
19 Correct 933 ms 35420 KB Output is correct
20 Correct 942 ms 35288 KB Output is correct
21 Correct 901 ms 35412 KB Output is correct
22 Correct 775 ms 35428 KB Output is correct
23 Correct 843 ms 35644 KB Output is correct
24 Correct 859 ms 35360 KB Output is correct
25 Correct 847 ms 35276 KB Output is correct
26 Correct 1357 ms 37000 KB Output is correct
27 Correct 1390 ms 35616 KB Output is correct
28 Correct 1554 ms 37032 KB Output is correct
29 Correct 1484 ms 37064 KB Output is correct
30 Correct 1432 ms 36284 KB Output is correct
31 Correct 1480 ms 36416 KB Output is correct
32 Correct 1456 ms 36408 KB Output is correct
33 Correct 1435 ms 36920 KB Output is correct
34 Correct 1475 ms 36840 KB Output is correct
35 Correct 1460 ms 37024 KB Output is correct
36 Correct 1422 ms 36840 KB Output is correct
37 Correct 1389 ms 36884 KB Output is correct
38 Correct 1437 ms 36952 KB Output is correct
39 Correct 1294 ms 37072 KB Output is correct
40 Correct 1263 ms 37072 KB Output is correct
41 Correct 1228 ms 36896 KB Output is correct
42 Correct 1356 ms 36740 KB Output is correct
43 Correct 1382 ms 36764 KB Output is correct
44 Correct 1389 ms 36692 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23128 KB Output is correct
2 Correct 12 ms 23204 KB Output is correct
3 Correct 26 ms 24156 KB Output is correct
4 Correct 15 ms 24156 KB Output is correct
5 Correct 24 ms 23900 KB Output is correct
6 Correct 19 ms 23896 KB Output is correct
7 Correct 24 ms 23640 KB Output is correct
8 Correct 25 ms 23900 KB Output is correct
9 Correct 20 ms 23760 KB Output is correct
10 Correct 23 ms 23900 KB Output is correct
11 Correct 24 ms 23900 KB Output is correct
12 Correct 23 ms 23920 KB Output is correct
13 Correct 30 ms 23976 KB Output is correct
14 Correct 25 ms 23896 KB Output is correct
15 Correct 25 ms 23980 KB Output is correct
16 Correct 22 ms 23644 KB Output is correct
17 Correct 20 ms 23784 KB Output is correct
18 Correct 1379 ms 36796 KB Output is correct
19 Correct 1431 ms 36764 KB Output is correct
20 Correct 1357 ms 36812 KB Output is correct
21 Correct 1391 ms 36916 KB Output is correct
22 Correct 1448 ms 36864 KB Output is correct
23 Correct 1344 ms 35972 KB Output is correct
24 Correct 1372 ms 36188 KB Output is correct
25 Correct 1381 ms 36592 KB Output is correct
26 Correct 188 ms 32408 KB Output is correct
27 Correct 470 ms 31436 KB Output is correct
28 Correct 469 ms 31028 KB Output is correct
29 Correct 925 ms 36156 KB Output is correct
30 Correct 1273 ms 36628 KB Output is correct
31 Correct 925 ms 35528 KB Output is correct
32 Correct 422 ms 32296 KB Output is correct
33 Correct 882 ms 34280 KB Output is correct
34 Correct 937 ms 35556 KB Output is correct
35 Correct 173 ms 32572 KB Output is correct
36 Correct 933 ms 35420 KB Output is correct
37 Correct 942 ms 35288 KB Output is correct
38 Correct 901 ms 35412 KB Output is correct
39 Correct 775 ms 35428 KB Output is correct
40 Correct 843 ms 35644 KB Output is correct
41 Correct 859 ms 35360 KB Output is correct
42 Correct 847 ms 35276 KB Output is correct
43 Correct 2678 ms 41148 KB Output is correct
44 Correct 174 ms 32360 KB Output is correct
45 Correct 195 ms 31144 KB Output is correct
46 Correct 108 ms 27260 KB Output is correct
47 Correct 1081 ms 33196 KB Output is correct
48 Correct 2886 ms 41080 KB Output is correct
49 Correct 1002 ms 33180 KB Output is correct
50 Correct 1234 ms 37040 KB Output is correct
51 Correct 1256 ms 37156 KB Output is correct
52 Correct 910 ms 36876 KB Output is correct
53 Correct 1998 ms 39064 KB Output is correct
54 Correct 1968 ms 39120 KB Output is correct
55 Correct 1484 ms 39376 KB Output is correct
56 Correct 1008 ms 33480 KB Output is correct
57 Correct 1006 ms 33692 KB Output is correct
58 Correct 2732 ms 41008 KB Output is correct
59 Correct 2702 ms 41136 KB Output is correct
60 Correct 2680 ms 41236 KB Output is correct
61 Correct 2713 ms 41260 KB Output is correct
62 Correct 1751 ms 40048 KB Output is correct
63 Correct 1754 ms 39584 KB Output is correct
64 Correct 2268 ms 40892 KB Output is correct
65 Correct 962 ms 32764 KB Output is correct
66 Correct 1357 ms 37000 KB Output is correct
67 Correct 1390 ms 35616 KB Output is correct
68 Correct 1554 ms 37032 KB Output is correct
69 Correct 1484 ms 37064 KB Output is correct
70 Correct 1432 ms 36284 KB Output is correct
71 Correct 1480 ms 36416 KB Output is correct
72 Correct 1456 ms 36408 KB Output is correct
73 Correct 1435 ms 36920 KB Output is correct
74 Correct 1475 ms 36840 KB Output is correct
75 Correct 1460 ms 37024 KB Output is correct
76 Correct 1422 ms 36840 KB Output is correct
77 Correct 1389 ms 36884 KB Output is correct
78 Correct 1437 ms 36952 KB Output is correct
79 Correct 1294 ms 37072 KB Output is correct
80 Correct 1263 ms 37072 KB Output is correct
81 Correct 1228 ms 36896 KB Output is correct
82 Correct 1356 ms 36740 KB Output is correct
83 Correct 1382 ms 36764 KB Output is correct
84 Correct 1389 ms 36692 KB Output is correct
85 Execution timed out 3020 ms 40984 KB Time limit exceeded
86 Halted 0 ms 0 KB -