oj.uz

Submission #898054

# Submission time Handle Problem Language Result Execution time Memory
898054 2024-01-04T09:15:22 Z phoenix Bridges (APIO19_bridges) C++17
100 / 100
 1567 ms 23504 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 50000 + 10;
const int M = 100000 + 10;
const int Q = 100000 + 10;
const int B = 800;

struct DSU {
    vector<int> p;
    vector<int> r;
    void init(int n) {
        p.assign(n + 1, 0);
        r.assign(n + 1, 1);
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {
        return p[x] = (p[x] == x ? x : find(p[x]));
    }
    void unite(int u, int v) {
        u = find(u);
        v = find(v);
        if(u == v) return;
        if(r[u] < r[v]) swap(u, v);
        r[u] += r[v];
        p[v] = u;
    }
};

struct query {
    int s, w, i;
};
struct upd {
    int b, r, i;
};

int n, m, q_len;

int d[M + 1];
vector<pair<int, int>> edges = {{0, 0}};
vector<query> q[Q / B + 10];
vector<upd> u[Q / B + 10];

int MAX_W = 0;
vector<int> e_sorted[M + Q + 10];

void compress() {
    map<int, int> mp;
    for(int i = 1; i <= m; i++) 
        mp[d[i]] = 1;
    for(int i = 0; i <= (q_len - 1) / B; i++) {
        for(auto c : q[i]) 
            mp[c.w] = 1;
        for(auto c : u[i])
            mp[c.r] = 1;
    }
    for(auto &c : mp)
        c.second = MAX_W ++;
    for(int i = 1; i <= m; i++)
        d[i] = mp[d[i]];
    for(int i = 0; i <= (q_len - 1) / B; i++) {
        for(auto &c : q[i])
            c.w = mp[c.w];
        for(auto &c : u[i])
            c.r = mp[c.r];
    }
}

vector<int> g[N];
DSU ds;

bool vis[N];

int dfs(int s) {
    vis[s] = true;
    int res = ds.r[s];
    for(int to : g[s]) {
        if(vis[to]) continue;
        res += dfs(to);
    }
    return res;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    // freopen("test.txt", "r", stdin);
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v >> d[i];
        edges.push_back({u, v});
    }
    cin >> q_len;  
    vector<int> res(q_len, -1); 
    for(int i = 0; i < q_len; i++) {
        int type;
        cin >> type;
        if(type == 1) {
            int b, r;
            cin >> b >> r;
            u[i / B].push_back({b, r, i});
        } else {
            int s, w;
            cin >> s >> w;
            q[i / B].push_back({s, w, i});
        }   
    }
    compress();
    for(int buck = 0; buck <= (q_len - 1) / B; buck++) {
        int d_changed[m + 1] = {};
        bool is_changed[m + 1] = {};
        vector<int> changed;
        for(auto c : u[buck]) {
            if(!is_changed[c.b]) 
                changed.push_back(c.b);
            is_changed[c.b] = true;
            d_changed[c.b] = d[c.b];
        }

        for(int i = 1; i <= m; i++) {
            if(!is_changed[i]) {
                e_sorted[d[i]].push_back(i);
            }
        }
        sort(q[buck].begin(), q[buck].end(), [](query a, query b) {
            return (a.w > b.w);
        });   
        ds.init(n + 1);
        int cur_query = 0;
        for(int minw = MAX_W - 1; minw >= 0; minw--) {
            for(int e_i : e_sorted[minw]) 
                ds.unite(edges[e_i].first, edges[e_i].second);
            while(cur_query < (int)q[buck].size() && q[buck][cur_query].w >= minw) {
                auto [s, w, inx] = q[buck][cur_query];
                for(auto cur_up : u[buck]) {
                    if(cur_up.i > inx) break;
                    d_changed[cur_up.b] = cur_up.r;
                } 
                for(int e_i : changed) {
                    if(d_changed[e_i] < w) continue;
                    auto [u, v] = edges[e_i];
                    u = ds.find(u), v = ds.find(v);
                    g[u].push_back(v);
                    g[v].push_back(u);
                }
                s = ds.find(s);
                res[inx] = dfs(s);

                for(int e_i : changed) {
                    d_changed[e_i] = d[e_i];
                    auto [u, v] = edges[e_i];
                    u = ds.find(u), v = ds.find(v);
                    vis[u] = 0;
                    vis[v] = 0;
                    g[u].clear();
                    g[v].clear();
                }
                vis[s] = 0;

                cur_query++;
            }
            e_sorted[minw].clear();
        }
        for(auto upd : u[buck])
            d[upd.b] = upd.r;
    }
    
    for(int i = 0; i < q_len; i++) 
        if(res[i] != -1)
            cout << res[i] << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 34 ms 7604 KB Output is correct
4 Correct 8 ms 7516 KB Output is correct
5 Correct 13 ms 7260 KB Output is correct
6 Correct 11 ms 7240 KB Output is correct
7 Correct 12 ms 7004 KB Output is correct
8 Correct 14 ms 7512 KB Output is correct
9 Correct 13 ms 7004 KB Output is correct
10 Correct 14 ms 7512 KB Output is correct
11 Correct 14 ms 7516 KB Output is correct
12 Correct 15 ms 7560 KB Output is correct
13 Correct 17 ms 7420 KB Output is correct
14 Correct 17 ms 7516 KB Output is correct
15 Correct 18 ms 7516 KB Output is correct
16 Correct 11 ms 7004 KB Output is correct
17 Correct 11 ms 7004 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1031 ms 19364 KB Output is correct
2 Correct 999 ms 19152 KB Output is correct
3 Correct 1014 ms 19160 KB Output is correct
4 Correct 994 ms 19160 KB Output is correct
5 Correct 994 ms 19172 KB Output is correct
6 Correct 1256 ms 18164 KB Output is correct
7 Correct 1173 ms 18820 KB Output is correct
8 Correct 1144 ms 19128 KB Output is correct
9 Correct 109 ms 14684 KB Output is correct
10 Correct 715 ms 13052 KB Output is correct
11 Correct 624 ms 12756 KB Output is correct
12 Correct 657 ms 18492 KB Output is correct
13 Correct 787 ms 19296 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 805 ms 17756 KB Output is correct
2 Correct 606 ms 14420 KB Output is correct
3 Correct 864 ms 16568 KB Output is correct
4 Correct 835 ms 17880 KB Output is correct
5 Correct 118 ms 14680 KB Output is correct
6 Correct 832 ms 17588 KB Output is correct
7 Correct 761 ms 17736 KB Output is correct
8 Correct 742 ms 17620 KB Output is correct
9 Correct 496 ms 18144 KB Output is correct
10 Correct 497 ms 17868 KB Output is correct
11 Correct 562 ms 17776 KB Output is correct
12 Correct 565 ms 17788 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 891 ms 23500 KB Output is correct
2 Correct 109 ms 14672 KB Output is correct
3 Correct 117 ms 15048 KB Output is correct
4 Correct 35 ms 10956 KB Output is correct
5 Correct 266 ms 13776 KB Output is correct
6 Correct 890 ms 23360 KB Output is correct
7 Correct 270 ms 13520 KB Output is correct
8 Correct 530 ms 19152 KB Output is correct
9 Correct 546 ms 19180 KB Output is correct
10 Correct 452 ms 19400 KB Output is correct
11 Correct 790 ms 21580 KB Output is correct
12 Correct 762 ms 21472 KB Output is correct
13 Correct 660 ms 21204 KB Output is correct
14 Correct 274 ms 13676 KB Output is correct
15 Correct 263 ms 13740 KB Output is correct
16 Correct 954 ms 23348 KB Output is correct
17 Correct 978 ms 23376 KB Output is correct
18 Correct 1058 ms 23492 KB Output is correct
19 Correct 964 ms 23504 KB Output is correct
20 Correct 699 ms 22032 KB Output is correct
21 Correct 689 ms 21792 KB Output is correct
22 Correct 807 ms 23060 KB Output is correct
23 Correct 300 ms 13004 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1031 ms 19364 KB Output is correct
2 Correct 999 ms 19152 KB Output is correct
3 Correct 1014 ms 19160 KB Output is correct
4 Correct 994 ms 19160 KB Output is correct
5 Correct 994 ms 19172 KB Output is correct
6 Correct 1256 ms 18164 KB Output is correct
7 Correct 1173 ms 18820 KB Output is correct
8 Correct 1144 ms 19128 KB Output is correct
9 Correct 109 ms 14684 KB Output is correct
10 Correct 715 ms 13052 KB Output is correct
11 Correct 624 ms 12756 KB Output is correct
12 Correct 657 ms 18492 KB Output is correct
13 Correct 787 ms 19296 KB Output is correct
14 Correct 805 ms 17756 KB Output is correct
15 Correct 606 ms 14420 KB Output is correct
16 Correct 864 ms 16568 KB Output is correct
17 Correct 835 ms 17880 KB Output is correct
18 Correct 118 ms 14680 KB Output is correct
19 Correct 832 ms 17588 KB Output is correct
20 Correct 761 ms 17736 KB Output is correct
21 Correct 742 ms 17620 KB Output is correct
22 Correct 496 ms 18144 KB Output is correct
23 Correct 497 ms 17868 KB Output is correct
24 Correct 562 ms 17776 KB Output is correct
25 Correct 565 ms 17788 KB Output is correct
26 Correct 988 ms 19112 KB Output is correct
27 Correct 1102 ms 17728 KB Output is correct
28 Correct 1069 ms 19152 KB Output is correct
29 Correct 920 ms 19104 KB Output is correct
30 Correct 1132 ms 18408 KB Output is correct
31 Correct 1131 ms 18248 KB Output is correct
32 Correct 1129 ms 18200 KB Output is correct
33 Correct 1045 ms 19160 KB Output is correct
34 Correct 1004 ms 19152 KB Output is correct
35 Correct 1058 ms 19160 KB Output is correct
36 Correct 916 ms 18948 KB Output is correct
37 Correct 898 ms 19068 KB Output is correct
38 Correct 920 ms 19152 KB Output is correct
39 Correct 628 ms 19408 KB Output is correct
40 Correct 639 ms 19312 KB Output is correct
41 Correct 646 ms 19564 KB Output is correct
42 Correct 758 ms 19104 KB Output is correct
43 Correct 700 ms 19008 KB Output is correct
44 Correct 766 ms 19152 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 34 ms 7604 KB Output is correct
4 Correct 8 ms 7516 KB Output is correct
5 Correct 13 ms 7260 KB Output is correct
6 Correct 11 ms 7240 KB Output is correct
7 Correct 12 ms 7004 KB Output is correct
8 Correct 14 ms 7512 KB Output is correct
9 Correct 13 ms 7004 KB Output is correct
10 Correct 14 ms 7512 KB Output is correct
11 Correct 14 ms 7516 KB Output is correct
12 Correct 15 ms 7560 KB Output is correct
13 Correct 17 ms 7420 KB Output is correct
14 Correct 17 ms 7516 KB Output is correct
15 Correct 18 ms 7516 KB Output is correct
16 Correct 11 ms 7004 KB Output is correct
17 Correct 11 ms 7004 KB Output is correct
18 Correct 1031 ms 19364 KB Output is correct
19 Correct 999 ms 19152 KB Output is correct
20 Correct 1014 ms 19160 KB Output is correct
21 Correct 994 ms 19160 KB Output is correct
22 Correct 994 ms 19172 KB Output is correct
23 Correct 1256 ms 18164 KB Output is correct
24 Correct 1173 ms 18820 KB Output is correct
25 Correct 1144 ms 19128 KB Output is correct
26 Correct 109 ms 14684 KB Output is correct
27 Correct 715 ms 13052 KB Output is correct
28 Correct 624 ms 12756 KB Output is correct
29 Correct 657 ms 18492 KB Output is correct
30 Correct 787 ms 19296 KB Output is correct
31 Correct 805 ms 17756 KB Output is correct
32 Correct 606 ms 14420 KB Output is correct
33 Correct 864 ms 16568 KB Output is correct
34 Correct 835 ms 17880 KB Output is correct
35 Correct 118 ms 14680 KB Output is correct
36 Correct 832 ms 17588 KB Output is correct
37 Correct 761 ms 17736 KB Output is correct
38 Correct 742 ms 17620 KB Output is correct
39 Correct 496 ms 18144 KB Output is correct
40 Correct 497 ms 17868 KB Output is correct
41 Correct 562 ms 17776 KB Output is correct
42 Correct 565 ms 17788 KB Output is correct
43 Correct 891 ms 23500 KB Output is correct
44 Correct 109 ms 14672 KB Output is correct
45 Correct 117 ms 15048 KB Output is correct
46 Correct 35 ms 10956 KB Output is correct
47 Correct 266 ms 13776 KB Output is correct
48 Correct 890 ms 23360 KB Output is correct
49 Correct 270 ms 13520 KB Output is correct
50 Correct 530 ms 19152 KB Output is correct
51 Correct 546 ms 19180 KB Output is correct
52 Correct 452 ms 19400 KB Output is correct
53 Correct 790 ms 21580 KB Output is correct
54 Correct 762 ms 21472 KB Output is correct
55 Correct 660 ms 21204 KB Output is correct
56 Correct 274 ms 13676 KB Output is correct
57 Correct 263 ms 13740 KB Output is correct
58 Correct 954 ms 23348 KB Output is correct
59 Correct 978 ms 23376 KB Output is correct
60 Correct 1058 ms 23492 KB Output is correct
61 Correct 964 ms 23504 KB Output is correct
62 Correct 699 ms 22032 KB Output is correct
63 Correct 689 ms 21792 KB Output is correct
64 Correct 807 ms 23060 KB Output is correct
65 Correct 300 ms 13004 KB Output is correct
66 Correct 988 ms 19112 KB Output is correct
67 Correct 1102 ms 17728 KB Output is correct
68 Correct 1069 ms 19152 KB Output is correct
69 Correct 920 ms 19104 KB Output is correct
70 Correct 1132 ms 18408 KB Output is correct
71 Correct 1131 ms 18248 KB Output is correct
72 Correct 1129 ms 18200 KB Output is correct
73 Correct 1045 ms 19160 KB Output is correct
74 Correct 1004 ms 19152 KB Output is correct
75 Correct 1058 ms 19160 KB Output is correct
76 Correct 916 ms 18948 KB Output is correct
77 Correct 898 ms 19068 KB Output is correct
78 Correct 920 ms 19152 KB Output is correct
79 Correct 628 ms 19408 KB Output is correct
80 Correct 639 ms 19312 KB Output is correct
81 Correct 646 ms 19564 KB Output is correct
82 Correct 758 ms 19104 KB Output is correct
83 Correct 700 ms 19008 KB Output is correct
84 Correct 766 ms 19152 KB Output is correct
85 Correct 1392 ms 23268 KB Output is correct
86 Correct 163 ms 15308 KB Output is correct
87 Correct 79 ms 10952 KB Output is correct
88 Correct 733 ms 14088 KB Output is correct
89 Correct 1487 ms 23128 KB Output is correct
90 Correct 736 ms 14032 KB Output is correct
91 Correct 1061 ms 19048 KB Output is correct
92 Correct 1053 ms 19412 KB Output is correct
93 Correct 1127 ms 19016 KB Output is correct
94 Correct 1297 ms 21004 KB Output is correct
95 Correct 1397 ms 21164 KB Output is correct
96 Correct 1287 ms 21200 KB Output is correct
97 Correct 417 ms 13900 KB Output is correct
98 Correct 501 ms 14568 KB Output is correct
99 Correct 1468 ms 23028 KB Output is correct
100 Correct 1514 ms 23000 KB Output is correct
101 Correct 1567 ms 23248 KB Output is correct
102 Correct 1516 ms 23124 KB Output is correct
103 Correct 1328 ms 21724 KB Output is correct
104 Correct 1366 ms 21760 KB Output is correct
105 Correct 1031 ms 21864 KB Output is correct
106 Correct 907 ms 21336 KB Output is correct
107 Correct 899 ms 21964 KB Output is correct
108 Correct 1448 ms 22900 KB Output is correct
109 Correct 821 ms 12996 KB Output is correct