oj.uz

답안 #262142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
262142 2020-08-12T11:51:13 Z dolphingarlic Railway (BOI17_railway) C++14
100 / 100
 138 ms 23028 KB 
#include <bits/stdc++.h>
using namespace std;

int n, m, k;
vector<pair<int, int>> graph[100001];
int tin[100001], tout[100001], timer = 0, anc[100001][20], p_edge[100001];
int chosen[50001], bit[100001];

void dfs(int node = 1, int parent = 0) {
    tin[node] = ++timer;
    for (int i = 1; i < 20; i++) anc[node][i] = anc[anc[node][i - 1]][i - 1];
    for (pair<int, int> i : graph[node]) if (i.first != parent) {
        anc[i.first][0] = node;
        p_edge[i.first] = i.second;
        dfs(i.first, node);
    }
    tout[node] = timer;
}

bool is_ancestor(int a, int b) {
    return (tin[a] <= tin[b] && tout[a] >= tout[b]);
}

int lca(int a, int b) {
    if (is_ancestor(a, b)) return a;
    for (int i = 19; ~i; i--) {
        if (anc[a][i] && !is_ancestor(anc[a][i], b)) a = anc[a][i];
    }
    return anc[a][0];
}

void update(int pos, int val) {
    for (; pos <= n; pos += pos & (-pos)) bit[pos] += val;
}

int query(int a, int b) {
    int ans = 0;
    for (; b; b -= b & (-b)) ans += bit[b];
    for (a--; a; a -= a & (-a)) ans -= bit[a];
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back({b, i});
        graph[b].push_back({a, i});
    }
    dfs();
    while (m--) {
        int s, l;
        cin >> s;
        for (int i = 0; i < s; i++) cin >> chosen[i];
        sort(chosen, chosen + s, [](int A, int B) { return tin[A] < tin[B]; });
        chosen[s] = chosen[0];
        for (int i = 0; i < s; i++) {
            int l = lca(chosen[i], chosen[i + 1]);
            update(tin[chosen[i]], 1);
            update(tin[chosen[i + 1]], 1);
            update(tin[l], -2);
        }
    }
    vector<int> ans;
    for (int i = 2; i <= n; i++)
        if (query(tin[i], tout[i]) >= 2 * k)
            ans.push_back(p_edge[i]);
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (int i : ans) cout << i << ' ';
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:55:16: warning: unused variable 'l' [-Wunused-variable]
   55 |         int s, l;
      |                ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4096 KB Output is correct
3 Correct 7 ms 4096 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 3 ms 2688 KB Output is correct
6 Correct 11 ms 4480 KB Output is correct
7 Correct 8 ms 4224 KB Output is correct
8 Correct 7 ms 4096 KB Output is correct
9 Correct 8 ms 4096 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4096 KB Output is correct
3 Correct 7 ms 4096 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 3 ms 2688 KB Output is correct
6 Correct 11 ms 4480 KB Output is correct
7 Correct 8 ms 4224 KB Output is correct
8 Correct 7 ms 4096 KB Output is correct
9 Correct 8 ms 4096 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 23 ms 4480 KB Output is correct
16 Correct 23 ms 4480 KB Output is correct
17 Correct 24 ms 4608 KB Output is correct
18 Correct 8 ms 4480 KB Output is correct
19 Correct 8 ms 4256 KB Output is correct
20 Correct 24 ms 4728 KB Output is correct
21 Correct 27 ms 4608 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 8 ms 4096 KB Output is correct
24 Correct 7 ms 4096 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2816 KB Output is correct
27 Correct 9 ms 4608 KB Output is correct
28 Correct 10 ms 4224 KB Output is correct
29 Correct 9 ms 4096 KB Output is correct
30 Correct 7 ms 4096 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 22768 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 136 ms 22260 KB Output is correct
4 Correct 138 ms 21752 KB Output is correct
5 Correct 89 ms 22640 KB Output is correct
6 Correct 102 ms 23028 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 19576 KB Output is correct
2 Correct 121 ms 17528 KB Output is correct
3 Correct 106 ms 17400 KB Output is correct
4 Correct 104 ms 17528 KB Output is correct
5 Correct 104 ms 17528 KB Output is correct
6 Correct 97 ms 19704 KB Output is correct
7 Correct 95 ms 19704 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 19576 KB Output is correct
2 Correct 121 ms 17528 KB Output is correct
3 Correct 106 ms 17400 KB Output is correct
4 Correct 104 ms 17528 KB Output is correct
5 Correct 104 ms 17528 KB Output is correct
6 Correct 97 ms 19704 KB Output is correct
7 Correct 95 ms 19704 KB Output is correct
8 Correct 107 ms 20000 KB Output is correct
9 Correct 109 ms 20004 KB Output is correct
10 Correct 83 ms 22768 KB Output is correct
11 Correct 88 ms 22640 KB Output is correct
12 Correct 84 ms 17400 KB Output is correct
13 Correct 81 ms 17400 KB Output is correct
14 Correct 112 ms 17528 KB Output is correct
15 Correct 108 ms 17636 KB Output is correct
16 Correct 115 ms 17656 KB Output is correct
17 Correct 100 ms 17400 KB Output is correct
18 Correct 107 ms 17400 KB Output is correct
19 Correct 108 ms 17656 KB Output is correct
20 Correct 93 ms 19960 KB Output is correct
21 Correct 100 ms 20084 KB Output is correct
22 Correct 112 ms 19956 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 7 ms 4096 KB Output is correct
3 Correct 7 ms 4096 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 3 ms 2688 KB Output is correct
6 Correct 11 ms 4480 KB Output is correct
7 Correct 8 ms 4224 KB Output is correct
8 Correct 7 ms 4096 KB Output is correct
9 Correct 8 ms 4096 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2688 KB Output is correct
15 Correct 23 ms 4480 KB Output is correct
16 Correct 23 ms 4480 KB Output is correct
17 Correct 24 ms 4608 KB Output is correct
18 Correct 8 ms 4480 KB Output is correct
19 Correct 8 ms 4256 KB Output is correct
20 Correct 24 ms 4728 KB Output is correct
21 Correct 27 ms 4608 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 8 ms 4096 KB Output is correct
24 Correct 7 ms 4096 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2816 KB Output is correct
27 Correct 9 ms 4608 KB Output is correct
28 Correct 10 ms 4224 KB Output is correct
29 Correct 9 ms 4096 KB Output is correct
30 Correct 7 ms 4096 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 135 ms 22768 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 136 ms 22260 KB Output is correct
39 Correct 138 ms 21752 KB Output is correct
40 Correct 89 ms 22640 KB Output is correct
41 Correct 102 ms 23028 KB Output is correct
42 Correct 113 ms 19576 KB Output is correct
43 Correct 121 ms 17528 KB Output is correct
44 Correct 106 ms 17400 KB Output is correct
45 Correct 104 ms 17528 KB Output is correct
46 Correct 104 ms 17528 KB Output is correct
47 Correct 97 ms 19704 KB Output is correct
48 Correct 95 ms 19704 KB Output is correct
49 Correct 107 ms 20000 KB Output is correct
50 Correct 109 ms 20004 KB Output is correct
51 Correct 83 ms 22768 KB Output is correct
52 Correct 88 ms 22640 KB Output is correct
53 Correct 84 ms 17400 KB Output is correct
54 Correct 81 ms 17400 KB Output is correct
55 Correct 112 ms 17528 KB Output is correct
56 Correct 108 ms 17636 KB Output is correct
57 Correct 115 ms 17656 KB Output is correct
58 Correct 100 ms 17400 KB Output is correct
59 Correct 107 ms 17400 KB Output is correct
60 Correct 108 ms 17656 KB Output is correct
61 Correct 93 ms 19960 KB Output is correct
62 Correct 100 ms 20084 KB Output is correct
63 Correct 112 ms 19956 KB Output is correct
64 Correct 108 ms 20216 KB Output is correct
65 Correct 115 ms 17652 KB Output is correct
66 Correct 113 ms 17528 KB Output is correct
67 Correct 104 ms 17656 KB Output is correct
68 Correct 75 ms 17272 KB Output is correct
69 Correct 73 ms 17272 KB Output is correct
70 Correct 109 ms 20472 KB Output is correct
71 Correct 105 ms 19960 KB Output is correct
72 Correct 2 ms 2688 KB Output is correct
73 Correct 10 ms 4096 KB Output is correct
74 Correct 7 ms 4096 KB Output is correct
75 Correct 2 ms 2688 KB Output is correct
76 Correct 2 ms 2688 KB Output is correct
77 Correct 10 ms 4480 KB Output is correct
78 Correct 8 ms 4224 KB Output is correct
79 Correct 7 ms 4096 KB Output is correct
80 Correct 7 ms 4096 KB Output is correct
81 Correct 3 ms 2688 KB Output is correct
82 Correct 2 ms 2688 KB Output is correct
83 Correct 2 ms 2688 KB Output is correct
84 Correct 2 ms 2688 KB Output is correct
85 Correct 2 ms 2688 KB Output is correct
86 Correct 24 ms 4480 KB Output is correct
87 Correct 30 ms 4608 KB Output is correct
88 Correct 24 ms 4600 KB Output is correct
89 Correct 8 ms 4480 KB Output is correct
90 Correct 9 ms 4224 KB Output is correct
91 Correct 24 ms 4728 KB Output is correct
92 Correct 27 ms 4608 KB Output is correct
93 Correct 2 ms 2688 KB Output is correct
94 Correct 134 ms 22772 KB Output is correct
95 Correct 118 ms 22264 KB Output is correct
96 Correct 118 ms 21880 KB Output is correct
97 Correct 83 ms 22672 KB Output is correct
98 Correct 88 ms 22996 KB Output is correct
99 Correct 102 ms 17400 KB Output is correct
100 Correct 99 ms 17528 KB Output is correct
101 Correct 101 ms 17528 KB Output is correct
102 Correct 104 ms 17528 KB Output is correct
103 Correct 94 ms 19700 KB Output is correct
104 Correct 103 ms 20056 KB Output is correct
105 Correct 108 ms 19576 KB Output is correct
106 Correct 107 ms 20344 KB Output is correct
107 Correct 101 ms 19960 KB Output is correct
108 Correct 78 ms 22768 KB Output is correct
109 Correct 81 ms 22768 KB Output is correct
110 Correct 81 ms 17528 KB Output is correct
111 Correct 77 ms 17400 KB Output is correct
112 Correct 100 ms 17400 KB Output is correct
113 Correct 97 ms 17528 KB Output is correct