oj.uz

Submission #340129

# Submission time Handle Problem Language Result Execution time Memory
340129 2020-12-27T01:13:11 Z rocks03 Bridges (APIO19_bridges) C++14
100 / 100
 2309 ms 5624 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct Edge{
    int u, v, w, i;
    bool operator<(const Edge& other) const{
        return w > other.w;
    };
};
struct Query1{
    int uj, uw, ut;
};
struct Query2{
    int qs, qw, qt;
    bool operator<(const Query2& other) const{
        return qw > other.qw;
    };
};

vector<int> p, sz;
vector<pii> rollback;
void init(int n){
    p.resize(n);
    iota(all(p), 0);
    sz.resize(n);
    fill(all(sz), 1);
    rollback.clear();
}
int find(int x){
    if(x == p[x]) return x;
    return find(p[x]);
}
bool unite(int a, int b){
    a = find(a), b = find(b);
    if(a == b) return false;
    if(sz[a] < sz[b]) swap(a, b);
    p[b] = a;
    sz[a] += sz[b];
    rollback.pb({a, b});
    return true;
}
void roll_back(){
    auto [a, b] = rollback.back();
    p[b] = b;
    sz[a] -= sz[b];
    rollback.pop_back();
}
int query(int x){
    x = find(x);
    return sz[x];
}

const int MAXM = 1e5+100;
const int MAXQ = 1e5+100;
int N, M, ans[MAXQ];
Edge e[MAXM], e2[MAXM];
bool used[MAXM];

void solve(){
    cin >> N >> M;
    for(int i = 0; i < M; i++){
        cin >> e2[i].u >> e2[i].v >> e2[i].w;
    }
    int Q; cin >> Q;
    const int BLOCK = 1000;
    vector<Query1> v1;
    vector<Query2> v2;
    for(int q = 0; q < Q; q += BLOCK){
        for(int i = 0; i < M; i++){
            e[i] = {e2[i].u, e2[i].v, e2[i].w, i};
        }
        sort(e, e+M);
        int l = q, r = min(Q, l + BLOCK) - 1;
        for(int i = l; i <= r; i++){
            int t; cin >> t;
            if(t == 1){
                int j, w;
                cin >> j >> w;
                --j;
                used[j] = true;
                v1.pb({j, w, i});
            } else if(t == 2){
                int s, w;
                cin >> s >> w;
                v2.pb({s, w, i});
            }
        }
        reverse(all(v1));
        sort(all(v2));
        int ind = 0;
        init(N + 1);
        for(auto [qs, qw, qt] : v2){
            while(ind < M && e[ind].w >= qw){
                if(!used[e[ind].i]){
                    unite(e[ind].u, e[ind].v);
                }
                ind++;
            }
            int cnt = 0;
            for(auto [uj, uw, ut] : v1){
                if(ut < qt){
                    if(used[uj]){
                        if(uw >= qw){
                            if(unite(e2[uj].u, e2[uj].v)){
                                cnt++;
                            }
                        }
                        used[uj] = false;
                    }
                }
            }
            for(auto [uj, uw, ut] : v1){
                if(used[uj]){
                    if(e2[uj].w >= qw){
                        if(unite(e2[uj].u, e2[uj].v)){
                            cnt++;
                        }
                    }
                    used[uj] = false;
                }
            }
            ans[qt] = query(qs);
            while(cnt--) roll_back();
            for(auto [uj, uw, ut] : v1){
                used[uj] = true;
            }
        }
        reverse(all(v1));
        for(auto [uj, uw, ut] : v1){
            e2[uj].w = uw;
            used[uj] = false;
        }
        v1.clear();
        v2.clear();
    }
    for(int i = 0; i < Q; i++){
        if(ans[i]){
            cout << ans[i] << "\n";
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Compilation message

bridges.cpp: In function 'void roll_back()':
bridges.cpp:52:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |     auto [a, b] = rollback.back();
      |          ^
bridges.cpp: In function 'void solve()':
bridges.cpp:101:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  101 |         for(auto [qs, qw, qt] : v2){
      |                  ^
bridges.cpp:109:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  109 |             for(auto [uj, uw, ut] : v1){
      |                      ^
bridges.cpp:121:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  121 |             for(auto [uj, uw, ut] : v1){
      |                      ^
bridges.cpp:133:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  133 |             for(auto [uj, uw, ut] : v1){
      |                      ^
bridges.cpp:138:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  138 |         for(auto [uj, uw, ut] : v1){
      |                  ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 43 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 25 ms 496 KB Output is correct
6 Correct 24 ms 492 KB Output is correct
7 Correct 28 ms 488 KB Output is correct
8 Correct 25 ms 492 KB Output is correct
9 Correct 28 ms 492 KB Output is correct
10 Correct 26 ms 492 KB Output is correct
11 Correct 26 ms 364 KB Output is correct
12 Correct 27 ms 492 KB Output is correct
13 Correct 33 ms 492 KB Output is correct
14 Correct 31 ms 492 KB Output is correct
15 Correct 28 ms 492 KB Output is correct
16 Correct 27 ms 492 KB Output is correct
17 Correct 27 ms 492 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1292 ms 3336 KB Output is correct
2 Correct 1346 ms 3436 KB Output is correct
3 Correct 1345 ms 3440 KB Output is correct
4 Correct 1424 ms 3436 KB Output is correct
5 Correct 1455 ms 3524 KB Output is correct
6 Correct 2222 ms 3608 KB Output is correct
7 Correct 2226 ms 3568 KB Output is correct
8 Correct 2218 ms 3604 KB Output is correct
9 Correct 38 ms 1004 KB Output is correct
10 Correct 1309 ms 3476 KB Output is correct
11 Correct 1207 ms 3492 KB Output is correct
12 Correct 1168 ms 3780 KB Output is correct
13 Correct 1207 ms 3440 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1084 ms 2740 KB Output is correct
2 Correct 900 ms 1484 KB Output is correct
3 Correct 1304 ms 2796 KB Output is correct
4 Correct 1053 ms 2624 KB Output is correct
5 Correct 38 ms 1004 KB Output is correct
6 Correct 1222 ms 2628 KB Output is correct
7 Correct 1022 ms 2816 KB Output is correct
8 Correct 887 ms 2672 KB Output is correct
9 Correct 670 ms 2836 KB Output is correct
10 Correct 605 ms 2728 KB Output is correct
11 Correct 697 ms 2548 KB Output is correct
12 Correct 627 ms 2556 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1343 ms 5384 KB Output is correct
2 Correct 42 ms 1004 KB Output is correct
3 Correct 144 ms 3576 KB Output is correct
4 Correct 83 ms 3644 KB Output is correct
5 Correct 753 ms 5488 KB Output is correct
6 Correct 1441 ms 5268 KB Output is correct
7 Correct 752 ms 5360 KB Output is correct
8 Correct 662 ms 3440 KB Output is correct
9 Correct 621 ms 3568 KB Output is correct
10 Correct 639 ms 3696 KB Output is correct
11 Correct 988 ms 4484 KB Output is correct
12 Correct 975 ms 4336 KB Output is correct
13 Correct 1008 ms 4560 KB Output is correct
14 Correct 725 ms 5360 KB Output is correct
15 Correct 742 ms 5540 KB Output is correct
16 Correct 1362 ms 5624 KB Output is correct
17 Correct 1386 ms 5184 KB Output is correct
18 Correct 1402 ms 5276 KB Output is correct
19 Correct 1344 ms 5160 KB Output is correct
20 Correct 1125 ms 4852 KB Output is correct
21 Correct 1132 ms 4848 KB Output is correct
22 Correct 1302 ms 5232 KB Output is correct
23 Correct 754 ms 4848 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1292 ms 3336 KB Output is correct
2 Correct 1346 ms 3436 KB Output is correct
3 Correct 1345 ms 3440 KB Output is correct
4 Correct 1424 ms 3436 KB Output is correct
5 Correct 1455 ms 3524 KB Output is correct
6 Correct 2222 ms 3608 KB Output is correct
7 Correct 2226 ms 3568 KB Output is correct
8 Correct 2218 ms 3604 KB Output is correct
9 Correct 38 ms 1004 KB Output is correct
10 Correct 1309 ms 3476 KB Output is correct
11 Correct 1207 ms 3492 KB Output is correct
12 Correct 1168 ms 3780 KB Output is correct
13 Correct 1207 ms 3440 KB Output is correct
14 Correct 1084 ms 2740 KB Output is correct
15 Correct 900 ms 1484 KB Output is correct
16 Correct 1304 ms 2796 KB Output is correct
17 Correct 1053 ms 2624 KB Output is correct
18 Correct 38 ms 1004 KB Output is correct
19 Correct 1222 ms 2628 KB Output is correct
20 Correct 1022 ms 2816 KB Output is correct
21 Correct 887 ms 2672 KB Output is correct
22 Correct 670 ms 2836 KB Output is correct
23 Correct 605 ms 2728 KB Output is correct
24 Correct 697 ms 2548 KB Output is correct
25 Correct 627 ms 2556 KB Output is correct
26 Correct 1315 ms 3408 KB Output is correct
27 Correct 1724 ms 3636 KB Output is correct
28 Correct 1402 ms 3512 KB Output is correct
29 Correct 1034 ms 3496 KB Output is correct
30 Correct 1658 ms 3724 KB Output is correct
31 Correct 1696 ms 3564 KB Output is correct
32 Correct 1693 ms 3504 KB Output is correct
33 Correct 1351 ms 3692 KB Output is correct
34 Correct 1374 ms 3564 KB Output is correct
35 Correct 1387 ms 3436 KB Output is correct
36 Correct 1076 ms 3692 KB Output is correct
37 Correct 1061 ms 3436 KB Output is correct
38 Correct 1040 ms 3436 KB Output is correct
39 Correct 779 ms 3568 KB Output is correct
40 Correct 789 ms 3628 KB Output is correct
41 Correct 775 ms 3696 KB Output is correct
42 Correct 794 ms 3312 KB Output is correct
43 Correct 788 ms 3440 KB Output is correct
44 Correct 780 ms 3312 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 43 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 25 ms 496 KB Output is correct
6 Correct 24 ms 492 KB Output is correct
7 Correct 28 ms 488 KB Output is correct
8 Correct 25 ms 492 KB Output is correct
9 Correct 28 ms 492 KB Output is correct
10 Correct 26 ms 492 KB Output is correct
11 Correct 26 ms 364 KB Output is correct
12 Correct 27 ms 492 KB Output is correct
13 Correct 33 ms 492 KB Output is correct
14 Correct 31 ms 492 KB Output is correct
15 Correct 28 ms 492 KB Output is correct
16 Correct 27 ms 492 KB Output is correct
17 Correct 27 ms 492 KB Output is correct
18 Correct 1292 ms 3336 KB Output is correct
19 Correct 1346 ms 3436 KB Output is correct
20 Correct 1345 ms 3440 KB Output is correct
21 Correct 1424 ms 3436 KB Output is correct
22 Correct 1455 ms 3524 KB Output is correct
23 Correct 2222 ms 3608 KB Output is correct
24 Correct 2226 ms 3568 KB Output is correct
25 Correct 2218 ms 3604 KB Output is correct
26 Correct 38 ms 1004 KB Output is correct
27 Correct 1309 ms 3476 KB Output is correct
28 Correct 1207 ms 3492 KB Output is correct
29 Correct 1168 ms 3780 KB Output is correct
30 Correct 1207 ms 3440 KB Output is correct
31 Correct 1084 ms 2740 KB Output is correct
32 Correct 900 ms 1484 KB Output is correct
33 Correct 1304 ms 2796 KB Output is correct
34 Correct 1053 ms 2624 KB Output is correct
35 Correct 38 ms 1004 KB Output is correct
36 Correct 1222 ms 2628 KB Output is correct
37 Correct 1022 ms 2816 KB Output is correct
38 Correct 887 ms 2672 KB Output is correct
39 Correct 670 ms 2836 KB Output is correct
40 Correct 605 ms 2728 KB Output is correct
41 Correct 697 ms 2548 KB Output is correct
42 Correct 627 ms 2556 KB Output is correct
43 Correct 1343 ms 5384 KB Output is correct
44 Correct 42 ms 1004 KB Output is correct
45 Correct 144 ms 3576 KB Output is correct
46 Correct 83 ms 3644 KB Output is correct
47 Correct 753 ms 5488 KB Output is correct
48 Correct 1441 ms 5268 KB Output is correct
49 Correct 752 ms 5360 KB Output is correct
50 Correct 662 ms 3440 KB Output is correct
51 Correct 621 ms 3568 KB Output is correct
52 Correct 639 ms 3696 KB Output is correct
53 Correct 988 ms 4484 KB Output is correct
54 Correct 975 ms 4336 KB Output is correct
55 Correct 1008 ms 4560 KB Output is correct
56 Correct 725 ms 5360 KB Output is correct
57 Correct 742 ms 5540 KB Output is correct
58 Correct 1362 ms 5624 KB Output is correct
59 Correct 1386 ms 5184 KB Output is correct
60 Correct 1402 ms 5276 KB Output is correct
61 Correct 1344 ms 5160 KB Output is correct
62 Correct 1125 ms 4852 KB Output is correct
63 Correct 1132 ms 4848 KB Output is correct
64 Correct 1302 ms 5232 KB Output is correct
65 Correct 754 ms 4848 KB Output is correct
66 Correct 1315 ms 3408 KB Output is correct
67 Correct 1724 ms 3636 KB Output is correct
68 Correct 1402 ms 3512 KB Output is correct
69 Correct 1034 ms 3496 KB Output is correct
70 Correct 1658 ms 3724 KB Output is correct
71 Correct 1696 ms 3564 KB Output is correct
72 Correct 1693 ms 3504 KB Output is correct
73 Correct 1351 ms 3692 KB Output is correct
74 Correct 1374 ms 3564 KB Output is correct
75 Correct 1387 ms 3436 KB Output is correct
76 Correct 1076 ms 3692 KB Output is correct
77 Correct 1061 ms 3436 KB Output is correct
78 Correct 1040 ms 3436 KB Output is correct
79 Correct 779 ms 3568 KB Output is correct
80 Correct 789 ms 3628 KB Output is correct
81 Correct 775 ms 3696 KB Output is correct
82 Correct 794 ms 3312 KB Output is correct
83 Correct 788 ms 3440 KB Output is correct
84 Correct 780 ms 3312 KB Output is correct
85 Correct 1922 ms 5120 KB Output is correct
86 Correct 196 ms 3820 KB Output is correct
87 Correct 148 ms 3692 KB Output is correct
88 Correct 1403 ms 5112 KB Output is correct
89 Correct 1917 ms 5280 KB Output is correct
90 Correct 1401 ms 5360 KB Output is correct
91 Correct 1453 ms 3392 KB Output is correct
92 Correct 1430 ms 3704 KB Output is correct
93 Correct 2164 ms 3728 KB Output is correct
94 Correct 1725 ms 4280 KB Output is correct
95 Correct 1681 ms 4216 KB Output is correct
96 Correct 2145 ms 4356 KB Output is correct
97 Correct 989 ms 5360 KB Output is correct
98 Correct 1030 ms 5104 KB Output is correct
99 Correct 1988 ms 5140 KB Output is correct
100 Correct 1979 ms 5072 KB Output is correct
101 Correct 2023 ms 5228 KB Output is correct
102 Correct 1979 ms 5228 KB Output is correct
103 Correct 2303 ms 4860 KB Output is correct
104 Correct 2309 ms 4716 KB Output is correct
105 Correct 1557 ms 4720 KB Output is correct
106 Correct 1232 ms 4336 KB Output is correct
107 Correct 1453 ms 4848 KB Output is correct
108 Correct 2066 ms 5224 KB Output is correct
109 Correct 1630 ms 4460 KB Output is correct