oj.uz

Submission #914009

# Submission time Handle Problem Language Result Execution time Memory
914009 2024-01-20T18:33:14 Z VMaksimoski008 Railway (BOI17_railway) C++14
100 / 100
 99 ms 24268 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

const short LOG = 17;
const int maxn = 1e5 + 1;

struct BIT {
    int n;
    vector<int> tree;

    void config(int _n) {
        n = _n + 1;
        tree.resize(_n+1);
    }

    void add(int p, int v) {
        for(p++; p<n; p+=p&-p) tree[p] += v;
    }

    int sum(int p) {
        int ans = 0;
        for(p++; p>0; p-=p&-p) ans += tree[p];
        return ans;
    }

    int query(int l, int r) { return sum(r) - sum(l-1); }
};

int n, m, k, timer = 0, i, j;
int depth[maxn+1], up[LOG][maxn+1], in[maxn+1], out[maxn+1];
vector<vector<int> > graph;

void dfs(int u, int p) {
    in[u] = timer++;
    for(i=1; i<LOG; i++)
        up[i][u] = up[i-1][ up[i-1][u] ];

    for(int &v : graph[u]) {
        if(v == p) continue;
        depth[v] = depth[u] + 1;
        up[0][v] = u;
        dfs(v, u);
    }

    out[u] = timer;
}

int jmp(int x, int d) {
    for(j=LOG-1; j>=0; j--)
        if(d & (1 << j)) x = up[j][x];
    return x;
}

int get_lca(int a, int b) {
    if(depth[a] < depth[b]) swap(a, b);

    a = jmp(a, depth[a] - depth[b]);
    if(a == b) return a;
    for(j=LOG-1; j>=0; j--)
        if(up[j][a] != up[j][b])
            a = up[j][a], b = up[j][b];

    return up[0][a];
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m >> k;
    graph.resize(n+1);

    vector<pii> edges;
    
    for(i=0; i<n-1; i++) {
        int a, b;
        cin >> a >> b;
        edges.push_back({ a, b });
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    dfs(1, 0);

    int edge_id[n+1];
    for(i=0; i<n-1; i++) {
        if(depth[edges[i].first] > depth[edges[i].second]) swap(edges[i].first, edges[i].second);
        edge_id[edges[i].second] = i+1;
    }

    BIT bit;
    bit.config(n);

    int cnt, a, b, lca;
    int v[n+1];
    while(m--) {
        cin >> cnt;
        for(i=0; i<cnt; i++) cin >> v[i];

        sort(v, v + cnt, [&](int &u, int &v) { return in[u] < in[v]; });
        v[cnt] = v[0];

        for(i=0; i<cnt; i++) {
            a = v[i], b = v[i+1], lca = get_lca(a, b);
            bit.add(in[a], 1);
            bit.add(in[b], 1);
            bit.add(in[lca], -2);
        }
    }

    vector<int> ans;
    for(i=1; i<=n; i++)
        if(bit.query(in[i], out[i]-1) >= 2 * k) ans.push_back(edge_id[i]);

    cout << ans.size() << '\n';
    sort(ans.begin(), ans.end());
    for(int &x : ans) cout << x << " ";
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 6 ms 7516 KB Output is correct
3 Correct 5 ms 7516 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 7 ms 7772 KB Output is correct
7 Correct 5 ms 7512 KB Output is correct
8 Correct 6 ms 7516 KB Output is correct
9 Correct 6 ms 7516 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 6 ms 7516 KB Output is correct
3 Correct 5 ms 7516 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 7 ms 7772 KB Output is correct
7 Correct 5 ms 7512 KB Output is correct
8 Correct 6 ms 7516 KB Output is correct
9 Correct 6 ms 7516 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 18 ms 7512 KB Output is correct
16 Correct 26 ms 7516 KB Output is correct
17 Correct 23 ms 7516 KB Output is correct
18 Correct 8 ms 7772 KB Output is correct
19 Correct 7 ms 7516 KB Output is correct
20 Correct 18 ms 7600 KB Output is correct
21 Correct 26 ms 7516 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 5 ms 7672 KB Output is correct
24 Correct 4 ms 7516 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 6 ms 7912 KB Output is correct
28 Correct 5 ms 7512 KB Output is correct
29 Correct 4 ms 7516 KB Output is correct
30 Correct 5 ms 7512 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 23824 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 75 ms 23332 KB Output is correct
4 Correct 74 ms 22736 KB Output is correct
5 Correct 99 ms 24268 KB Output is correct
6 Correct 73 ms 24032 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 18868 KB Output is correct
2 Correct 57 ms 15812 KB Output is correct
3 Correct 58 ms 15824 KB Output is correct
4 Correct 74 ms 15816 KB Output is correct
5 Correct 83 ms 15688 KB Output is correct
6 Correct 64 ms 18884 KB Output is correct
7 Correct 59 ms 18956 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 18868 KB Output is correct
2 Correct 57 ms 15812 KB Output is correct
3 Correct 58 ms 15824 KB Output is correct
4 Correct 74 ms 15816 KB Output is correct
5 Correct 83 ms 15688 KB Output is correct
6 Correct 64 ms 18884 KB Output is correct
7 Correct 59 ms 18956 KB Output is correct
8 Correct 72 ms 18976 KB Output is correct
9 Correct 78 ms 18884 KB Output is correct
10 Correct 68 ms 24004 KB Output is correct
11 Correct 75 ms 24060 KB Output is correct
12 Correct 69 ms 15940 KB Output is correct
13 Correct 47 ms 16076 KB Output is correct
14 Correct 70 ms 15816 KB Output is correct
15 Correct 64 ms 15816 KB Output is correct
16 Correct 58 ms 15676 KB Output is correct
17 Correct 68 ms 15812 KB Output is correct
18 Correct 85 ms 15560 KB Output is correct
19 Correct 65 ms 15796 KB Output is correct
20 Correct 60 ms 19128 KB Output is correct
21 Correct 65 ms 19396 KB Output is correct
22 Correct 64 ms 19116 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 6 ms 7516 KB Output is correct
3 Correct 5 ms 7516 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 7 ms 7772 KB Output is correct
7 Correct 5 ms 7512 KB Output is correct
8 Correct 6 ms 7516 KB Output is correct
9 Correct 6 ms 7516 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 18 ms 7512 KB Output is correct
16 Correct 26 ms 7516 KB Output is correct
17 Correct 23 ms 7516 KB Output is correct
18 Correct 8 ms 7772 KB Output is correct
19 Correct 7 ms 7516 KB Output is correct
20 Correct 18 ms 7600 KB Output is correct
21 Correct 26 ms 7516 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 5 ms 7672 KB Output is correct
24 Correct 4 ms 7516 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 6 ms 7912 KB Output is correct
28 Correct 5 ms 7512 KB Output is correct
29 Correct 4 ms 7516 KB Output is correct
30 Correct 5 ms 7512 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 91 ms 23824 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 75 ms 23332 KB Output is correct
39 Correct 74 ms 22736 KB Output is correct
40 Correct 99 ms 24268 KB Output is correct
41 Correct 73 ms 24032 KB Output is correct
42 Correct 64 ms 18868 KB Output is correct
43 Correct 57 ms 15812 KB Output is correct
44 Correct 58 ms 15824 KB Output is correct
45 Correct 74 ms 15816 KB Output is correct
46 Correct 83 ms 15688 KB Output is correct
47 Correct 64 ms 18884 KB Output is correct
48 Correct 59 ms 18956 KB Output is correct
49 Correct 72 ms 18976 KB Output is correct
50 Correct 78 ms 18884 KB Output is correct
51 Correct 68 ms 24004 KB Output is correct
52 Correct 75 ms 24060 KB Output is correct
53 Correct 69 ms 15940 KB Output is correct
54 Correct 47 ms 16076 KB Output is correct
55 Correct 70 ms 15816 KB Output is correct
56 Correct 64 ms 15816 KB Output is correct
57 Correct 58 ms 15676 KB Output is correct
58 Correct 68 ms 15812 KB Output is correct
59 Correct 85 ms 15560 KB Output is correct
60 Correct 65 ms 15796 KB Output is correct
61 Correct 60 ms 19128 KB Output is correct
62 Correct 65 ms 19396 KB Output is correct
63 Correct 64 ms 19116 KB Output is correct
64 Correct 63 ms 19128 KB Output is correct
65 Correct 64 ms 15824 KB Output is correct
66 Correct 61 ms 15808 KB Output is correct
67 Correct 71 ms 15812 KB Output is correct
68 Correct 44 ms 16064 KB Output is correct
69 Correct 48 ms 16072 KB Output is correct
70 Correct 72 ms 19392 KB Output is correct
71 Correct 69 ms 18864 KB Output is correct
72 Correct 1 ms 6488 KB Output is correct
73 Correct 5 ms 7668 KB Output is correct
74 Correct 5 ms 7516 KB Output is correct
75 Correct 1 ms 6492 KB Output is correct
76 Correct 2 ms 6488 KB Output is correct
77 Correct 5 ms 7768 KB Output is correct
78 Correct 5 ms 7516 KB Output is correct
79 Correct 6 ms 7516 KB Output is correct
80 Correct 4 ms 7524 KB Output is correct
81 Correct 1 ms 6492 KB Output is correct
82 Correct 2 ms 6488 KB Output is correct
83 Correct 1 ms 6488 KB Output is correct
84 Correct 1 ms 6492 KB Output is correct
85 Correct 1 ms 6492 KB Output is correct
86 Correct 21 ms 7512 KB Output is correct
87 Correct 18 ms 7516 KB Output is correct
88 Correct 18 ms 7572 KB Output is correct
89 Correct 6 ms 7768 KB Output is correct
90 Correct 5 ms 7516 KB Output is correct
91 Correct 22 ms 7608 KB Output is correct
92 Correct 20 ms 7516 KB Output is correct
93 Correct 1 ms 6488 KB Output is correct
94 Correct 79 ms 24044 KB Output is correct
95 Correct 84 ms 23260 KB Output is correct
96 Correct 63 ms 22728 KB Output is correct
97 Correct 71 ms 24008 KB Output is correct
98 Correct 66 ms 24004 KB Output is correct
99 Correct 88 ms 15812 KB Output is correct
100 Correct 65 ms 15676 KB Output is correct
101 Correct 71 ms 15812 KB Output is correct
102 Correct 72 ms 15812 KB Output is correct
103 Correct 59 ms 18888 KB Output is correct
104 Correct 68 ms 19408 KB Output is correct
105 Correct 58 ms 18888 KB Output is correct
106 Correct 73 ms 19128 KB Output is correct
107 Correct 70 ms 18884 KB Output is correct
108 Correct 76 ms 24260 KB Output is correct
109 Correct 62 ms 24004 KB Output is correct
110 Correct 48 ms 16072 KB Output is correct
111 Correct 58 ms 16080 KB Output is correct
112 Correct 65 ms 15812 KB Output is correct
113 Correct 69 ms 15560 KB Output is correct