oj.uz

답안 #914004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914004 2024-01-20T18:21:24 Z VMaksimoski008 Railway (BOI17_railway) C++14
100 / 100
 94 ms 26124 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

const short LOG = 18;
const int maxn = 1e5 + 5;

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

    void config(int _n) {
        n = _n + 10;
        tree.resize(_n+60);
        val.resize(_n+60);
    }

    void add(int p, int v) {
        val[p] += 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); }
    void set(int p, int v) { add(p, v - val[p]); }
};

int n, m, k, timer = 0, i, j;
int depth[maxn+1], up[maxn+1][LOG], 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[u][i] = up[ up[u][i-1] ][i-1];

    for(int &v : graph[u]) {
        if(v == p) continue;
        depth[v] = depth[u] + 1;
        up[v][0] = 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[x][j];
    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[a][j] != up[b][j])
            a = up[a][j], b = up[b][j];

    return up[a][0];
}

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);

    for(pii &x : edges)
        if(depth[x.first] > depth[x.second]) swap(x.first, x.second);

    vector<int> edge_id(n+1);
    for(i=0; i<n-1; i++)
        edge_id[edges[i].second] = i+1;

    BIT bit;
    bit.config(2*n);

    while(m--) {
        int cnt;
        cin >> cnt;

        vector<int> v(cnt);
        for(int &x : v) cin >> x;

        sort(v.begin(), v.end(), [&](int a, int b) { return in[a] < in[b]; });
        v.push_back(v[0]);

        for(i=0; i<cnt; i++) {
            int 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 3420 KB Output is correct
3 Correct 5 ms 3420 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 5 ms 3928 KB Output is correct
7 Correct 5 ms 3420 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 5 ms 3416 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 3420 KB Output is correct
3 Correct 5 ms 3420 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 5 ms 3928 KB Output is correct
7 Correct 5 ms 3420 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 5 ms 3416 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 18 ms 3416 KB Output is correct
16 Correct 18 ms 3420 KB Output is correct
17 Correct 18 ms 3420 KB Output is correct
18 Correct 7 ms 4188 KB Output is correct
19 Correct 5 ms 3420 KB Output is correct
20 Correct 17 ms 3420 KB Output is correct
21 Correct 20 ms 3420 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 4 ms 3260 KB Output is correct
24 Correct 5 ms 3420 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 5 ms 3672 KB Output is correct
28 Correct 4 ms 3420 KB Output is correct
29 Correct 4 ms 3416 KB Output is correct
30 Correct 5 ms 3420 KB Output is correct
31 Correct 1 ms 2592 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 26000 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 92 ms 25284 KB Output is correct
4 Correct 69 ms 24720 KB Output is correct
5 Correct 78 ms 25820 KB Output is correct
6 Correct 82 ms 26040 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 20688 KB Output is correct
2 Correct 74 ms 17348 KB Output is correct
3 Correct 68 ms 16832 KB Output is correct
4 Correct 94 ms 16840 KB Output is correct
5 Correct 62 ms 16852 KB Output is correct
6 Correct 62 ms 20932 KB Output is correct
7 Correct 69 ms 20680 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 20688 KB Output is correct
2 Correct 74 ms 17348 KB Output is correct
3 Correct 68 ms 16832 KB Output is correct
4 Correct 94 ms 16840 KB Output is correct
5 Correct 62 ms 16852 KB Output is correct
6 Correct 62 ms 20932 KB Output is correct
7 Correct 69 ms 20680 KB Output is correct
8 Correct 83 ms 20948 KB Output is correct
9 Correct 67 ms 20936 KB Output is correct
10 Correct 69 ms 26008 KB Output is correct
11 Correct 75 ms 26124 KB Output is correct
12 Correct 71 ms 17352 KB Output is correct
13 Correct 57 ms 17348 KB Output is correct
14 Correct 62 ms 16836 KB Output is correct
15 Correct 65 ms 16828 KB Output is correct
16 Correct 73 ms 16836 KB Output is correct
17 Correct 66 ms 16840 KB Output is correct
18 Correct 62 ms 17012 KB Output is correct
19 Correct 68 ms 17352 KB Output is correct
20 Correct 67 ms 21176 KB Output is correct
21 Correct 64 ms 21444 KB Output is correct
22 Correct 70 ms 21012 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 3420 KB Output is correct
3 Correct 5 ms 3420 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 5 ms 3928 KB Output is correct
7 Correct 5 ms 3420 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 5 ms 3416 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 18 ms 3416 KB Output is correct
16 Correct 18 ms 3420 KB Output is correct
17 Correct 18 ms 3420 KB Output is correct
18 Correct 7 ms 4188 KB Output is correct
19 Correct 5 ms 3420 KB Output is correct
20 Correct 17 ms 3420 KB Output is correct
21 Correct 20 ms 3420 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 4 ms 3260 KB Output is correct
24 Correct 5 ms 3420 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 5 ms 3672 KB Output is correct
28 Correct 4 ms 3420 KB Output is correct
29 Correct 4 ms 3416 KB Output is correct
30 Correct 5 ms 3420 KB Output is correct
31 Correct 1 ms 2592 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 84 ms 26000 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 92 ms 25284 KB Output is correct
39 Correct 69 ms 24720 KB Output is correct
40 Correct 78 ms 25820 KB Output is correct
41 Correct 82 ms 26040 KB Output is correct
42 Correct 65 ms 20688 KB Output is correct
43 Correct 74 ms 17348 KB Output is correct
44 Correct 68 ms 16832 KB Output is correct
45 Correct 94 ms 16840 KB Output is correct
46 Correct 62 ms 16852 KB Output is correct
47 Correct 62 ms 20932 KB Output is correct
48 Correct 69 ms 20680 KB Output is correct
49 Correct 83 ms 20948 KB Output is correct
50 Correct 67 ms 20936 KB Output is correct
51 Correct 69 ms 26008 KB Output is correct
52 Correct 75 ms 26124 KB Output is correct
53 Correct 71 ms 17352 KB Output is correct
54 Correct 57 ms 17348 KB Output is correct
55 Correct 62 ms 16836 KB Output is correct
56 Correct 65 ms 16828 KB Output is correct
57 Correct 73 ms 16836 KB Output is correct
58 Correct 66 ms 16840 KB Output is correct
59 Correct 62 ms 17012 KB Output is correct
60 Correct 68 ms 17352 KB Output is correct
61 Correct 67 ms 21176 KB Output is correct
62 Correct 64 ms 21444 KB Output is correct
63 Correct 70 ms 21012 KB Output is correct
64 Correct 77 ms 21088 KB Output is correct
65 Correct 93 ms 16828 KB Output is correct
66 Correct 71 ms 17000 KB Output is correct
67 Correct 67 ms 16872 KB Output is correct
68 Correct 59 ms 17336 KB Output is correct
69 Correct 46 ms 17356 KB Output is correct
70 Correct 68 ms 21444 KB Output is correct
71 Correct 73 ms 20828 KB Output is correct
72 Correct 1 ms 2396 KB Output is correct
73 Correct 6 ms 3420 KB Output is correct
74 Correct 4 ms 3420 KB Output is correct
75 Correct 1 ms 2396 KB Output is correct
76 Correct 1 ms 2392 KB Output is correct
77 Correct 5 ms 3676 KB Output is correct
78 Correct 4 ms 3420 KB Output is correct
79 Correct 4 ms 3420 KB Output is correct
80 Correct 4 ms 3420 KB Output is correct
81 Correct 1 ms 2396 KB Output is correct
82 Correct 1 ms 2396 KB Output is correct
83 Correct 1 ms 2396 KB Output is correct
84 Correct 1 ms 2396 KB Output is correct
85 Correct 1 ms 2648 KB Output is correct
86 Correct 18 ms 3672 KB Output is correct
87 Correct 22 ms 3672 KB Output is correct
88 Correct 18 ms 3420 KB Output is correct
89 Correct 5 ms 3676 KB Output is correct
90 Correct 5 ms 3672 KB Output is correct
91 Correct 18 ms 3420 KB Output is correct
92 Correct 23 ms 3420 KB Output is correct
93 Correct 1 ms 2392 KB Output is correct
94 Correct 74 ms 25888 KB Output is correct
95 Correct 77 ms 25224 KB Output is correct
96 Correct 94 ms 24740 KB Output is correct
97 Correct 94 ms 26044 KB Output is correct
98 Correct 75 ms 26056 KB Output is correct
99 Correct 73 ms 16840 KB Output is correct
100 Correct 83 ms 17092 KB Output is correct
101 Correct 82 ms 17012 KB Output is correct
102 Correct 63 ms 17240 KB Output is correct
103 Correct 61 ms 20828 KB Output is correct
104 Correct 64 ms 21212 KB Output is correct
105 Correct 75 ms 20836 KB Output is correct
106 Correct 64 ms 21044 KB Output is correct
107 Correct 71 ms 20932 KB Output is correct
108 Correct 72 ms 26052 KB Output is correct
109 Correct 73 ms 26052 KB Output is correct
110 Correct 57 ms 17228 KB Output is correct
111 Correct 68 ms 17352 KB Output is correct
112 Correct 68 ms 16840 KB Output is correct
113 Correct 63 ms 16840 KB Output is correct