oj.uz

Submission #540294

# Submission time Handle Problem Language Result Execution time Memory
540294 2022-03-19T21:35:58 Z Olympia Railway (BOI17_railway) C++17
100 / 100
 391 ms 61864 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <limits.h>

using namespace std;
const int MOD = 1e9 + 9;

struct segmentTreePoint {
    vector<int> v;
    vector<int> vec;
    vector<int> addLater;

    void upd(int dum, int tl, int tr, int &l, int &r, int val) {
        if (tr < l || tl > r) {
            return;
        }
        if (tl >= l && tr <= r) {
            addLater[dum] += val;
            return;
        }
        int mid = (tl + tr) >> 1;
        dum = dum << 1;
        upd(dum, tl, mid, l, r, val);
        upd(dum + 1, mid + 1, tr, l, r, val);
    }

    void upd(int l, int r, int val) {
        upd(1, 0, v.size() - 1, l, r, val);
    }

    int get(int x) {
        int cur = x + v.size();
        int ans = 0;
        while (true) {
            ans += addLater[cur];
            if (cur == 0) {
                break;
            }
            cur /= 2;
        }
        return ans;
    }

    void resz(int n) {
        v.resize((1 << (int) ceil(log2(n))));
        vec.resize(v.size() * 2);
        addLater.resize(v.size() * 2);
    }

};
class HeavyLightDecomposition {
public:
    vector<vector<int>> adj;
    vector<int> sub;
    vector<int> id;
    vector<int> topchain;
    vector<int> depth;
    vector<int> parent;
    segmentTreePoint st;
    vector<vector<int>> dp;
    vector<int> en;
    vector<int> ex;
    int cntr = 0;
    const int lg2 = 30;

    void add_edge(int u, int v) {
        adj[u].push_back(v), adj[v].push_back(u);
    }

    void rec(int curNode, int prevNode) {
        parent[curNode] = prevNode;
        en[curNode] = cntr++;
        if (prevNode != -1) {
            depth[curNode] = depth[prevNode] + 1;
        } else {
            depth[curNode] = 0;
        }
        sub[curNode] = 1;
        for (int i: adj[curNode]) {
            if (i != prevNode) {
                rec(i, curNode);
                sub[curNode] += sub[i];
            }
        }
        ex[curNode] = cntr++;
    }

    HeavyLightDecomposition(int n) {
        adj.resize(n);
        sub.resize(n);
        id.resize(n);
        topchain.assign(n, -1);
        parent.resize(n);
        st.resz(n + 1);
        ex.resize(n), en.resize(n);
    }

    void dfs(int curNode, int prevNode) {
        id[curNode] = cntr++;
        vector<pair<int, int>> vec;
        for (int i: adj[curNode]) {
            if (i != prevNode) {
                vec.push_back({sub[i], i});
            }
        }
        dp[curNode].resize(32);
        dp[curNode][0] = max(prevNode, 0);
        for (int i = 1; i < dp[curNode].size(); i++) {
            dp[curNode][i] = dp[dp[curNode][i - 1]][i - 1];
        }
        if (!vec.empty()) {
            sort(vec.begin(), vec.end());
            reverse(vec.begin(), vec.end());
            topchain[vec[0].second] = topchain[curNode];
            for (int i = 1; i < vec.size(); i++) {
                topchain[vec[i].second] = vec[i].second;
            }
            for (auto &p: vec) {
                dfs(p.second, curNode);
            }
        }
    }

    void increment (int a, int b) {
        if (topchain[a] == topchain[b]) {
            st.upd(id[b] + 1, id[a], 1);
            return;
        }
        if (topchain[a] != a) {
            increment(topchain[a], b);
            st.upd(id[topchain[a]] + 1, id[a], 1);
        } else {
            increment(parent[a], b);
            st.upd(id[a], id[a], 1);
        }
    }

    bool isAncestor(int u, int v) {
        return (en[u] <= en[v] && ex[u] >= ex[v]);
    }

    int lca(int u, int v) {
        if (isAncestor(u, v)) {
            return u;
        }
        if (isAncestor(v, u)) {
            return v;
        }
        for (int i = lg2; i >= 0; i--) {
            if (!isAncestor(dp[u][i], v)) {
                u = dp[u][i];
            }
        }
        return dp[u][0];
    }

    void read () {
        depth.resize(adj.size());
        dp.resize(adj.size());
        rec(0, -1); //fill in all of the subtrees
        topchain[0] = 0;
        cntr = 0;
        dfs(0, -1); //fill in all of the ids and stuff
    }
};


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M, K;
    cin >> N >> M >> K;
    vector<pair<int,int>> paths;
    HeavyLightDecomposition hld(N);
    map<pair<int,int>,int> myMap;
    for (int i = 0; i < N - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        myMap[{u, v}] = myMap[{v, u}] = i;
        hld.add_edge(u, v);
    }
    hld.read();
    while (M--) {
        int sz; cin >> sz;
        vector<pair<int,int>> nodes(sz);
        for (int i = 0; i < sz; i++) {
            int x; cin >> x; x--;
            nodes[i] = {hld.en[x], x};
        }
        sort(nodes.begin(), nodes.end());
        for (int i = 0; i < nodes.size(); i++) {
            if (hld.isAncestor(nodes[(i + 1) % nodes.size()].second, nodes[i].second)) {
                paths.emplace_back(nodes[(i + 1) % nodes.size()].second, nodes[i].second);
            } else if (hld.isAncestor(nodes[i].second, nodes[(i + 1) % nodes.size()].second)) {
                paths.emplace_back(nodes[i].second, nodes[(i + 1) % nodes.size()].second);
            } else {
                int l = hld.lca(nodes[i].second, nodes[(i + 1) % nodes.size()].second);
                paths.emplace_back(l, nodes[i].second);
                paths.emplace_back(l,nodes[(i + 1) % nodes.size()].second);
                //hld.st.upd(hld.id[l], hld.id[l], -1);
            }
        }
    }
    for (auto& p: paths) {
        hld.increment(p.second, p.first);
    }
    vector<int> ans;
    for (int i = 0; i < hld.adj.size(); i++) {
        int x = hld.st.get(hld.id[i]);
        if (x / 2 >= K) {
            ans.push_back(myMap[{i, hld.parent[i]}] + 1);
        }
    }
    cout << ans.size() << '\n';
    sort(ans.begin(), ans.end());
    for (int i: ans) {
        cout << i << " ";
    }
}

Compilation message

railway.cpp: In member function 'void HeavyLightDecomposition::dfs(int, int)':
railway.cpp:117:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         for (int i = 1; i < dp[curNode].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~
railway.cpp:124:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |             for (int i = 1; i < vec.size(); i++) {
      |                             ~~^~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:201:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  201 |         for (int i = 0; i < nodes.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
railway.cpp:218:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  218 |     for (int i = 0; i < hld.adj.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 13 ms 4496 KB Output is correct
3 Correct 14 ms 4480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 14 ms 5372 KB Output is correct
7 Correct 14 ms 4716 KB Output is correct
8 Correct 14 ms 4484 KB Output is correct
9 Correct 13 ms 4484 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 13 ms 4496 KB Output is correct
3 Correct 14 ms 4480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 14 ms 5372 KB Output is correct
7 Correct 14 ms 4716 KB Output is correct
8 Correct 14 ms 4484 KB Output is correct
9 Correct 13 ms 4484 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 55 ms 5992 KB Output is correct
16 Correct 56 ms 5960 KB Output is correct
17 Correct 57 ms 5924 KB Output is correct
18 Correct 16 ms 5476 KB Output is correct
19 Correct 14 ms 4648 KB Output is correct
20 Correct 53 ms 7120 KB Output is correct
21 Correct 54 ms 7132 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 13 ms 4564 KB Output is correct
24 Correct 14 ms 4436 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 14 ms 5368 KB Output is correct
28 Correct 14 ms 4692 KB Output is correct
29 Correct 12 ms 4576 KB Output is correct
30 Correct 13 ms 4524 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 1 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 59368 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 179 ms 58708 KB Output is correct
4 Correct 168 ms 58436 KB Output is correct
5 Correct 188 ms 59416 KB Output is correct
6 Correct 189 ms 59908 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 50972 KB Output is correct
2 Correct 283 ms 43240 KB Output is correct
3 Correct 288 ms 42292 KB Output is correct
4 Correct 326 ms 42308 KB Output is correct
5 Correct 319 ms 42304 KB Output is correct
6 Correct 226 ms 50976 KB Output is correct
7 Correct 229 ms 49948 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 50972 KB Output is correct
2 Correct 283 ms 43240 KB Output is correct
3 Correct 288 ms 42292 KB Output is correct
4 Correct 326 ms 42308 KB Output is correct
5 Correct 319 ms 42304 KB Output is correct
6 Correct 226 ms 50976 KB Output is correct
7 Correct 229 ms 49948 KB Output is correct
8 Correct 246 ms 50880 KB Output is correct
9 Correct 260 ms 52888 KB Output is correct
10 Correct 189 ms 61252 KB Output is correct
11 Correct 189 ms 61168 KB Output is correct
12 Correct 196 ms 44124 KB Output is correct
13 Correct 193 ms 44092 KB Output is correct
14 Correct 287 ms 44028 KB Output is correct
15 Correct 288 ms 44080 KB Output is correct
16 Correct 326 ms 44132 KB Output is correct
17 Correct 337 ms 44076 KB Output is correct
18 Correct 318 ms 44160 KB Output is correct
19 Correct 265 ms 45200 KB Output is correct
20 Correct 231 ms 52796 KB Output is correct
21 Correct 240 ms 52780 KB Output is correct
22 Correct 238 ms 52736 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 13 ms 4496 KB Output is correct
3 Correct 14 ms 4480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 14 ms 5372 KB Output is correct
7 Correct 14 ms 4716 KB Output is correct
8 Correct 14 ms 4484 KB Output is correct
9 Correct 13 ms 4484 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 55 ms 5992 KB Output is correct
16 Correct 56 ms 5960 KB Output is correct
17 Correct 57 ms 5924 KB Output is correct
18 Correct 16 ms 5476 KB Output is correct
19 Correct 14 ms 4648 KB Output is correct
20 Correct 53 ms 7120 KB Output is correct
21 Correct 54 ms 7132 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 13 ms 4564 KB Output is correct
24 Correct 14 ms 4436 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 14 ms 5368 KB Output is correct
28 Correct 14 ms 4692 KB Output is correct
29 Correct 12 ms 4576 KB Output is correct
30 Correct 13 ms 4524 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 191 ms 59368 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 179 ms 58708 KB Output is correct
39 Correct 168 ms 58436 KB Output is correct
40 Correct 188 ms 59416 KB Output is correct
41 Correct 189 ms 59908 KB Output is correct
42 Correct 232 ms 50972 KB Output is correct
43 Correct 283 ms 43240 KB Output is correct
44 Correct 288 ms 42292 KB Output is correct
45 Correct 326 ms 42308 KB Output is correct
46 Correct 319 ms 42304 KB Output is correct
47 Correct 226 ms 50976 KB Output is correct
48 Correct 229 ms 49948 KB Output is correct
49 Correct 246 ms 50880 KB Output is correct
50 Correct 260 ms 52888 KB Output is correct
51 Correct 189 ms 61252 KB Output is correct
52 Correct 189 ms 61168 KB Output is correct
53 Correct 196 ms 44124 KB Output is correct
54 Correct 193 ms 44092 KB Output is correct
55 Correct 287 ms 44028 KB Output is correct
56 Correct 288 ms 44080 KB Output is correct
57 Correct 326 ms 44132 KB Output is correct
58 Correct 337 ms 44076 KB Output is correct
59 Correct 318 ms 44160 KB Output is correct
60 Correct 265 ms 45200 KB Output is correct
61 Correct 231 ms 52796 KB Output is correct
62 Correct 240 ms 52780 KB Output is correct
63 Correct 238 ms 52736 KB Output is correct
64 Correct 250 ms 52800 KB Output is correct
65 Correct 391 ms 44104 KB Output is correct
66 Correct 382 ms 43964 KB Output is correct
67 Correct 337 ms 44052 KB Output is correct
68 Correct 214 ms 42920 KB Output is correct
69 Correct 199 ms 42940 KB Output is correct
70 Correct 255 ms 52756 KB Output is correct
71 Correct 261 ms 52656 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 15 ms 4504 KB Output is correct
74 Correct 13 ms 4436 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 15 ms 5456 KB Output is correct
78 Correct 14 ms 4692 KB Output is correct
79 Correct 12 ms 4444 KB Output is correct
80 Correct 13 ms 4472 KB Output is correct
81 Correct 1 ms 316 KB Output is correct
82 Correct 1 ms 316 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 324 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 53 ms 5972 KB Output is correct
87 Correct 55 ms 5908 KB Output is correct
88 Correct 55 ms 5968 KB Output is correct
89 Correct 14 ms 5396 KB Output is correct
90 Correct 15 ms 4740 KB Output is correct
91 Correct 55 ms 7164 KB Output is correct
92 Correct 55 ms 7060 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 201 ms 61260 KB Output is correct
95 Correct 191 ms 60584 KB Output is correct
96 Correct 177 ms 60256 KB Output is correct
97 Correct 194 ms 61132 KB Output is correct
98 Correct 197 ms 61864 KB Output is correct
99 Correct 350 ms 44132 KB Output is correct
100 Correct 365 ms 44056 KB Output is correct
101 Correct 345 ms 44108 KB Output is correct
102 Correct 281 ms 45048 KB Output is correct
103 Correct 229 ms 52736 KB Output is correct
104 Correct 243 ms 52800 KB Output is correct
105 Correct 242 ms 52808 KB Output is correct
106 Correct 277 ms 52744 KB Output is correct
107 Correct 253 ms 52676 KB Output is correct
108 Correct 198 ms 61252 KB Output is correct
109 Correct 189 ms 61324 KB Output is correct
110 Correct 199 ms 44152 KB Output is correct
111 Correct 224 ms 43988 KB Output is correct
112 Correct 315 ms 44100 KB Output is correct
113 Correct 344 ms 44096 KB Output is correct