oj.uz

답안 #561835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
561835 2022-05-13T15:51:22 Z Je_O 다리 (APIO19_bridges) C++17
100 / 100
 2106 ms 151760 KB 
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int N = 5e4 + 5;
const int M = 1e5 + 5;
const int BLOCK = 1000;
int u[M], v[M], w[M];
int t[M], x[M], y[M];
bool cek[M];
vector<int> join[M];
int par[N], sz[N];
int ans[M];

stack<int> stk;

int find(int x){
    while(par[x] != x)x = par[x];
    return x;
}

void merge(int x, int y){
    x = find(x); y = find(y);
    if(x == y)return;
    if(sz[x] > sz[y])swap(x, y);
    stk.push(x);
    par[x] = y;
    sz[y] += sz[x];
    return;
}

void rollback(int s){
    while(stk.size() > s){
        int x = stk.top(); stk.pop();
        sz[par[x]] -= sz[x];
        par[x] = x;
    }
    return;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n, m; cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        cin >> u[i] >> v[i] >> w[i];
    }
    int q; cin >> q;
    for(int i = 1; i <= q; ++i){
        cin >> t[i] >> x[i] >> y[i];
    }
    for(int i = 1; i <= q; i += BLOCK){
        iota(par + 1, par + n + 1, 1);
        fill(sz + 1, sz + n + 1, 1);
        fill(cek + 1, cek + m + 1, false);
        int l = i, r = min(i + BLOCK - 1, q);
        vector<int> pending, ask;
        for(int j = l; j <= r; ++j){
            if(t[j] == 1){
                cek[x[j]] = true;
                pending.pb(j);
            }else{
                ask.pb(j);
            }
        }
        vector<int> lst;
        for(int j = 1; j <= m; ++j){
            if(!cek[j])lst.pb(j);
        }
        for(int j = l; j <= r; ++j){
            if(t[j] == 1){
                w[x[j]] = y[j];
            }else{
                for(int k: pending){
                    if(w[x[k]] >= y[j]){
                        join[j].pb(x[k]);
                    }
                }
            }
        }
        sort(ask.begin(), ask.end(), [&](int a, int b) { return y[a] > y[b]; });
        sort(lst.begin(), lst.end(), [&](int a, int b) { return w[a] > w[b]; });
        int pt = 0;
        for(int j: ask){
            while(pt < lst.size() && w[lst[pt]] >= y[j]){
                merge(u[lst[pt]], v[lst[pt]]);
                ++pt;
            }
            int s = stk.size();
            for(int k: join[j])merge(u[k], v[k]);
            ans[j] = sz[find(x[j])];
            rollback(s);
        }
    }
    for(int i = 1; i <= q; ++i){
        if(t[i] == 2)cout << ans[i] << '\n';
    }
    return 0;
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:41:22: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |     while(stk.size() > s){
      |           ~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:92:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             while(pt < lst.size() && w[lst[pt]] >= y[j]){
      |                   ~~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 44 ms 9580 KB Output is correct
4 Correct 5 ms 2900 KB Output is correct
5 Correct 43 ms 10444 KB Output is correct
6 Correct 34 ms 10628 KB Output is correct
7 Correct 40 ms 10508 KB Output is correct
8 Correct 42 ms 8940 KB Output is correct
9 Correct 52 ms 14896 KB Output is correct
10 Correct 41 ms 9808 KB Output is correct
11 Correct 45 ms 9628 KB Output is correct
12 Correct 56 ms 12108 KB Output is correct
13 Correct 51 ms 10224 KB Output is correct
14 Correct 45 ms 9548 KB Output is correct
15 Correct 50 ms 10232 KB Output is correct
16 Correct 45 ms 13036 KB Output is correct
17 Correct 45 ms 12108 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1380 ms 93644 KB Output is correct
2 Correct 1428 ms 93540 KB Output is correct
3 Correct 1362 ms 93988 KB Output is correct
4 Correct 1420 ms 93672 KB Output is correct
5 Correct 1432 ms 94312 KB Output is correct
6 Correct 2051 ms 151760 KB Output is correct
7 Correct 2045 ms 148432 KB Output is correct
8 Correct 2069 ms 148104 KB Output is correct
9 Correct 44 ms 5292 KB Output is correct
10 Correct 1156 ms 119424 KB Output is correct
11 Correct 1156 ms 118608 KB Output is correct
12 Correct 1189 ms 73928 KB Output is correct
13 Correct 1185 ms 66676 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1146 ms 86716 KB Output is correct
2 Correct 910 ms 101612 KB Output is correct
3 Correct 1394 ms 114496 KB Output is correct
4 Correct 1085 ms 85988 KB Output is correct
5 Correct 39 ms 5064 KB Output is correct
6 Correct 1253 ms 105832 KB Output is correct
7 Correct 1032 ms 78052 KB Output is correct
8 Correct 958 ms 62196 KB Output is correct
9 Correct 786 ms 54232 KB Output is correct
10 Correct 724 ms 42612 KB Output is correct
11 Correct 781 ms 51344 KB Output is correct
12 Correct 685 ms 41020 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1519 ms 28100 KB Output is correct
2 Correct 39 ms 5316 KB Output is correct
3 Correct 163 ms 6028 KB Output is correct
4 Correct 81 ms 6052 KB Output is correct
5 Correct 784 ms 28196 KB Output is correct
6 Correct 1640 ms 28144 KB Output is correct
7 Correct 884 ms 28984 KB Output is correct
8 Correct 804 ms 28316 KB Output is correct
9 Correct 750 ms 28388 KB Output is correct
10 Correct 704 ms 28488 KB Output is correct
11 Correct 1065 ms 29120 KB Output is correct
12 Correct 1053 ms 29236 KB Output is correct
13 Correct 1091 ms 29440 KB Output is correct
14 Correct 660 ms 29416 KB Output is correct
15 Correct 684 ms 29432 KB Output is correct
16 Correct 1446 ms 29664 KB Output is correct
17 Correct 1437 ms 29600 KB Output is correct
18 Correct 1424 ms 29800 KB Output is correct
19 Correct 1419 ms 29768 KB Output is correct
20 Correct 1190 ms 29640 KB Output is correct
21 Correct 1187 ms 29660 KB Output is correct
22 Correct 1381 ms 29228 KB Output is correct
23 Correct 799 ms 27496 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1380 ms 93644 KB Output is correct
2 Correct 1428 ms 93540 KB Output is correct
3 Correct 1362 ms 93988 KB Output is correct
4 Correct 1420 ms 93672 KB Output is correct
5 Correct 1432 ms 94312 KB Output is correct
6 Correct 2051 ms 151760 KB Output is correct
7 Correct 2045 ms 148432 KB Output is correct
8 Correct 2069 ms 148104 KB Output is correct
9 Correct 44 ms 5292 KB Output is correct
10 Correct 1156 ms 119424 KB Output is correct
11 Correct 1156 ms 118608 KB Output is correct
12 Correct 1189 ms 73928 KB Output is correct
13 Correct 1185 ms 66676 KB Output is correct
14 Correct 1146 ms 86716 KB Output is correct
15 Correct 910 ms 101612 KB Output is correct
16 Correct 1394 ms 114496 KB Output is correct
17 Correct 1085 ms 85988 KB Output is correct
18 Correct 39 ms 5064 KB Output is correct
19 Correct 1253 ms 105832 KB Output is correct
20 Correct 1032 ms 78052 KB Output is correct
21 Correct 958 ms 62196 KB Output is correct
22 Correct 786 ms 54232 KB Output is correct
23 Correct 724 ms 42612 KB Output is correct
24 Correct 781 ms 51344 KB Output is correct
25 Correct 685 ms 41020 KB Output is correct
26 Correct 1413 ms 95176 KB Output is correct
27 Correct 1678 ms 124340 KB Output is correct
28 Correct 1378 ms 93156 KB Output is correct
29 Correct 968 ms 50336 KB Output is correct
30 Correct 1615 ms 110772 KB Output is correct
31 Correct 1600 ms 113092 KB Output is correct
32 Correct 1654 ms 113752 KB Output is correct
33 Correct 1345 ms 93380 KB Output is correct
34 Correct 1383 ms 93768 KB Output is correct
35 Correct 1391 ms 93980 KB Output is correct
36 Correct 1002 ms 57196 KB Output is correct
37 Correct 1020 ms 55896 KB Output is correct
38 Correct 1002 ms 54200 KB Output is correct
39 Correct 820 ms 40504 KB Output is correct
40 Correct 819 ms 39840 KB Output is correct
41 Correct 820 ms 39200 KB Output is correct
42 Correct 792 ms 38076 KB Output is correct
43 Correct 778 ms 37460 KB Output is correct
44 Correct 779 ms 37052 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 44 ms 9580 KB Output is correct
4 Correct 5 ms 2900 KB Output is correct
5 Correct 43 ms 10444 KB Output is correct
6 Correct 34 ms 10628 KB Output is correct
7 Correct 40 ms 10508 KB Output is correct
8 Correct 42 ms 8940 KB Output is correct
9 Correct 52 ms 14896 KB Output is correct
10 Correct 41 ms 9808 KB Output is correct
11 Correct 45 ms 9628 KB Output is correct
12 Correct 56 ms 12108 KB Output is correct
13 Correct 51 ms 10224 KB Output is correct
14 Correct 45 ms 9548 KB Output is correct
15 Correct 50 ms 10232 KB Output is correct
16 Correct 45 ms 13036 KB Output is correct
17 Correct 45 ms 12108 KB Output is correct
18 Correct 1380 ms 93644 KB Output is correct
19 Correct 1428 ms 93540 KB Output is correct
20 Correct 1362 ms 93988 KB Output is correct
21 Correct 1420 ms 93672 KB Output is correct
22 Correct 1432 ms 94312 KB Output is correct
23 Correct 2051 ms 151760 KB Output is correct
24 Correct 2045 ms 148432 KB Output is correct
25 Correct 2069 ms 148104 KB Output is correct
26 Correct 44 ms 5292 KB Output is correct
27 Correct 1156 ms 119424 KB Output is correct
28 Correct 1156 ms 118608 KB Output is correct
29 Correct 1189 ms 73928 KB Output is correct
30 Correct 1185 ms 66676 KB Output is correct
31 Correct 1146 ms 86716 KB Output is correct
32 Correct 910 ms 101612 KB Output is correct
33 Correct 1394 ms 114496 KB Output is correct
34 Correct 1085 ms 85988 KB Output is correct
35 Correct 39 ms 5064 KB Output is correct
36 Correct 1253 ms 105832 KB Output is correct
37 Correct 1032 ms 78052 KB Output is correct
38 Correct 958 ms 62196 KB Output is correct
39 Correct 786 ms 54232 KB Output is correct
40 Correct 724 ms 42612 KB Output is correct
41 Correct 781 ms 51344 KB Output is correct
42 Correct 685 ms 41020 KB Output is correct
43 Correct 1519 ms 28100 KB Output is correct
44 Correct 39 ms 5316 KB Output is correct
45 Correct 163 ms 6028 KB Output is correct
46 Correct 81 ms 6052 KB Output is correct
47 Correct 784 ms 28196 KB Output is correct
48 Correct 1640 ms 28144 KB Output is correct
49 Correct 884 ms 28984 KB Output is correct
50 Correct 804 ms 28316 KB Output is correct
51 Correct 750 ms 28388 KB Output is correct
52 Correct 704 ms 28488 KB Output is correct
53 Correct 1065 ms 29120 KB Output is correct
54 Correct 1053 ms 29236 KB Output is correct
55 Correct 1091 ms 29440 KB Output is correct
56 Correct 660 ms 29416 KB Output is correct
57 Correct 684 ms 29432 KB Output is correct
58 Correct 1446 ms 29664 KB Output is correct
59 Correct 1437 ms 29600 KB Output is correct
60 Correct 1424 ms 29800 KB Output is correct
61 Correct 1419 ms 29768 KB Output is correct
62 Correct 1190 ms 29640 KB Output is correct
63 Correct 1187 ms 29660 KB Output is correct
64 Correct 1381 ms 29228 KB Output is correct
65 Correct 799 ms 27496 KB Output is correct
66 Correct 1413 ms 95176 KB Output is correct
67 Correct 1678 ms 124340 KB Output is correct
68 Correct 1378 ms 93156 KB Output is correct
69 Correct 968 ms 50336 KB Output is correct
70 Correct 1615 ms 110772 KB Output is correct
71 Correct 1600 ms 113092 KB Output is correct
72 Correct 1654 ms 113752 KB Output is correct
73 Correct 1345 ms 93380 KB Output is correct
74 Correct 1383 ms 93768 KB Output is correct
75 Correct 1391 ms 93980 KB Output is correct
76 Correct 1002 ms 57196 KB Output is correct
77 Correct 1020 ms 55896 KB Output is correct
78 Correct 1002 ms 54200 KB Output is correct
79 Correct 820 ms 40504 KB Output is correct
80 Correct 819 ms 39840 KB Output is correct
81 Correct 820 ms 39200 KB Output is correct
82 Correct 792 ms 38076 KB Output is correct
83 Correct 778 ms 37460 KB Output is correct
84 Correct 779 ms 37052 KB Output is correct
85 Correct 1971 ms 95956 KB Output is correct
86 Correct 184 ms 13032 KB Output is correct
87 Correct 116 ms 17476 KB Output is correct
88 Correct 1198 ms 109376 KB Output is correct
89 Correct 1911 ms 94604 KB Output is correct
90 Correct 1183 ms 118068 KB Output is correct
91 Correct 1406 ms 95176 KB Output is correct
92 Correct 1409 ms 94912 KB Output is correct
93 Correct 2044 ms 132564 KB Output is correct
94 Correct 1625 ms 95896 KB Output is correct
95 Correct 1653 ms 95708 KB Output is correct
96 Correct 1926 ms 136444 KB Output is correct
97 Correct 904 ms 62088 KB Output is correct
98 Correct 943 ms 58692 KB Output is correct
99 Correct 1976 ms 96960 KB Output is correct
100 Correct 1943 ms 95820 KB Output is correct
101 Correct 1980 ms 96028 KB Output is correct
102 Correct 1951 ms 95552 KB Output is correct
103 Correct 2106 ms 140940 KB Output is correct
104 Correct 2106 ms 140496 KB Output is correct
105 Correct 1546 ms 68172 KB Output is correct
106 Correct 1242 ms 48396 KB Output is correct
107 Correct 1509 ms 74872 KB Output is correct
108 Correct 1994 ms 130308 KB Output is correct
109 Correct 1440 ms 133632 KB Output is correct