oj.uz

답안 #688514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
688514 2023-01-27T15:51:37 Z stevancv Railway (BOI17_railway) C++14
100 / 100
 142 ms 37548 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const int inf = 1e9;
vector<array<int, 2>> g[N], ch[N];
vector<int> a[N], st[N], ans;
int par[N][17], in[N], out[N], tsz, k;
struct Bit {
    int bit[N];
    void Add(int x, int v) {
        for (; x < N; x += x & (-x)) bit[x] += v;
    }
    int Get(int x) {
        int ans = 0;
        for (; x > 0; x -= x & (-x)) ans += bit[x];
        return ans;
    }
}f;
void Dfs(int s, int e) {
    in[s] = ++tsz;
    par[s][0] = e;
    for (int i = 1; i < 17; i++) par[s][i] = par[par[s][i - 1]][i - 1];
    for (auto u : g[s]) {
        if (u[0] == e) continue;
        Dfs(u[0], s);
    }
    out[s] = tsz;
}
bool Ancestor(int u, int v) {
    return in[u] <= in[v] && out[v] <= out[u];
}
int Lca(int u, int v) {
    if (Ancestor(u, v)) return u;
    if (Ancestor(v, u)) return v;
    for (int i = 16; i >= 0; i--) {
        if (par[u][i] && !Ancestor(par[u][i], v)) u = par[u][i];
    }
    return par[u][0];
}
void Solve(int s, int e) {
    for (int u : st[s]) f.Add(in[a[u][0]], 1);
    for (auto u : ch[s]) {
        f.Add(in[a[u[0]][u[1]]], -1);
        if (u[1] < a[u[0]].size() - 1) f.Add(in[a[u[0]][u[1] + 1]], 1);
    }
    for (auto u : g[s]) {
        if (u[0] == e) continue;
        if (f.Get(out[u[0]]) - f.Get(in[u[0]] - 1) >= k) ans.push_back(u[1]);
        Solve(u[0], s);
    }
    for (int u : st[s]) f.Add(in[a[u][0]], -1);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, s;
    cin >> n >> s >> k;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back({v, i});
        g[v].push_back({u, i});
    }
    Dfs(1, 0);
    for (int i = 1; i <= s; i++) {
        int sz; cin >> sz;
        a[i].resize(sz);
        for (int j = 0; j < sz; j++) cin >> a[i][j];
        sort(a[i].begin(), a[i].end(), [&] (int ii, int jj) {
            return in[ii] < in[jj];
        });
        int lca = a[i][0];
        for (int j = 1; j < sz; j++) lca = Lca(lca, a[i][j]);
        st[lca].push_back(i);
        for (int j = 0; j < sz; j++) ch[a[i][j]].push_back({i, j});
    }
    Solve(1, 0);
    sort(ans.begin(), ans.end());
    cout << ans.size() << en;
    for (int u : ans) cout << u << sp;
    cout << en;
    return 0;
}

Compilation message

railway.cpp: In function 'void Solve(int, int)':
railway.cpp:50:18: warning: comparison of integer expressions of different signedness: 'std::array<int, 2>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         if (u[1] < a[u[0]].size() - 1) f.Add(in[a[u[0]][u[1] + 1]], 1);

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 12 ms 11140 KB Output is correct
3 Correct 10 ms 10964 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 11 ms 11528 KB Output is correct
7 Correct 11 ms 11152 KB Output is correct
8 Correct 9 ms 11012 KB Output is correct
9 Correct 10 ms 11092 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9724 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 12 ms 11140 KB Output is correct
3 Correct 10 ms 10964 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 11 ms 11528 KB Output is correct
7 Correct 11 ms 11152 KB Output is correct
8 Correct 9 ms 11012 KB Output is correct
9 Correct 10 ms 11092 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9724 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 27 ms 12716 KB Output is correct
16 Correct 33 ms 12816 KB Output is correct
17 Correct 26 ms 12756 KB Output is correct
18 Correct 10 ms 11544 KB Output is correct
19 Correct 10 ms 11164 KB Output is correct
20 Correct 28 ms 13380 KB Output is correct
21 Correct 29 ms 13260 KB Output is correct
22 Correct 5 ms 9716 KB Output is correct
23 Correct 9 ms 11012 KB Output is correct
24 Correct 10 ms 10964 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 10 ms 11604 KB Output is correct
28 Correct 10 ms 11092 KB Output is correct
29 Correct 11 ms 11184 KB Output is correct
30 Correct 10 ms 11092 KB Output is correct
31 Correct 5 ms 9720 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 37520 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 105 ms 37264 KB Output is correct
4 Correct 116 ms 36668 KB Output is correct
5 Correct 88 ms 35428 KB Output is correct
6 Correct 116 ms 36316 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 30244 KB Output is correct
2 Correct 114 ms 26144 KB Output is correct
3 Correct 102 ms 25724 KB Output is correct
4 Correct 103 ms 25864 KB Output is correct
5 Correct 108 ms 25896 KB Output is correct
6 Correct 91 ms 30444 KB Output is correct
7 Correct 93 ms 30480 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 30244 KB Output is correct
2 Correct 114 ms 26144 KB Output is correct
3 Correct 102 ms 25724 KB Output is correct
4 Correct 103 ms 25864 KB Output is correct
5 Correct 108 ms 25896 KB Output is correct
6 Correct 91 ms 30444 KB Output is correct
7 Correct 93 ms 30480 KB Output is correct
8 Correct 87 ms 30700 KB Output is correct
9 Correct 94 ms 30736 KB Output is correct
10 Correct 79 ms 35288 KB Output is correct
11 Correct 87 ms 35204 KB Output is correct
12 Correct 73 ms 25268 KB Output is correct
13 Correct 70 ms 25300 KB Output is correct
14 Correct 94 ms 24616 KB Output is correct
15 Correct 97 ms 24652 KB Output is correct
16 Correct 109 ms 25984 KB Output is correct
17 Correct 110 ms 25904 KB Output is correct
18 Correct 107 ms 25800 KB Output is correct
19 Correct 105 ms 26060 KB Output is correct
20 Correct 88 ms 30668 KB Output is correct
21 Correct 90 ms 30724 KB Output is correct
22 Correct 94 ms 30624 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9724 KB Output is correct
2 Correct 12 ms 11140 KB Output is correct
3 Correct 10 ms 10964 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 11 ms 11528 KB Output is correct
7 Correct 11 ms 11152 KB Output is correct
8 Correct 9 ms 11012 KB Output is correct
9 Correct 10 ms 11092 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9724 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 27 ms 12716 KB Output is correct
16 Correct 33 ms 12816 KB Output is correct
17 Correct 26 ms 12756 KB Output is correct
18 Correct 10 ms 11544 KB Output is correct
19 Correct 10 ms 11164 KB Output is correct
20 Correct 28 ms 13380 KB Output is correct
21 Correct 29 ms 13260 KB Output is correct
22 Correct 5 ms 9716 KB Output is correct
23 Correct 9 ms 11012 KB Output is correct
24 Correct 10 ms 10964 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 10 ms 11604 KB Output is correct
28 Correct 10 ms 11092 KB Output is correct
29 Correct 11 ms 11184 KB Output is correct
30 Correct 10 ms 11092 KB Output is correct
31 Correct 5 ms 9720 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 110 ms 37520 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 105 ms 37264 KB Output is correct
39 Correct 116 ms 36668 KB Output is correct
40 Correct 88 ms 35428 KB Output is correct
41 Correct 116 ms 36316 KB Output is correct
42 Correct 91 ms 30244 KB Output is correct
43 Correct 114 ms 26144 KB Output is correct
44 Correct 102 ms 25724 KB Output is correct
45 Correct 103 ms 25864 KB Output is correct
46 Correct 108 ms 25896 KB Output is correct
47 Correct 91 ms 30444 KB Output is correct
48 Correct 93 ms 30480 KB Output is correct
49 Correct 87 ms 30700 KB Output is correct
50 Correct 94 ms 30736 KB Output is correct
51 Correct 79 ms 35288 KB Output is correct
52 Correct 87 ms 35204 KB Output is correct
53 Correct 73 ms 25268 KB Output is correct
54 Correct 70 ms 25300 KB Output is correct
55 Correct 94 ms 24616 KB Output is correct
56 Correct 97 ms 24652 KB Output is correct
57 Correct 109 ms 25984 KB Output is correct
58 Correct 110 ms 25904 KB Output is correct
59 Correct 107 ms 25800 KB Output is correct
60 Correct 105 ms 26060 KB Output is correct
61 Correct 88 ms 30668 KB Output is correct
62 Correct 90 ms 30724 KB Output is correct
63 Correct 94 ms 30624 KB Output is correct
64 Correct 99 ms 31608 KB Output is correct
65 Correct 142 ms 26956 KB Output is correct
66 Correct 117 ms 25548 KB Output is correct
67 Correct 117 ms 25408 KB Output is correct
68 Correct 68 ms 24396 KB Output is correct
69 Correct 72 ms 24324 KB Output is correct
70 Correct 101 ms 31868 KB Output is correct
71 Correct 87 ms 30532 KB Output is correct
72 Correct 5 ms 9684 KB Output is correct
73 Correct 10 ms 11028 KB Output is correct
74 Correct 10 ms 11036 KB Output is correct
75 Correct 5 ms 9720 KB Output is correct
76 Correct 5 ms 9724 KB Output is correct
77 Correct 10 ms 11528 KB Output is correct
78 Correct 10 ms 11092 KB Output is correct
79 Correct 9 ms 11020 KB Output is correct
80 Correct 10 ms 11016 KB Output is correct
81 Correct 5 ms 9684 KB Output is correct
82 Correct 5 ms 9664 KB Output is correct
83 Correct 5 ms 9724 KB Output is correct
84 Correct 5 ms 9728 KB Output is correct
85 Correct 5 ms 9684 KB Output is correct
86 Correct 25 ms 12616 KB Output is correct
87 Correct 25 ms 12676 KB Output is correct
88 Correct 27 ms 12728 KB Output is correct
89 Correct 11 ms 11592 KB Output is correct
90 Correct 10 ms 11220 KB Output is correct
91 Correct 26 ms 13340 KB Output is correct
92 Correct 29 ms 13268 KB Output is correct
93 Correct 5 ms 9684 KB Output is correct
94 Correct 110 ms 37548 KB Output is correct
95 Correct 103 ms 37264 KB Output is correct
96 Correct 100 ms 36612 KB Output is correct
97 Correct 89 ms 35404 KB Output is correct
98 Correct 81 ms 36292 KB Output is correct
99 Correct 110 ms 25832 KB Output is correct
100 Correct 109 ms 25796 KB Output is correct
101 Correct 109 ms 26044 KB Output is correct
102 Correct 98 ms 26084 KB Output is correct
103 Correct 86 ms 30412 KB Output is correct
104 Correct 89 ms 30784 KB Output is correct
105 Correct 86 ms 30332 KB Output is correct
106 Correct 90 ms 30924 KB Output is correct
107 Correct 100 ms 30656 KB Output is correct
108 Correct 78 ms 35220 KB Output is correct
109 Correct 84 ms 35188 KB Output is correct
110 Correct 80 ms 25228 KB Output is correct
111 Correct 73 ms 25336 KB Output is correct
112 Correct 96 ms 24524 KB Output is correct
113 Correct 96 ms 24580 KB Output is correct