oj.uz

답안 #849447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849447 2023-09-14T15:43:47 Z ntkphong 다리 (APIO19_bridges) C++17
100 / 100
 1623 ms 9012 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1e5 + 10;
const int BLOCK = 1000;

struct DSU {
    int lab[mxN];
    vector<pair<int, int>> q;
    
    void reset(int n) {
        q.clear();
        for(int i = 1; i <= n; i ++) lab[i] = -1;
    }
    
    int get_root(int u) {
        return lab[u] < 0 ? u : get_root(lab[u]);
    }
    
    bool unite(int u, int v) {
        u = get_root(u);
        v = get_root(v);
        
        if(u == v) return false;
        if(lab[u] > lab[v]) swap(u, v);
        
        q.push_back({v, lab[v]});
        q.push_back({u, lab[u]});
        
        lab[u] += lab[v];
        lab[v] = u;
           
        return true;
    }
    
    void roll_back(int x) {
        while(q.size() > x) {
            int u = q.back().first;
            int vu = q.back().second;
            lab[u] = vu;
            q.pop_back();
        }
    }
    
    int get_size(int u) {
        u = get_root(u);
        return - lab[u];
    }
} F;

int n, m, q;
int u[mxN], v[mxN], w[mxN];

int t[mxN], a[mxN], b[mxN];
bool changed[mxN];
int ans[mxN];

int main() {
    
    cin.tie(nullptr)->sync_with_stdio(false);
    
    cin >> n >> m;
    
    for(int i = 1; i <= m; i ++) 
        cin >> u[i] >> v[i] >> w[i];
    
    cin >> q;
    
    for(int i = 1; i <= q; i ++) 
        cin >> t[i] >> a[i] >> b[i];
    
    for(int block = 0; block < BLOCK; block ++) {
        int l = block * BLOCK + 1;
        int r = min((block + 1) * BLOCK, q);
        F.reset(n);
        
        if(l > r) break ;
        
        vector<int> changes, ask;
        vector<int> edges;
        vector<vector<pair<int, int>>> adj(BLOCK + 10);
        
        for(int i = l; i <= r; i ++) {
            if(t[i] == 1) {
                changed[a[i]] = true;
                changes.push_back(a[i]);
            } else 
                ask.push_back(i);
        }
    
        for(int i = 1; i <= m; i ++) {
            if(changed[i]) continue ;
            edges.push_back(i);
        }
                
        for(int i = l; i <= r; i ++) {
            if(t[i] == 1) w[a[i]] = b[i];
            else {
                for(int x : changes) {
                    adj[i - l].push_back({x, w[x]});
                }  
            }
        }
        
        sort(ask.begin(), ask.end(), [&](const int &x, const int &y) {
            return b[x] > b[y]; 
        });
        
        sort(edges.begin(), edges.end(), [&](const int &x, const int &y) {
            return w[x] > w[y]; 
        });
        
        for(int i = 0, j = 0; i < ask.size(); i ++) {
            for(; j < edges.size() && w[edges[j]] >= b[ask[i]]; j ++) 
                F.unite(u[edges[j]], v[edges[j]]); 
            
            int curr = F.q.size();
            for(auto [x, y] : adj[ask[i] - l]) {
                if(y < b[ask[i]]) continue ;
                F.unite(u[x], v[x]);
            }
            
            ans[ask[i]] = F.get_size(a[ask[i]]);
            F.roll_back(curr);
        }
        
        for(int x : changes) changed[x] = false;
    }
    
    for(int i = 1; i <= q; i ++) if(t[i] == 2) cout << ans[i] << "\n";
    return 0;
}

Compilation message

bridges.cpp: In member function 'void DSU::roll_back(int)':
bridges.cpp:37:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         while(q.size() > x) {
      |               ~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:113:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |         for(int i = 0, j = 0; i < ask.size(); i ++) {
      |                               ~~^~~~~~~~~~~~
bridges.cpp:114:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             for(; j < edges.size() && w[edges[j]] >= b[ask[i]]; j ++)
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 45 ms 6328 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 45 ms 6168 KB Output is correct
6 Correct 39 ms 6440 KB Output is correct
7 Correct 42 ms 6400 KB Output is correct
8 Correct 48 ms 6392 KB Output is correct
9 Correct 45 ms 6488 KB Output is correct
10 Correct 46 ms 6408 KB Output is correct
11 Correct 47 ms 6480 KB Output is correct
12 Correct 54 ms 6464 KB Output is correct
13 Correct 51 ms 6292 KB Output is correct
14 Correct 49 ms 6164 KB Output is correct
15 Correct 54 ms 6232 KB Output is correct
16 Correct 46 ms 6372 KB Output is correct
17 Correct 47 ms 6476 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1000 ms 8012 KB Output is correct
2 Correct 1008 ms 8012 KB Output is correct
3 Correct 1016 ms 8528 KB Output is correct
4 Correct 1006 ms 8196 KB Output is correct
5 Correct 1010 ms 8180 KB Output is correct
6 Correct 1200 ms 8204 KB Output is correct
7 Correct 1192 ms 8024 KB Output is correct
8 Correct 1201 ms 8268 KB Output is correct
9 Correct 25 ms 2904 KB Output is correct
10 Correct 792 ms 8312 KB Output is correct
11 Correct 772 ms 8476 KB Output is correct
12 Correct 745 ms 5364 KB Output is correct
13 Correct 752 ms 5332 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 811 ms 7412 KB Output is correct
2 Correct 691 ms 7036 KB Output is correct
3 Correct 921 ms 7728 KB Output is correct
4 Correct 822 ms 7912 KB Output is correct
5 Correct 25 ms 2908 KB Output is correct
6 Correct 871 ms 7964 KB Output is correct
7 Correct 770 ms 7504 KB Output is correct
8 Correct 747 ms 7484 KB Output is correct
9 Correct 499 ms 5068 KB Output is correct
10 Correct 478 ms 4860 KB Output is correct
11 Correct 506 ms 4564 KB Output is correct
12 Correct 471 ms 4512 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1150 ms 5424 KB Output is correct
2 Correct 25 ms 2896 KB Output is correct
3 Correct 122 ms 4068 KB Output is correct
4 Correct 54 ms 4080 KB Output is correct
5 Correct 557 ms 5440 KB Output is correct
6 Correct 1115 ms 5684 KB Output is correct
7 Correct 555 ms 5656 KB Output is correct
8 Correct 525 ms 4372 KB Output is correct
9 Correct 514 ms 4364 KB Output is correct
10 Correct 516 ms 4548 KB Output is correct
11 Correct 843 ms 5136 KB Output is correct
12 Correct 831 ms 5096 KB Output is correct
13 Correct 856 ms 5152 KB Output is correct
14 Correct 497 ms 5636 KB Output is correct
15 Correct 542 ms 5184 KB Output is correct
16 Correct 1139 ms 5188 KB Output is correct
17 Correct 1160 ms 5616 KB Output is correct
18 Correct 1132 ms 5304 KB Output is correct
19 Correct 1149 ms 5528 KB Output is correct
20 Correct 953 ms 5368 KB Output is correct
21 Correct 948 ms 5184 KB Output is correct
22 Correct 1087 ms 5120 KB Output is correct
23 Correct 622 ms 5164 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1000 ms 8012 KB Output is correct
2 Correct 1008 ms 8012 KB Output is correct
3 Correct 1016 ms 8528 KB Output is correct
4 Correct 1006 ms 8196 KB Output is correct
5 Correct 1010 ms 8180 KB Output is correct
6 Correct 1200 ms 8204 KB Output is correct
7 Correct 1192 ms 8024 KB Output is correct
8 Correct 1201 ms 8268 KB Output is correct
9 Correct 25 ms 2904 KB Output is correct
10 Correct 792 ms 8312 KB Output is correct
11 Correct 772 ms 8476 KB Output is correct
12 Correct 745 ms 5364 KB Output is correct
13 Correct 752 ms 5332 KB Output is correct
14 Correct 811 ms 7412 KB Output is correct
15 Correct 691 ms 7036 KB Output is correct
16 Correct 921 ms 7728 KB Output is correct
17 Correct 822 ms 7912 KB Output is correct
18 Correct 25 ms 2908 KB Output is correct
19 Correct 871 ms 7964 KB Output is correct
20 Correct 770 ms 7504 KB Output is correct
21 Correct 747 ms 7484 KB Output is correct
22 Correct 499 ms 5068 KB Output is correct
23 Correct 478 ms 4860 KB Output is correct
24 Correct 506 ms 4564 KB Output is correct
25 Correct 471 ms 4512 KB Output is correct
26 Correct 991 ms 7988 KB Output is correct
27 Correct 1148 ms 8116 KB Output is correct
28 Correct 1020 ms 7972 KB Output is correct
29 Correct 874 ms 8012 KB Output is correct
30 Correct 1070 ms 8028 KB Output is correct
31 Correct 1108 ms 8300 KB Output is correct
32 Correct 1100 ms 8356 KB Output is correct
33 Correct 1018 ms 8240 KB Output is correct
34 Correct 1032 ms 8060 KB Output is correct
35 Correct 1020 ms 8060 KB Output is correct
36 Correct 908 ms 8400 KB Output is correct
37 Correct 909 ms 8228 KB Output is correct
38 Correct 902 ms 8284 KB Output is correct
39 Correct 644 ms 5720 KB Output is correct
40 Correct 636 ms 5768 KB Output is correct
41 Correct 653 ms 5600 KB Output is correct
42 Correct 649 ms 5040 KB Output is correct
43 Correct 649 ms 5144 KB Output is correct
44 Correct 648 ms 4980 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 45 ms 6328 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 45 ms 6168 KB Output is correct
6 Correct 39 ms 6440 KB Output is correct
7 Correct 42 ms 6400 KB Output is correct
8 Correct 48 ms 6392 KB Output is correct
9 Correct 45 ms 6488 KB Output is correct
10 Correct 46 ms 6408 KB Output is correct
11 Correct 47 ms 6480 KB Output is correct
12 Correct 54 ms 6464 KB Output is correct
13 Correct 51 ms 6292 KB Output is correct
14 Correct 49 ms 6164 KB Output is correct
15 Correct 54 ms 6232 KB Output is correct
16 Correct 46 ms 6372 KB Output is correct
17 Correct 47 ms 6476 KB Output is correct
18 Correct 1000 ms 8012 KB Output is correct
19 Correct 1008 ms 8012 KB Output is correct
20 Correct 1016 ms 8528 KB Output is correct
21 Correct 1006 ms 8196 KB Output is correct
22 Correct 1010 ms 8180 KB Output is correct
23 Correct 1200 ms 8204 KB Output is correct
24 Correct 1192 ms 8024 KB Output is correct
25 Correct 1201 ms 8268 KB Output is correct
26 Correct 25 ms 2904 KB Output is correct
27 Correct 792 ms 8312 KB Output is correct
28 Correct 772 ms 8476 KB Output is correct
29 Correct 745 ms 5364 KB Output is correct
30 Correct 752 ms 5332 KB Output is correct
31 Correct 811 ms 7412 KB Output is correct
32 Correct 691 ms 7036 KB Output is correct
33 Correct 921 ms 7728 KB Output is correct
34 Correct 822 ms 7912 KB Output is correct
35 Correct 25 ms 2908 KB Output is correct
36 Correct 871 ms 7964 KB Output is correct
37 Correct 770 ms 7504 KB Output is correct
38 Correct 747 ms 7484 KB Output is correct
39 Correct 499 ms 5068 KB Output is correct
40 Correct 478 ms 4860 KB Output is correct
41 Correct 506 ms 4564 KB Output is correct
42 Correct 471 ms 4512 KB Output is correct
43 Correct 1150 ms 5424 KB Output is correct
44 Correct 25 ms 2896 KB Output is correct
45 Correct 122 ms 4068 KB Output is correct
46 Correct 54 ms 4080 KB Output is correct
47 Correct 557 ms 5440 KB Output is correct
48 Correct 1115 ms 5684 KB Output is correct
49 Correct 555 ms 5656 KB Output is correct
50 Correct 525 ms 4372 KB Output is correct
51 Correct 514 ms 4364 KB Output is correct
52 Correct 516 ms 4548 KB Output is correct
53 Correct 843 ms 5136 KB Output is correct
54 Correct 831 ms 5096 KB Output is correct
55 Correct 856 ms 5152 KB Output is correct
56 Correct 497 ms 5636 KB Output is correct
57 Correct 542 ms 5184 KB Output is correct
58 Correct 1139 ms 5188 KB Output is correct
59 Correct 1160 ms 5616 KB Output is correct
60 Correct 1132 ms 5304 KB Output is correct
61 Correct 1149 ms 5528 KB Output is correct
62 Correct 953 ms 5368 KB Output is correct
63 Correct 948 ms 5184 KB Output is correct
64 Correct 1087 ms 5120 KB Output is correct
65 Correct 622 ms 5164 KB Output is correct
66 Correct 991 ms 7988 KB Output is correct
67 Correct 1148 ms 8116 KB Output is correct
68 Correct 1020 ms 7972 KB Output is correct
69 Correct 874 ms 8012 KB Output is correct
70 Correct 1070 ms 8028 KB Output is correct
71 Correct 1108 ms 8300 KB Output is correct
72 Correct 1100 ms 8356 KB Output is correct
73 Correct 1018 ms 8240 KB Output is correct
74 Correct 1032 ms 8060 KB Output is correct
75 Correct 1020 ms 8060 KB Output is correct
76 Correct 908 ms 8400 KB Output is correct
77 Correct 909 ms 8228 KB Output is correct
78 Correct 902 ms 8284 KB Output is correct
79 Correct 644 ms 5720 KB Output is correct
80 Correct 636 ms 5768 KB Output is correct
81 Correct 653 ms 5600 KB Output is correct
82 Correct 649 ms 5040 KB Output is correct
83 Correct 649 ms 5144 KB Output is correct
84 Correct 648 ms 4980 KB Output is correct
85 Correct 1577 ms 8796 KB Output is correct
86 Correct 155 ms 5708 KB Output is correct
87 Correct 95 ms 7504 KB Output is correct
88 Correct 978 ms 8940 KB Output is correct
89 Correct 1594 ms 8724 KB Output is correct
90 Correct 979 ms 8848 KB Output is correct
91 Correct 1041 ms 8216 KB Output is correct
92 Correct 1022 ms 8588 KB Output is correct
93 Correct 1194 ms 8224 KB Output is correct
94 Correct 1324 ms 8336 KB Output is correct
95 Correct 1303 ms 8476 KB Output is correct
96 Correct 1350 ms 8452 KB Output is correct
97 Correct 671 ms 5928 KB Output is correct
98 Correct 692 ms 5640 KB Output is correct
99 Correct 1597 ms 8524 KB Output is correct
100 Correct 1596 ms 8636 KB Output is correct
101 Correct 1623 ms 8828 KB Output is correct
102 Correct 1603 ms 8640 KB Output is correct
103 Correct 1468 ms 8444 KB Output is correct
104 Correct 1443 ms 8456 KB Output is correct
105 Correct 1128 ms 5804 KB Output is correct
106 Correct 926 ms 4964 KB Output is correct
107 Correct 1087 ms 5868 KB Output is correct
108 Correct 1532 ms 9012 KB Output is correct
109 Correct 1056 ms 8460 KB Output is correct