oj.uz

Submission #697198

# Submission time Handle Problem Language Result Execution time Memory
697198 2023-02-08T20:15:28 Z MISM06 Railway (BOI17_railway) C++14
100 / 100
 167 ms 28508 KB 
//0 1 1 0 1
//0 1 0 0 1
//1 0 0 1 1
//0 1 1 0 1
//uoy kcuf;
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

using namespace std;

#define F 			first
#define S 			second
#define pb 			push_back
#define sze			size()
#define	all(x)		x.begin() , x.end()
#define wall__		cout << "--------------------------------------\n";
#define node		int mid = (tl + tr) >> 1, cl = v << 1, cr = v << 1 | 1
#define file_io		freopen("input.cpp", "r", stdin); freopen("output.cpp", "w", stdout);

typedef long long ll;
typedef long double dl;
typedef pair < int , int > pii;
typedef pair < int , ll > pil;
typedef pair < ll , int > pli;
typedef pair < ll , ll > pll;
typedef pair < int , pii > piii;
typedef pair < ll, pll > plll;


const ll N = 2e5 + 10;
const ll mod = 1e9 + 7;
const ll inf = 2e16;
const ll rinf = -2e16;
const ll INF = 1e9 + 10;
const ll rINF = -1e9 - 10;
const ll lg = 20;

int m, k, st[N], en[N], timer = 0, par[lg][N], a[N], id[N];
vector < pii > g[N];
void dfs (int v, int p) {
	st[v] = ++timer;
	par[0][v] = p; for (int i = 1; i < lg; i++) par[i][v] = par[i - 1][par[i - 1][v]];
	for (auto u : g[v]) if (u.F != p) {
		dfs(u.F, v);
		id[u.S] = u.F;
	}
	en[v] = timer;
}
bool be_anc (int v, int u) {
	return st[v] <= st[u] && en[v] >= en[u];
}
int LCA (int v, int u) {
	if (be_anc(v, u)) return v;
	if (be_anc(u, v)) return u;
	for (int i = lg - 1; i >= 0; --i) if (!be_anc(par[i][v], u)) v = par[i][v];
	return par[0][v];
}
void calc (int n) {
	vector < pii > ver;
	int lca = -1;
	for (int i = 1; i <= n; i++) {
		int v; cin >> v;
		if (lca == -1) lca = v;
		lca = LCA(lca, v);
		ver.pb({st[v], v});
	} ver.pb({st[lca], lca}); sort(all(ver));
	for (int i = 1; i <= n; i++) {
		int v = ver[i].S, u = ver[i - 1].S;
		--a[LCA(v, u)]; ++a[v];
	}
}
void make (int v, int p) {
	for (auto u : g[v]) {
		if (u.F == p) continue;
		make(u.F, v);
		a[v] += a[u.F];
	}
}
void solve () {

	int n;
	cin >> n >> m >> k; st[0] = -1; en[0] = INF;
	for (int i = 1; i < n; i++) {
		int v, u; cin >> v >> u;
		g[v].pb({u, i});
		g[u].pb({v, i});
	}
	dfs(1, 0);
	for (int i = 1; i <= m; i++) {
		int s; cin >> s; calc(s);
	}
	make(1, 0);
	vector < int > ord;
	for (int i = 1; i < n; i++) {
		if (a[id[i]] >= k) ord.pb(i);
	}
	cout << ord.sze << '\n';
	for (auto x : ord) cout << x << " ";

}

int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	
	int t = 1;
	// cin >> t;
	while (t--) {solve();}

    return 0;
}
/*
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 6 ms 6484 KB Output is correct
3 Correct 6 ms 6472 KB Output is correct
4 Correct 2 ms 5024 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 7 ms 6976 KB Output is correct
7 Correct 7 ms 6612 KB Output is correct
8 Correct 6 ms 6576 KB Output is correct
9 Correct 7 ms 6548 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 5 ms 5032 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 6 ms 6484 KB Output is correct
3 Correct 6 ms 6472 KB Output is correct
4 Correct 2 ms 5024 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 7 ms 6976 KB Output is correct
7 Correct 7 ms 6612 KB Output is correct
8 Correct 6 ms 6576 KB Output is correct
9 Correct 7 ms 6548 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 5 ms 5032 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 30 ms 6860 KB Output is correct
16 Correct 29 ms 6916 KB Output is correct
17 Correct 30 ms 6924 KB Output is correct
18 Correct 7 ms 6996 KB Output is correct
19 Correct 9 ms 6612 KB Output is correct
20 Correct 40 ms 7116 KB Output is correct
21 Correct 46 ms 6984 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 8 ms 6484 KB Output is correct
24 Correct 9 ms 6572 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5028 KB Output is correct
27 Correct 7 ms 6996 KB Output is correct
28 Correct 6 ms 6612 KB Output is correct
29 Correct 6 ms 6576 KB Output is correct
30 Correct 7 ms 6576 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5024 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 2 ms 5028 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 28128 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 58 ms 27828 KB Output is correct
4 Correct 51 ms 27232 KB Output is correct
5 Correct 55 ms 28104 KB Output is correct
6 Correct 60 ms 28480 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 23840 KB Output is correct
2 Correct 106 ms 20432 KB Output is correct
3 Correct 134 ms 20012 KB Output is correct
4 Correct 121 ms 20016 KB Output is correct
5 Correct 119 ms 20024 KB Output is correct
6 Correct 69 ms 23924 KB Output is correct
7 Correct 93 ms 23896 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 23840 KB Output is correct
2 Correct 106 ms 20432 KB Output is correct
3 Correct 134 ms 20012 KB Output is correct
4 Correct 121 ms 20016 KB Output is correct
5 Correct 119 ms 20024 KB Output is correct
6 Correct 69 ms 23924 KB Output is correct
7 Correct 93 ms 23896 KB Output is correct
8 Correct 87 ms 23924 KB Output is correct
9 Correct 103 ms 23944 KB Output is correct
10 Correct 56 ms 28228 KB Output is correct
11 Correct 55 ms 28164 KB Output is correct
12 Correct 158 ms 19748 KB Output is correct
13 Correct 143 ms 19748 KB Output is correct
14 Correct 112 ms 19964 KB Output is correct
15 Correct 112 ms 19880 KB Output is correct
16 Correct 119 ms 19916 KB Output is correct
17 Correct 107 ms 20032 KB Output is correct
18 Correct 102 ms 20044 KB Output is correct
19 Correct 95 ms 20384 KB Output is correct
20 Correct 74 ms 24120 KB Output is correct
21 Correct 72 ms 24304 KB Output is correct
22 Correct 82 ms 24228 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 6 ms 6484 KB Output is correct
3 Correct 6 ms 6472 KB Output is correct
4 Correct 2 ms 5024 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 7 ms 6976 KB Output is correct
7 Correct 7 ms 6612 KB Output is correct
8 Correct 6 ms 6576 KB Output is correct
9 Correct 7 ms 6548 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 5 ms 5032 KB Output is correct
14 Correct 3 ms 5028 KB Output is correct
15 Correct 30 ms 6860 KB Output is correct
16 Correct 29 ms 6916 KB Output is correct
17 Correct 30 ms 6924 KB Output is correct
18 Correct 7 ms 6996 KB Output is correct
19 Correct 9 ms 6612 KB Output is correct
20 Correct 40 ms 7116 KB Output is correct
21 Correct 46 ms 6984 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 8 ms 6484 KB Output is correct
24 Correct 9 ms 6572 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5028 KB Output is correct
27 Correct 7 ms 6996 KB Output is correct
28 Correct 6 ms 6612 KB Output is correct
29 Correct 6 ms 6576 KB Output is correct
30 Correct 7 ms 6576 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5024 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 2 ms 5028 KB Output is correct
36 Correct 60 ms 28128 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 58 ms 27828 KB Output is correct
39 Correct 51 ms 27232 KB Output is correct
40 Correct 55 ms 28104 KB Output is correct
41 Correct 60 ms 28480 KB Output is correct
42 Correct 70 ms 23840 KB Output is correct
43 Correct 106 ms 20432 KB Output is correct
44 Correct 134 ms 20012 KB Output is correct
45 Correct 121 ms 20016 KB Output is correct
46 Correct 119 ms 20024 KB Output is correct
47 Correct 69 ms 23924 KB Output is correct
48 Correct 93 ms 23896 KB Output is correct
49 Correct 87 ms 23924 KB Output is correct
50 Correct 103 ms 23944 KB Output is correct
51 Correct 56 ms 28228 KB Output is correct
52 Correct 55 ms 28164 KB Output is correct
53 Correct 158 ms 19748 KB Output is correct
54 Correct 143 ms 19748 KB Output is correct
55 Correct 112 ms 19964 KB Output is correct
56 Correct 112 ms 19880 KB Output is correct
57 Correct 119 ms 19916 KB Output is correct
58 Correct 107 ms 20032 KB Output is correct
59 Correct 102 ms 20044 KB Output is correct
60 Correct 95 ms 20384 KB Output is correct
61 Correct 74 ms 24120 KB Output is correct
62 Correct 72 ms 24304 KB Output is correct
63 Correct 82 ms 24228 KB Output is correct
64 Correct 86 ms 24104 KB Output is correct
65 Correct 152 ms 20148 KB Output is correct
66 Correct 167 ms 19884 KB Output is correct
67 Correct 156 ms 19916 KB Output is correct
68 Correct 101 ms 19784 KB Output is correct
69 Correct 114 ms 19680 KB Output is correct
70 Correct 89 ms 24372 KB Output is correct
71 Correct 80 ms 23756 KB Output is correct
72 Correct 4 ms 5032 KB Output is correct
73 Correct 7 ms 6484 KB Output is correct
74 Correct 7 ms 6448 KB Output is correct
75 Correct 3 ms 5076 KB Output is correct
76 Correct 3 ms 5204 KB Output is correct
77 Correct 8 ms 6996 KB Output is correct
78 Correct 7 ms 6612 KB Output is correct
79 Correct 6 ms 6484 KB Output is correct
80 Correct 7 ms 6480 KB Output is correct
81 Correct 3 ms 5076 KB Output is correct
82 Correct 3 ms 5032 KB Output is correct
83 Correct 3 ms 5204 KB Output is correct
84 Correct 3 ms 5076 KB Output is correct
85 Correct 3 ms 5076 KB Output is correct
86 Correct 28 ms 6924 KB Output is correct
87 Correct 28 ms 6912 KB Output is correct
88 Correct 29 ms 6920 KB Output is correct
89 Correct 7 ms 6960 KB Output is correct
90 Correct 7 ms 6612 KB Output is correct
91 Correct 44 ms 7112 KB Output is correct
92 Correct 42 ms 6984 KB Output is correct
93 Correct 3 ms 5028 KB Output is correct
94 Correct 58 ms 28124 KB Output is correct
95 Correct 60 ms 27740 KB Output is correct
96 Correct 56 ms 27232 KB Output is correct
97 Correct 53 ms 28128 KB Output is correct
98 Correct 60 ms 28508 KB Output is correct
99 Correct 117 ms 20028 KB Output is correct
100 Correct 116 ms 20040 KB Output is correct
101 Correct 117 ms 20012 KB Output is correct
102 Correct 96 ms 20424 KB Output is correct
103 Correct 69 ms 24000 KB Output is correct
104 Correct 72 ms 24208 KB Output is correct
105 Correct 73 ms 24012 KB Output is correct
106 Correct 102 ms 24076 KB Output is correct
107 Correct 81 ms 23940 KB Output is correct
108 Correct 54 ms 28228 KB Output is correct
109 Correct 53 ms 28228 KB Output is correct
110 Correct 160 ms 19840 KB Output is correct
111 Correct 135 ms 19768 KB Output is correct
112 Correct 127 ms 19968 KB Output is correct
113 Correct 119 ms 19964 KB Output is correct