oj.uz

Submission #982968

# Submission time Handle Problem Language Result Execution time Memory
982968 2024-05-15T06:13:28 Z angella Bridges (APIO19_bridges) C++17
100 / 100
 2892 ms 41152 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 = 355;
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) {
    v=getPar(v), u=getPar(u);
    if(v == u) return;
    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]) 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 11 ms 21596 KB Output is correct
2 Correct 10 ms 21592 KB Output is correct
3 Correct 26 ms 22564 KB Output is correct
4 Correct 16 ms 22384 KB Output is correct
5 Correct 23 ms 22300 KB Output is correct
6 Correct 20 ms 22360 KB Output is correct
7 Correct 20 ms 22108 KB Output is correct
8 Correct 24 ms 22348 KB Output is correct
9 Correct 20 ms 22108 KB Output is correct
10 Correct 24 ms 22188 KB Output is correct
11 Correct 23 ms 22364 KB Output is correct
12 Correct 23 ms 22364 KB Output is correct
13 Correct 27 ms 22564 KB Output is correct
14 Correct 25 ms 22376 KB Output is correct
15 Correct 26 ms 22364 KB Output is correct
16 Correct 20 ms 22132 KB Output is correct
17 Correct 28 ms 22104 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1251 ms 35632 KB Output is correct
2 Correct 1227 ms 35676 KB Output is correct
3 Correct 1244 ms 35324 KB Output is correct
4 Correct 1249 ms 35552 KB Output is correct
5 Correct 1220 ms 35528 KB Output is correct
6 Correct 1197 ms 34824 KB Output is correct
7 Correct 1237 ms 35428 KB Output is correct
8 Correct 1236 ms 35520 KB Output is correct
9 Correct 174 ms 31176 KB Output is correct
10 Correct 405 ms 29976 KB Output is correct
11 Correct 409 ms 30492 KB Output is correct
12 Correct 800 ms 35536 KB Output is correct
13 Correct 1126 ms 35652 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 840 ms 34608 KB Output is correct
2 Correct 411 ms 31080 KB Output is correct
3 Correct 815 ms 33228 KB Output is correct
4 Correct 891 ms 34544 KB Output is correct
5 Correct 167 ms 31176 KB Output is correct
6 Correct 853 ms 34340 KB Output is correct
7 Correct 880 ms 34188 KB Output is correct
8 Correct 811 ms 34116 KB Output is correct
9 Correct 703 ms 34508 KB Output is correct
10 Correct 716 ms 34100 KB Output is correct
11 Correct 763 ms 34028 KB Output is correct
12 Correct 758 ms 33912 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2404 ms 39364 KB Output is correct
2 Correct 170 ms 31340 KB Output is correct
3 Correct 172 ms 30220 KB Output is correct
4 Correct 107 ms 27000 KB Output is correct
5 Correct 871 ms 31852 KB Output is correct
6 Correct 2496 ms 39176 KB Output is correct
7 Correct 873 ms 31896 KB Output is correct
8 Correct 1080 ms 35800 KB Output is correct
9 Correct 1071 ms 35860 KB Output is correct
10 Correct 835 ms 35556 KB Output is correct
11 Correct 1767 ms 37724 KB Output is correct
12 Correct 1670 ms 37268 KB Output is correct
13 Correct 1321 ms 37260 KB Output is correct
14 Correct 873 ms 31812 KB Output is correct
15 Correct 870 ms 31952 KB Output is correct
16 Correct 2386 ms 39360 KB Output is correct
17 Correct 2451 ms 39100 KB Output is correct
18 Correct 2445 ms 39256 KB Output is correct
19 Correct 2344 ms 39352 KB Output is correct
20 Correct 1453 ms 38228 KB Output is correct
21 Correct 1590 ms 37824 KB Output is correct
22 Correct 1986 ms 39556 KB Output is correct
23 Correct 822 ms 31404 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1251 ms 35632 KB Output is correct
2 Correct 1227 ms 35676 KB Output is correct
3 Correct 1244 ms 35324 KB Output is correct
4 Correct 1249 ms 35552 KB Output is correct
5 Correct 1220 ms 35528 KB Output is correct
6 Correct 1197 ms 34824 KB Output is correct
7 Correct 1237 ms 35428 KB Output is correct
8 Correct 1236 ms 35520 KB Output is correct
9 Correct 174 ms 31176 KB Output is correct
10 Correct 405 ms 29976 KB Output is correct
11 Correct 409 ms 30492 KB Output is correct
12 Correct 800 ms 35536 KB Output is correct
13 Correct 1126 ms 35652 KB Output is correct
14 Correct 840 ms 34608 KB Output is correct
15 Correct 411 ms 31080 KB Output is correct
16 Correct 815 ms 33228 KB Output is correct
17 Correct 891 ms 34544 KB Output is correct
18 Correct 167 ms 31176 KB Output is correct
19 Correct 853 ms 34340 KB Output is correct
20 Correct 880 ms 34188 KB Output is correct
21 Correct 811 ms 34116 KB Output is correct
22 Correct 703 ms 34508 KB Output is correct
23 Correct 716 ms 34100 KB Output is correct
24 Correct 763 ms 34028 KB Output is correct
25 Correct 758 ms 33912 KB Output is correct
26 Correct 1185 ms 35432 KB Output is correct
27 Correct 1284 ms 34380 KB Output is correct
28 Correct 1352 ms 35684 KB Output is correct
29 Correct 1275 ms 35108 KB Output is correct
30 Correct 1322 ms 34812 KB Output is correct
31 Correct 1288 ms 34432 KB Output is correct
32 Correct 1343 ms 34436 KB Output is correct
33 Correct 1378 ms 35028 KB Output is correct
34 Correct 1482 ms 35904 KB Output is correct
35 Correct 1529 ms 37028 KB Output is correct
36 Correct 1371 ms 36956 KB Output is correct
37 Correct 1399 ms 36856 KB Output is correct
38 Correct 1644 ms 36852 KB Output is correct
39 Correct 1312 ms 36832 KB Output is correct
40 Correct 1256 ms 36988 KB Output is correct
41 Correct 1115 ms 37068 KB Output is correct
42 Correct 1224 ms 36956 KB Output is correct
43 Correct 1262 ms 37024 KB Output is correct
44 Correct 1273 ms 36724 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21596 KB Output is correct
2 Correct 10 ms 21592 KB Output is correct
3 Correct 26 ms 22564 KB Output is correct
4 Correct 16 ms 22384 KB Output is correct
5 Correct 23 ms 22300 KB Output is correct
6 Correct 20 ms 22360 KB Output is correct
7 Correct 20 ms 22108 KB Output is correct
8 Correct 24 ms 22348 KB Output is correct
9 Correct 20 ms 22108 KB Output is correct
10 Correct 24 ms 22188 KB Output is correct
11 Correct 23 ms 22364 KB Output is correct
12 Correct 23 ms 22364 KB Output is correct
13 Correct 27 ms 22564 KB Output is correct
14 Correct 25 ms 22376 KB Output is correct
15 Correct 26 ms 22364 KB Output is correct
16 Correct 20 ms 22132 KB Output is correct
17 Correct 28 ms 22104 KB Output is correct
18 Correct 1251 ms 35632 KB Output is correct
19 Correct 1227 ms 35676 KB Output is correct
20 Correct 1244 ms 35324 KB Output is correct
21 Correct 1249 ms 35552 KB Output is correct
22 Correct 1220 ms 35528 KB Output is correct
23 Correct 1197 ms 34824 KB Output is correct
24 Correct 1237 ms 35428 KB Output is correct
25 Correct 1236 ms 35520 KB Output is correct
26 Correct 174 ms 31176 KB Output is correct
27 Correct 405 ms 29976 KB Output is correct
28 Correct 409 ms 30492 KB Output is correct
29 Correct 800 ms 35536 KB Output is correct
30 Correct 1126 ms 35652 KB Output is correct
31 Correct 840 ms 34608 KB Output is correct
32 Correct 411 ms 31080 KB Output is correct
33 Correct 815 ms 33228 KB Output is correct
34 Correct 891 ms 34544 KB Output is correct
35 Correct 167 ms 31176 KB Output is correct
36 Correct 853 ms 34340 KB Output is correct
37 Correct 880 ms 34188 KB Output is correct
38 Correct 811 ms 34116 KB Output is correct
39 Correct 703 ms 34508 KB Output is correct
40 Correct 716 ms 34100 KB Output is correct
41 Correct 763 ms 34028 KB Output is correct
42 Correct 758 ms 33912 KB Output is correct
43 Correct 2404 ms 39364 KB Output is correct
44 Correct 170 ms 31340 KB Output is correct
45 Correct 172 ms 30220 KB Output is correct
46 Correct 107 ms 27000 KB Output is correct
47 Correct 871 ms 31852 KB Output is correct
48 Correct 2496 ms 39176 KB Output is correct
49 Correct 873 ms 31896 KB Output is correct
50 Correct 1080 ms 35800 KB Output is correct
51 Correct 1071 ms 35860 KB Output is correct
52 Correct 835 ms 35556 KB Output is correct
53 Correct 1767 ms 37724 KB Output is correct
54 Correct 1670 ms 37268 KB Output is correct
55 Correct 1321 ms 37260 KB Output is correct
56 Correct 873 ms 31812 KB Output is correct
57 Correct 870 ms 31952 KB Output is correct
58 Correct 2386 ms 39360 KB Output is correct
59 Correct 2451 ms 39100 KB Output is correct
60 Correct 2445 ms 39256 KB Output is correct
61 Correct 2344 ms 39352 KB Output is correct
62 Correct 1453 ms 38228 KB Output is correct
63 Correct 1590 ms 37824 KB Output is correct
64 Correct 1986 ms 39556 KB Output is correct
65 Correct 822 ms 31404 KB Output is correct
66 Correct 1185 ms 35432 KB Output is correct
67 Correct 1284 ms 34380 KB Output is correct
68 Correct 1352 ms 35684 KB Output is correct
69 Correct 1275 ms 35108 KB Output is correct
70 Correct 1322 ms 34812 KB Output is correct
71 Correct 1288 ms 34432 KB Output is correct
72 Correct 1343 ms 34436 KB Output is correct
73 Correct 1378 ms 35028 KB Output is correct
74 Correct 1482 ms 35904 KB Output is correct
75 Correct 1529 ms 37028 KB Output is correct
76 Correct 1371 ms 36956 KB Output is correct
77 Correct 1399 ms 36856 KB Output is correct
78 Correct 1644 ms 36852 KB Output is correct
79 Correct 1312 ms 36832 KB Output is correct
80 Correct 1256 ms 36988 KB Output is correct
81 Correct 1115 ms 37068 KB Output is correct
82 Correct 1224 ms 36956 KB Output is correct
83 Correct 1262 ms 37024 KB Output is correct
84 Correct 1273 ms 36724 KB Output is correct
85 Correct 2818 ms 41100 KB Output is correct
86 Correct 193 ms 31312 KB Output is correct
87 Correct 115 ms 28472 KB Output is correct
88 Correct 989 ms 33112 KB Output is correct
89 Correct 2790 ms 40868 KB Output is correct
90 Correct 1000 ms 33184 KB Output is correct
91 Correct 1348 ms 36676 KB Output is correct
92 Correct 1354 ms 36964 KB Output is correct
93 Correct 1335 ms 36876 KB Output is correct
94 Correct 2110 ms 38944 KB Output is correct
95 Correct 1991 ms 38864 KB Output is correct
96 Correct 1884 ms 38860 KB Output is correct
97 Correct 915 ms 33176 KB Output is correct
98 Correct 935 ms 32784 KB Output is correct
99 Correct 2815 ms 41100 KB Output is correct
100 Correct 2810 ms 41096 KB Output is correct
101 Correct 2892 ms 41060 KB Output is correct
102 Correct 2792 ms 41152 KB Output is correct
103 Correct 2129 ms 39788 KB Output is correct
104 Correct 2198 ms 39652 KB Output is correct
105 Correct 2360 ms 39452 KB Output is correct
106 Correct 2031 ms 39144 KB Output is correct
107 Correct 1632 ms 39784 KB Output is correct
108 Correct 2488 ms 40740 KB Output is correct
109 Correct 1000 ms 32404 KB Output is correct