oj.uz

Submission #677759

# Submission time Handle Problem Language Result Execution time Memory
677759 2023-01-04T10:05:36 Z HaYoungJoon Railway (BOI17_railway) C++14
100 / 100
 159 ms 23748 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;
const int maxn = 1e5 + 1;
const int LOG = 16;
int n,m,k, timer = 0, mark[maxn];
vector<pii> adj[maxn];
int tin[maxn], tout[maxn],up[LOG+1][maxn], node[maxn], bit[maxn], E[maxn];

void DFS(int u, int p) {
    tin[u] = ++timer;
    node[tin[u]] = u;
    up[0][u] = p;
    for (int i = 1; i <= LOG; i++) up[i][u] = up[i-1][up[i-1][u]];
    for (pii i: adj[u]) {
        int v = i.first, id = i.second;
        if (v == p) continue;
        E[v] = id;
        DFS(v,u);
    }
    tout[u] = timer;
}

bool is_ancestor(int u, int v) {
    return (tin[u] <= tin[v] && tout[u] >= tout[v]);
}
int LCA(int u, int v) {
    if (is_ancestor(u,v)) return u;
    if (is_ancestor(v,u)) return v;
    for (int i = LOG; i >= 0; i--)
        if (!is_ancestor(up[i][u],v)) u = up[i][u];
    return up[0][u];
}

bool cmp(int A, int B) {
    return tin[A] < tin[B];
}


void update(int idx, int val) {
    for (; idx <= n; idx += (idx & -idx)) bit[idx] += val;
}
int getSum(int L, int R) {
    L--;
    int res = 0;
    for (; L > 0; L -= (L & -L)) res -= bit[L];
    for (; R > 0; R -= (R & -R)) res += bit[R];
    return res;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++) {
        int u,v;
        cin >> u >> v;
        adj[u].push_back(pii(v,i));
        adj[v].push_back(pii(u,i));
    }
    DFS(1,1);
    while (m--) {
        int Q;
        cin >> Q;
        for (int i = 1; i <= Q; i++) cin >> mark[i];
        sort(mark+1,mark+1+Q,cmp);
        mark[Q+1] = mark[1];
        for (int i = 1; i <= Q; i++) {
            int L = LCA(mark[i],mark[i+1]);
            update(tin[mark[i]],1);
            update(tin[mark[i+1]],1);
            update(tin[L],-2);
        }
    }
    vector<int> res;
    for (int i = 2; i <= n; i++)
        if (getSum(tin[i],tout[i]) >= 2*k) res.push_back(E[i]);
    sort(res.begin(),res.end());
    cout << res.size() << '\n';
    for (int i: res) cout << i << ' ';
    return 0;
}
/*
6 1 2
1 3
2 3
3 4
6 4
4 5
4 1 3 2 5
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 6 ms 4052 KB Output is correct
3 Correct 5 ms 4100 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4104 KB Output is correct
8 Correct 5 ms 4104 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2748 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 6 ms 4052 KB Output is correct
3 Correct 5 ms 4100 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4104 KB Output is correct
8 Correct 5 ms 4104 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2748 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 28 ms 4472 KB Output is correct
16 Correct 31 ms 4436 KB Output is correct
17 Correct 29 ms 4468 KB Output is correct
18 Correct 6 ms 4436 KB Output is correct
19 Correct 7 ms 4104 KB Output is correct
20 Correct 33 ms 4556 KB Output is correct
21 Correct 38 ms 4580 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 5 ms 4052 KB Output is correct
24 Correct 5 ms 4096 KB Output is correct
25 Correct 2 ms 2676 KB Output is correct
26 Correct 2 ms 2680 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 4180 KB Output is correct
29 Correct 6 ms 4100 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 2 ms 2680 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2684 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 23384 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 57 ms 22984 KB Output is correct
4 Correct 50 ms 22408 KB Output is correct
5 Correct 55 ms 23328 KB Output is correct
6 Correct 63 ms 23728 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 19532 KB Output is correct
2 Correct 99 ms 16760 KB Output is correct
3 Correct 98 ms 16516 KB Output is correct
4 Correct 114 ms 16712 KB Output is correct
5 Correct 104 ms 16708 KB Output is correct
6 Correct 74 ms 19648 KB Output is correct
7 Correct 68 ms 19568 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 19532 KB Output is correct
2 Correct 99 ms 16760 KB Output is correct
3 Correct 98 ms 16516 KB Output is correct
4 Correct 114 ms 16712 KB Output is correct
5 Correct 104 ms 16708 KB Output is correct
6 Correct 74 ms 19648 KB Output is correct
7 Correct 68 ms 19568 KB Output is correct
8 Correct 80 ms 19916 KB Output is correct
9 Correct 87 ms 19928 KB Output is correct
10 Correct 57 ms 23364 KB Output is correct
11 Correct 61 ms 23324 KB Output is correct
12 Correct 156 ms 16576 KB Output is correct
13 Correct 156 ms 16484 KB Output is correct
14 Correct 104 ms 16576 KB Output is correct
15 Correct 107 ms 16588 KB Output is correct
16 Correct 117 ms 16760 KB Output is correct
17 Correct 97 ms 16620 KB Output is correct
18 Correct 96 ms 16720 KB Output is correct
19 Correct 93 ms 16692 KB Output is correct
20 Correct 70 ms 19848 KB Output is correct
21 Correct 71 ms 20012 KB Output is correct
22 Correct 67 ms 19916 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 6 ms 4052 KB Output is correct
3 Correct 5 ms 4100 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4104 KB Output is correct
8 Correct 5 ms 4104 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2684 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2748 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 28 ms 4472 KB Output is correct
16 Correct 31 ms 4436 KB Output is correct
17 Correct 29 ms 4468 KB Output is correct
18 Correct 6 ms 4436 KB Output is correct
19 Correct 7 ms 4104 KB Output is correct
20 Correct 33 ms 4556 KB Output is correct
21 Correct 38 ms 4580 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 5 ms 4052 KB Output is correct
24 Correct 5 ms 4096 KB Output is correct
25 Correct 2 ms 2676 KB Output is correct
26 Correct 2 ms 2680 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 4180 KB Output is correct
29 Correct 6 ms 4100 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 2 ms 2680 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2684 KB Output is correct
35 Correct 2 ms 2680 KB Output is correct
36 Correct 58 ms 23384 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 57 ms 22984 KB Output is correct
39 Correct 50 ms 22408 KB Output is correct
40 Correct 55 ms 23328 KB Output is correct
41 Correct 63 ms 23728 KB Output is correct
42 Correct 73 ms 19532 KB Output is correct
43 Correct 99 ms 16760 KB Output is correct
44 Correct 98 ms 16516 KB Output is correct
45 Correct 114 ms 16712 KB Output is correct
46 Correct 104 ms 16708 KB Output is correct
47 Correct 74 ms 19648 KB Output is correct
48 Correct 68 ms 19568 KB Output is correct
49 Correct 80 ms 19916 KB Output is correct
50 Correct 87 ms 19928 KB Output is correct
51 Correct 57 ms 23364 KB Output is correct
52 Correct 61 ms 23324 KB Output is correct
53 Correct 156 ms 16576 KB Output is correct
54 Correct 156 ms 16484 KB Output is correct
55 Correct 104 ms 16576 KB Output is correct
56 Correct 107 ms 16588 KB Output is correct
57 Correct 117 ms 16760 KB Output is correct
58 Correct 97 ms 16620 KB Output is correct
59 Correct 96 ms 16720 KB Output is correct
60 Correct 93 ms 16692 KB Output is correct
61 Correct 70 ms 19848 KB Output is correct
62 Correct 71 ms 20012 KB Output is correct
63 Correct 67 ms 19916 KB Output is correct
64 Correct 78 ms 20032 KB Output is correct
65 Correct 141 ms 16828 KB Output is correct
66 Correct 159 ms 16652 KB Output is correct
67 Correct 138 ms 16716 KB Output is correct
68 Correct 93 ms 16460 KB Output is correct
69 Correct 107 ms 16516 KB Output is correct
70 Correct 102 ms 20424 KB Output is correct
71 Correct 81 ms 19788 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 6 ms 4052 KB Output is correct
74 Correct 5 ms 4180 KB Output is correct
75 Correct 2 ms 2672 KB Output is correct
76 Correct 2 ms 2772 KB Output is correct
77 Correct 6 ms 4496 KB Output is correct
78 Correct 6 ms 4180 KB Output is correct
79 Correct 5 ms 4120 KB Output is correct
80 Correct 6 ms 4232 KB Output is correct
81 Correct 2 ms 2716 KB Output is correct
82 Correct 2 ms 2772 KB Output is correct
83 Correct 2 ms 2676 KB Output is correct
84 Correct 2 ms 2772 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 27 ms 4476 KB Output is correct
87 Correct 27 ms 4436 KB Output is correct
88 Correct 28 ms 4504 KB Output is correct
89 Correct 6 ms 4436 KB Output is correct
90 Correct 8 ms 4100 KB Output is correct
91 Correct 34 ms 4588 KB Output is correct
92 Correct 38 ms 4524 KB Output is correct
93 Correct 2 ms 2676 KB Output is correct
94 Correct 64 ms 23360 KB Output is correct
95 Correct 55 ms 22984 KB Output is correct
96 Correct 50 ms 22456 KB Output is correct
97 Correct 56 ms 23280 KB Output is correct
98 Correct 62 ms 23748 KB Output is correct
99 Correct 136 ms 16632 KB Output is correct
100 Correct 102 ms 16616 KB Output is correct
101 Correct 108 ms 16612 KB Output is correct
102 Correct 120 ms 16748 KB Output is correct
103 Correct 86 ms 19528 KB Output is correct
104 Correct 74 ms 19976 KB Output is correct
105 Correct 70 ms 19564 KB Output is correct
106 Correct 76 ms 20084 KB Output is correct
107 Correct 78 ms 19916 KB Output is correct
108 Correct 56 ms 23452 KB Output is correct
109 Correct 57 ms 23416 KB Output is correct
110 Correct 118 ms 16524 KB Output is correct
111 Correct 120 ms 16488 KB Output is correct
112 Correct 118 ms 16588 KB Output is correct
113 Correct 117 ms 16636 KB Output is correct