oj.uz

답안 #982949

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982949 2024-05-15T06:01:33 Z angella 다리 (APIO19_bridges) C++17
73 / 100
 3000 ms 37496 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 = 400;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21604 KB Output is correct
2 Correct 10 ms 21596 KB Output is correct
3 Correct 26 ms 23900 KB Output is correct
4 Correct 22 ms 23784 KB Output is correct
5 Correct 33 ms 22052 KB Output is correct
6 Correct 20 ms 22108 KB Output is correct
7 Correct 23 ms 23736 KB Output is correct
8 Correct 23 ms 22216 KB Output is correct
9 Correct 20 ms 23644 KB Output is correct
10 Correct 23 ms 22192 KB Output is correct
11 Correct 22 ms 23772 KB Output is correct
12 Correct 22 ms 22108 KB Output is correct
13 Correct 25 ms 22108 KB Output is correct
14 Correct 25 ms 22232 KB Output is correct
15 Correct 24 ms 22104 KB Output is correct
16 Correct 29 ms 22108 KB Output is correct
17 Correct 20 ms 22124 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1225 ms 33232 KB Output is correct
2 Correct 1381 ms 33064 KB Output is correct
3 Correct 1331 ms 33340 KB Output is correct
4 Correct 1225 ms 35568 KB Output is correct
5 Correct 1253 ms 35392 KB Output is correct
6 Correct 1305 ms 33412 KB Output is correct
7 Correct 1298 ms 33944 KB Output is correct
8 Correct 1518 ms 34296 KB Output is correct
9 Correct 203 ms 31180 KB Output is correct
10 Correct 438 ms 29392 KB Output is correct
11 Correct 429 ms 29476 KB Output is correct
12 Correct 836 ms 33668 KB Output is correct
13 Correct 1116 ms 34116 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 895 ms 34392 KB Output is correct
2 Correct 407 ms 30660 KB Output is correct
3 Correct 868 ms 32184 KB Output is correct
4 Correct 947 ms 32044 KB Output is correct
5 Correct 173 ms 31336 KB Output is correct
6 Correct 926 ms 33280 KB Output is correct
7 Correct 852 ms 33100 KB Output is correct
8 Correct 777 ms 33032 KB Output is correct
9 Correct 951 ms 33484 KB Output is correct
10 Correct 790 ms 33132 KB Output is correct
11 Correct 791 ms 32988 KB Output is correct
12 Correct 741 ms 32972 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2504 ms 37432 KB Output is correct
2 Correct 154 ms 31188 KB Output is correct
3 Correct 155 ms 29364 KB Output is correct
4 Correct 94 ms 26324 KB Output is correct
5 Correct 895 ms 30800 KB Output is correct
6 Correct 2980 ms 37308 KB Output is correct
7 Correct 847 ms 30864 KB Output is correct
8 Correct 1199 ms 34392 KB Output is correct
9 Correct 1237 ms 34360 KB Output is correct
10 Correct 841 ms 34448 KB Output is correct
11 Correct 1629 ms 34500 KB Output is correct
12 Correct 1877 ms 34652 KB Output is correct
13 Correct 1406 ms 34864 KB Output is correct
14 Correct 913 ms 30156 KB Output is correct
15 Correct 831 ms 29784 KB Output is correct
16 Correct 2657 ms 36036 KB Output is correct
17 Correct 2501 ms 36104 KB Output is correct
18 Correct 2443 ms 36092 KB Output is correct
19 Correct 2770 ms 36224 KB Output is correct
20 Correct 1425 ms 36324 KB Output is correct
21 Correct 1402 ms 36460 KB Output is correct
22 Correct 1963 ms 37496 KB Output is correct
23 Correct 830 ms 30668 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1225 ms 33232 KB Output is correct
2 Correct 1381 ms 33064 KB Output is correct
3 Correct 1331 ms 33340 KB Output is correct
4 Correct 1225 ms 35568 KB Output is correct
5 Correct 1253 ms 35392 KB Output is correct
6 Correct 1305 ms 33412 KB Output is correct
7 Correct 1298 ms 33944 KB Output is correct
8 Correct 1518 ms 34296 KB Output is correct
9 Correct 203 ms 31180 KB Output is correct
10 Correct 438 ms 29392 KB Output is correct
11 Correct 429 ms 29476 KB Output is correct
12 Correct 836 ms 33668 KB Output is correct
13 Correct 1116 ms 34116 KB Output is correct
14 Correct 895 ms 34392 KB Output is correct
15 Correct 407 ms 30660 KB Output is correct
16 Correct 868 ms 32184 KB Output is correct
17 Correct 947 ms 32044 KB Output is correct
18 Correct 173 ms 31336 KB Output is correct
19 Correct 926 ms 33280 KB Output is correct
20 Correct 852 ms 33100 KB Output is correct
21 Correct 777 ms 33032 KB Output is correct
22 Correct 951 ms 33484 KB Output is correct
23 Correct 790 ms 33132 KB Output is correct
24 Correct 791 ms 32988 KB Output is correct
25 Correct 741 ms 32972 KB Output is correct
26 Correct 1178 ms 34180 KB Output is correct
27 Correct 1471 ms 32200 KB Output is correct
28 Correct 1479 ms 33396 KB Output is correct
29 Correct 1319 ms 34172 KB Output is correct
30 Correct 1444 ms 32856 KB Output is correct
31 Correct 1548 ms 33480 KB Output is correct
32 Correct 1657 ms 33572 KB Output is correct
33 Correct 1550 ms 34140 KB Output is correct
34 Correct 1490 ms 34028 KB Output is correct
35 Correct 1673 ms 33020 KB Output is correct
36 Correct 1679 ms 33060 KB Output is correct
37 Correct 1548 ms 34208 KB Output is correct
38 Correct 1347 ms 35400 KB Output is correct
39 Correct 1471 ms 34148 KB Output is correct
40 Correct 1066 ms 34156 KB Output is correct
41 Correct 1224 ms 34292 KB Output is correct
42 Correct 1254 ms 33912 KB Output is correct
43 Correct 1457 ms 33284 KB Output is correct
44 Correct 1162 ms 33096 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21604 KB Output is correct
2 Correct 10 ms 21596 KB Output is correct
3 Correct 26 ms 23900 KB Output is correct
4 Correct 22 ms 23784 KB Output is correct
5 Correct 33 ms 22052 KB Output is correct
6 Correct 20 ms 22108 KB Output is correct
7 Correct 23 ms 23736 KB Output is correct
8 Correct 23 ms 22216 KB Output is correct
9 Correct 20 ms 23644 KB Output is correct
10 Correct 23 ms 22192 KB Output is correct
11 Correct 22 ms 23772 KB Output is correct
12 Correct 22 ms 22108 KB Output is correct
13 Correct 25 ms 22108 KB Output is correct
14 Correct 25 ms 22232 KB Output is correct
15 Correct 24 ms 22104 KB Output is correct
16 Correct 29 ms 22108 KB Output is correct
17 Correct 20 ms 22124 KB Output is correct
18 Correct 1225 ms 33232 KB Output is correct
19 Correct 1381 ms 33064 KB Output is correct
20 Correct 1331 ms 33340 KB Output is correct
21 Correct 1225 ms 35568 KB Output is correct
22 Correct 1253 ms 35392 KB Output is correct
23 Correct 1305 ms 33412 KB Output is correct
24 Correct 1298 ms 33944 KB Output is correct
25 Correct 1518 ms 34296 KB Output is correct
26 Correct 203 ms 31180 KB Output is correct
27 Correct 438 ms 29392 KB Output is correct
28 Correct 429 ms 29476 KB Output is correct
29 Correct 836 ms 33668 KB Output is correct
30 Correct 1116 ms 34116 KB Output is correct
31 Correct 895 ms 34392 KB Output is correct
32 Correct 407 ms 30660 KB Output is correct
33 Correct 868 ms 32184 KB Output is correct
34 Correct 947 ms 32044 KB Output is correct
35 Correct 173 ms 31336 KB Output is correct
36 Correct 926 ms 33280 KB Output is correct
37 Correct 852 ms 33100 KB Output is correct
38 Correct 777 ms 33032 KB Output is correct
39 Correct 951 ms 33484 KB Output is correct
40 Correct 790 ms 33132 KB Output is correct
41 Correct 791 ms 32988 KB Output is correct
42 Correct 741 ms 32972 KB Output is correct
43 Correct 2504 ms 37432 KB Output is correct
44 Correct 154 ms 31188 KB Output is correct
45 Correct 155 ms 29364 KB Output is correct
46 Correct 94 ms 26324 KB Output is correct
47 Correct 895 ms 30800 KB Output is correct
48 Correct 2980 ms 37308 KB Output is correct
49 Correct 847 ms 30864 KB Output is correct
50 Correct 1199 ms 34392 KB Output is correct
51 Correct 1237 ms 34360 KB Output is correct
52 Correct 841 ms 34448 KB Output is correct
53 Correct 1629 ms 34500 KB Output is correct
54 Correct 1877 ms 34652 KB Output is correct
55 Correct 1406 ms 34864 KB Output is correct
56 Correct 913 ms 30156 KB Output is correct
57 Correct 831 ms 29784 KB Output is correct
58 Correct 2657 ms 36036 KB Output is correct
59 Correct 2501 ms 36104 KB Output is correct
60 Correct 2443 ms 36092 KB Output is correct
61 Correct 2770 ms 36224 KB Output is correct
62 Correct 1425 ms 36324 KB Output is correct
63 Correct 1402 ms 36460 KB Output is correct
64 Correct 1963 ms 37496 KB Output is correct
65 Correct 830 ms 30668 KB Output is correct
66 Correct 1178 ms 34180 KB Output is correct
67 Correct 1471 ms 32200 KB Output is correct
68 Correct 1479 ms 33396 KB Output is correct
69 Correct 1319 ms 34172 KB Output is correct
70 Correct 1444 ms 32856 KB Output is correct
71 Correct 1548 ms 33480 KB Output is correct
72 Correct 1657 ms 33572 KB Output is correct
73 Correct 1550 ms 34140 KB Output is correct
74 Correct 1490 ms 34028 KB Output is correct
75 Correct 1673 ms 33020 KB Output is correct
76 Correct 1679 ms 33060 KB Output is correct
77 Correct 1548 ms 34208 KB Output is correct
78 Correct 1347 ms 35400 KB Output is correct
79 Correct 1471 ms 34148 KB Output is correct
80 Correct 1066 ms 34156 KB Output is correct
81 Correct 1224 ms 34292 KB Output is correct
82 Correct 1254 ms 33912 KB Output is correct
83 Correct 1457 ms 33284 KB Output is correct
84 Correct 1162 ms 33096 KB Output is correct
85 Execution timed out 3026 ms 36060 KB Time limit exceeded
86 Halted 0 ms 0 KB -