oj.uz

Submission #982954

# Submission time Handle Problem Language Result Execution time Memory
982954 2024-05-15T06:03:56 Z angella Bridges (APIO19_bridges) C++17
73 / 100
 3000 ms 41168 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 = 350;
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 9 ms 23128 KB Output is correct
2 Correct 10 ms 23232 KB Output is correct
3 Correct 26 ms 23844 KB Output is correct
4 Correct 15 ms 23900 KB Output is correct
5 Correct 21 ms 23852 KB Output is correct
6 Correct 22 ms 23644 KB Output is correct
7 Correct 20 ms 23600 KB Output is correct
8 Correct 23 ms 23844 KB Output is correct
9 Correct 19 ms 23644 KB Output is correct
10 Correct 23 ms 23640 KB Output is correct
11 Correct 23 ms 23640 KB Output is correct
12 Correct 23 ms 23900 KB Output is correct
13 Correct 24 ms 23900 KB Output is correct
14 Correct 24 ms 23900 KB Output is correct
15 Correct 24 ms 23708 KB Output is correct
16 Correct 19 ms 23644 KB Output is correct
17 Correct 21 ms 23728 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 34216 KB Output is correct
2 Correct 1289 ms 34148 KB Output is correct
3 Correct 1261 ms 34060 KB Output is correct
4 Correct 1324 ms 34284 KB Output is correct
5 Correct 1301 ms 34176 KB Output is correct
6 Correct 1336 ms 33616 KB Output is correct
7 Correct 1306 ms 33772 KB Output is correct
8 Correct 1264 ms 34280 KB Output is correct
9 Correct 164 ms 31176 KB Output is correct
10 Correct 423 ms 29396 KB Output is correct
11 Correct 426 ms 29388 KB Output is correct
12 Correct 854 ms 33780 KB Output is correct
13 Correct 1245 ms 34056 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 866 ms 33136 KB Output is correct
2 Correct 412 ms 30604 KB Output is correct
3 Correct 829 ms 31980 KB Output is correct
4 Correct 857 ms 33140 KB Output is correct
5 Correct 164 ms 31152 KB Output is correct
6 Correct 933 ms 33104 KB Output is correct
7 Correct 892 ms 33128 KB Output is correct
8 Correct 833 ms 33164 KB Output is correct
9 Correct 723 ms 33240 KB Output is correct
10 Correct 779 ms 33140 KB Output is correct
11 Correct 807 ms 33196 KB Output is correct
12 Correct 783 ms 33216 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2450 ms 37372 KB Output is correct
2 Correct 170 ms 31024 KB Output is correct
3 Correct 168 ms 29396 KB Output is correct
4 Correct 104 ms 26504 KB Output is correct
5 Correct 924 ms 30844 KB Output is correct
6 Correct 2508 ms 37480 KB Output is correct
7 Correct 940 ms 30952 KB Output is correct
8 Correct 1153 ms 34372 KB Output is correct
9 Correct 1105 ms 34272 KB Output is correct
10 Correct 868 ms 34500 KB Output is correct
11 Correct 1886 ms 36388 KB Output is correct
12 Correct 1870 ms 35836 KB Output is correct
13 Correct 1429 ms 36028 KB Output is correct
14 Correct 914 ms 30884 KB Output is correct
15 Correct 928 ms 31144 KB Output is correct
16 Correct 2609 ms 37496 KB Output is correct
17 Correct 2613 ms 37432 KB Output is correct
18 Correct 2603 ms 37196 KB Output is correct
19 Correct 2561 ms 37276 KB Output is correct
20 Correct 1552 ms 36360 KB Output is correct
21 Correct 1632 ms 36364 KB Output is correct
22 Correct 2045 ms 37348 KB Output is correct
23 Correct 871 ms 30484 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 34216 KB Output is correct
2 Correct 1289 ms 34148 KB Output is correct
3 Correct 1261 ms 34060 KB Output is correct
4 Correct 1324 ms 34284 KB Output is correct
5 Correct 1301 ms 34176 KB Output is correct
6 Correct 1336 ms 33616 KB Output is correct
7 Correct 1306 ms 33772 KB Output is correct
8 Correct 1264 ms 34280 KB Output is correct
9 Correct 164 ms 31176 KB Output is correct
10 Correct 423 ms 29396 KB Output is correct
11 Correct 426 ms 29388 KB Output is correct
12 Correct 854 ms 33780 KB Output is correct
13 Correct 1245 ms 34056 KB Output is correct
14 Correct 866 ms 33136 KB Output is correct
15 Correct 412 ms 30604 KB Output is correct
16 Correct 829 ms 31980 KB Output is correct
17 Correct 857 ms 33140 KB Output is correct
18 Correct 164 ms 31152 KB Output is correct
19 Correct 933 ms 33104 KB Output is correct
20 Correct 892 ms 33128 KB Output is correct
21 Correct 833 ms 33164 KB Output is correct
22 Correct 723 ms 33240 KB Output is correct
23 Correct 779 ms 33140 KB Output is correct
24 Correct 807 ms 33196 KB Output is correct
25 Correct 783 ms 33216 KB Output is correct
26 Correct 1262 ms 34560 KB Output is correct
27 Correct 1382 ms 33168 KB Output is correct
28 Correct 1465 ms 34116 KB Output is correct
29 Correct 1408 ms 34476 KB Output is correct
30 Correct 1355 ms 33736 KB Output is correct
31 Correct 1372 ms 33732 KB Output is correct
32 Correct 1367 ms 33576 KB Output is correct
33 Correct 1429 ms 34140 KB Output is correct
34 Correct 1422 ms 34236 KB Output is correct
35 Correct 1381 ms 34092 KB Output is correct
36 Correct 1338 ms 34064 KB Output is correct
37 Correct 1299 ms 34276 KB Output is correct
38 Correct 1319 ms 34260 KB Output is correct
39 Correct 1165 ms 34264 KB Output is correct
40 Correct 1164 ms 34348 KB Output is correct
41 Correct 1185 ms 34096 KB Output is correct
42 Correct 1232 ms 34088 KB Output is correct
43 Correct 1252 ms 34048 KB Output is correct
44 Correct 1281 ms 34220 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 23128 KB Output is correct
2 Correct 10 ms 23232 KB Output is correct
3 Correct 26 ms 23844 KB Output is correct
4 Correct 15 ms 23900 KB Output is correct
5 Correct 21 ms 23852 KB Output is correct
6 Correct 22 ms 23644 KB Output is correct
7 Correct 20 ms 23600 KB Output is correct
8 Correct 23 ms 23844 KB Output is correct
9 Correct 19 ms 23644 KB Output is correct
10 Correct 23 ms 23640 KB Output is correct
11 Correct 23 ms 23640 KB Output is correct
12 Correct 23 ms 23900 KB Output is correct
13 Correct 24 ms 23900 KB Output is correct
14 Correct 24 ms 23900 KB Output is correct
15 Correct 24 ms 23708 KB Output is correct
16 Correct 19 ms 23644 KB Output is correct
17 Correct 21 ms 23728 KB Output is correct
18 Correct 1342 ms 34216 KB Output is correct
19 Correct 1289 ms 34148 KB Output is correct
20 Correct 1261 ms 34060 KB Output is correct
21 Correct 1324 ms 34284 KB Output is correct
22 Correct 1301 ms 34176 KB Output is correct
23 Correct 1336 ms 33616 KB Output is correct
24 Correct 1306 ms 33772 KB Output is correct
25 Correct 1264 ms 34280 KB Output is correct
26 Correct 164 ms 31176 KB Output is correct
27 Correct 423 ms 29396 KB Output is correct
28 Correct 426 ms 29388 KB Output is correct
29 Correct 854 ms 33780 KB Output is correct
30 Correct 1245 ms 34056 KB Output is correct
31 Correct 866 ms 33136 KB Output is correct
32 Correct 412 ms 30604 KB Output is correct
33 Correct 829 ms 31980 KB Output is correct
34 Correct 857 ms 33140 KB Output is correct
35 Correct 164 ms 31152 KB Output is correct
36 Correct 933 ms 33104 KB Output is correct
37 Correct 892 ms 33128 KB Output is correct
38 Correct 833 ms 33164 KB Output is correct
39 Correct 723 ms 33240 KB Output is correct
40 Correct 779 ms 33140 KB Output is correct
41 Correct 807 ms 33196 KB Output is correct
42 Correct 783 ms 33216 KB Output is correct
43 Correct 2450 ms 37372 KB Output is correct
44 Correct 170 ms 31024 KB Output is correct
45 Correct 168 ms 29396 KB Output is correct
46 Correct 104 ms 26504 KB Output is correct
47 Correct 924 ms 30844 KB Output is correct
48 Correct 2508 ms 37480 KB Output is correct
49 Correct 940 ms 30952 KB Output is correct
50 Correct 1153 ms 34372 KB Output is correct
51 Correct 1105 ms 34272 KB Output is correct
52 Correct 868 ms 34500 KB Output is correct
53 Correct 1886 ms 36388 KB Output is correct
54 Correct 1870 ms 35836 KB Output is correct
55 Correct 1429 ms 36028 KB Output is correct
56 Correct 914 ms 30884 KB Output is correct
57 Correct 928 ms 31144 KB Output is correct
58 Correct 2609 ms 37496 KB Output is correct
59 Correct 2613 ms 37432 KB Output is correct
60 Correct 2603 ms 37196 KB Output is correct
61 Correct 2561 ms 37276 KB Output is correct
62 Correct 1552 ms 36360 KB Output is correct
63 Correct 1632 ms 36364 KB Output is correct
64 Correct 2045 ms 37348 KB Output is correct
65 Correct 871 ms 30484 KB Output is correct
66 Correct 1262 ms 34560 KB Output is correct
67 Correct 1382 ms 33168 KB Output is correct
68 Correct 1465 ms 34116 KB Output is correct
69 Correct 1408 ms 34476 KB Output is correct
70 Correct 1355 ms 33736 KB Output is correct
71 Correct 1372 ms 33732 KB Output is correct
72 Correct 1367 ms 33576 KB Output is correct
73 Correct 1429 ms 34140 KB Output is correct
74 Correct 1422 ms 34236 KB Output is correct
75 Correct 1381 ms 34092 KB Output is correct
76 Correct 1338 ms 34064 KB Output is correct
77 Correct 1299 ms 34276 KB Output is correct
78 Correct 1319 ms 34260 KB Output is correct
79 Correct 1165 ms 34264 KB Output is correct
80 Correct 1164 ms 34348 KB Output is correct
81 Correct 1185 ms 34096 KB Output is correct
82 Correct 1232 ms 34088 KB Output is correct
83 Correct 1252 ms 34048 KB Output is correct
84 Correct 1281 ms 34220 KB Output is correct
85 Correct 2750 ms 37548 KB Output is correct
86 Correct 184 ms 31252 KB Output is correct
87 Correct 111 ms 28480 KB Output is correct
88 Correct 1061 ms 33020 KB Output is correct
89 Correct 2907 ms 40980 KB Output is correct
90 Correct 1030 ms 33240 KB Output is correct
91 Correct 1464 ms 36808 KB Output is correct
92 Correct 1379 ms 36900 KB Output is correct
93 Correct 1398 ms 36672 KB Output is correct
94 Correct 2370 ms 39060 KB Output is correct
95 Correct 2141 ms 38888 KB Output is correct
96 Correct 1961 ms 38936 KB Output is correct
97 Correct 999 ms 32080 KB Output is correct
98 Correct 996 ms 32036 KB Output is correct
99 Correct 2857 ms 41168 KB Output is correct
100 Correct 2891 ms 40892 KB Output is correct
101 Correct 2923 ms 40944 KB Output is correct
102 Execution timed out 3011 ms 40840 KB Time limit exceeded
103 Halted 0 ms 0 KB -