답안 #823563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
823563	2023-08-12T18:30:51 Z	beaboss	Railway (BOI17_railway)	C++14	100 / 100	74 ms	23768 KB

railway

// Source: https://oj.uz/problem/view/BOI17_railway
// 

#include "bits/stdc++.h"

using namespace std;

#define s second
#define f first
#define pb push_back

typedef long long ll;

typedef pair<int, int> pii;
typedef vector<pii> vpii;

typedef vector<int> vi;

#define FOR(i, a, b) for (int i = (a); i<b; i++)

const int N = 1e5 + 10;

vi adj[N];

int tin[N];
int tout[N];
int dep[N];
int bit[N];

int query_pref(int ind) {
	int ret = 0;
    for (; ind >= 0; ind = (ind & (ind + 1)) - 1)
        ret += bit[ind];
    return ret;
}

int query(int ind1, int ind2) {
	return query_pref(ind2 - 1) - query_pref(ind1-1);
}

void update(int ind, int val) {
	for (; ind < N; ind = ind | (ind + 1))
            bit[ind] += val;
}

int lift[N][20];

int timer = 0;

void dfs(int cur, int p) {
	tin[cur]=timer++;
	lift[cur][0]=p;
	dep[cur] = dep[p] + 1;
	for (auto val: adj[cur]) if (val != p) dfs(val, cur);

	tout[cur]=timer;
}

int jmp(int a, int d) {
	// cout << ' ' << a << d << endl;
	for (int i = 19; i>= 0; i--) if ((1 << i) & d) a = lift[a][i];
	// cout << a << endl;
	return a;
}

int LCA(int a, int b) {
	if (dep[b] > dep[a]) swap(a, b); // a is lower
	// cout << a << b << dep[a] << dep[b] << endl;
	a = jmp(a, dep[a]-dep[b]);
	// cout << a << b << endl;
	if (a==b)return a;

	for (int i = 19; i>= 0; i--)
		if (lift[a][i] != lift[b][i]) {
			a = lift[a][i];
			b = lift[b][i];
		}

	assert(lift[a][0] == lift[b][0]);
	return lift[a][0];

}



pii edges[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, m, k;
	cin >> n >> m >> k;


	FOR(i, 0, n-1) {
		int a, b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
		edges[i]={a, b};
	}

	dfs(1, 0);

	FOR(j, 1, 20) FOR(i, 1, n + 1) lift[i][j] = lift[lift[i][j-1]][j-1];



	int s;

	FOR(i, 0, m) {
		cin >> s;
		int cur[s+1];
		FOR(j, 0, s) 
			cin >> cur[j];

		sort(cur, cur + s, [&](int a, int b) {return tin[a] < tin[b]; });

		cur[s] = cur[0];

		FOR(i, 0, s) {
			int lca = LCA(cur[i], cur[i + 1]);
			// cout << cur[i] << cur[i + 1] << lca << endl;
			update(tin[lca], -2);
			update(tin[cur[i]], 1);
			update(tin[cur[i + 1]], 1);
		}
		
	}

	vi ans;

	FOR(i, 0, n - 1) {
		if (dep[edges[i].f] < dep[edges[i].s]) swap(edges[i].f, edges[i].s);

		if (query(tin[edges[i].f], tout[edges[i].f]) >= 2 * k) ans.pb(i + 1);
	}

	cout << ans.size() << endl;

	for (auto val: ans) cout << val << ' ';

		cout << endl;

}

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	4 ms	4052 KB	Output is correct
3	Correct	5 ms	4052 KB	Output is correct
4	Correct	1 ms	2644 KB	Output is correct
5	Correct	1 ms	2644 KB	Output is correct
6	Correct	7 ms	4488 KB	Output is correct
7	Correct	6 ms	4180 KB	Output is correct
8	Correct	6 ms	4096 KB	Output is correct
9	Correct	4 ms	4180 KB	Output is correct
10	Correct	2 ms	2684 KB	Output is correct
11	Correct	2 ms	2644 KB	Output is correct
12	Correct	1 ms	2644 KB	Output is correct
13	Correct	2 ms	2644 KB	Output is correct
14	Correct	2 ms	2644 KB	Output is correct
15	Correct	18 ms	4532 KB	Output is correct
16	Correct	18 ms	4528 KB	Output is correct
17	Correct	19 ms	4516 KB	Output is correct
18	Correct	5 ms	4436 KB	Output is correct
19	Correct	4 ms	4180 KB	Output is correct
20	Correct	18 ms	4684 KB	Output is correct
21	Correct	25 ms	4640 KB	Output is correct
22	Correct	2 ms	2684 KB	Output is correct
23	Correct	5 ms	4104 KB	Output is correct
24	Correct	5 ms	4100 KB	Output is correct
25	Correct	2 ms	2644 KB	Output is correct
26	Correct	1 ms	2644 KB	Output is correct
27	Correct	5 ms	4356 KB	Output is correct
28	Correct	5 ms	4180 KB	Output is correct
29	Correct	4 ms	4180 KB	Output is correct
30	Correct	6 ms	4192 KB	Output is correct
31	Correct	1 ms	2680 KB	Output is correct
32	Correct	2 ms	2644 KB	Output is correct
33	Correct	1 ms	2644 KB	Output is correct
34	Correct	1 ms	2644 KB	Output is correct
35	Correct	2 ms	2684 KB	Output is correct

Subtask #3
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	64 ms	21572 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	64 ms	21236 KB	Output is correct
4	Correct	70 ms	20812 KB	Output is correct
5	Correct	72 ms	21544 KB	Output is correct
6	Correct	58 ms	21672 KB	Output is correct

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	18016 KB	Output is correct
2	Correct	55 ms	15948 KB	Output is correct
3	Correct	57 ms	15820 KB	Output is correct
4	Correct	67 ms	15984 KB	Output is correct
5	Correct	58 ms	15908 KB	Output is correct
6	Correct	52 ms	18124 KB	Output is correct
7	Correct	53 ms	18024 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	18016 KB	Output is correct
2	Correct	55 ms	15948 KB	Output is correct
3	Correct	57 ms	15820 KB	Output is correct
4	Correct	67 ms	15984 KB	Output is correct
5	Correct	58 ms	15908 KB	Output is correct
6	Correct	52 ms	18124 KB	Output is correct
7	Correct	53 ms	18024 KB	Output is correct
8	Correct	56 ms	18456 KB	Output is correct
9	Correct	58 ms	18456 KB	Output is correct
10	Correct	70 ms	23428 KB	Output is correct
11	Correct	56 ms	23328 KB	Output is correct
12	Correct	45 ms	17660 KB	Output is correct
13	Correct	45 ms	17696 KB	Output is correct
14	Correct	55 ms	17648 KB	Output is correct
15	Correct	62 ms	17640 KB	Output is correct
16	Correct	60 ms	17808 KB	Output is correct
17	Correct	56 ms	17688 KB	Output is correct
18	Correct	57 ms	17692 KB	Output is correct
19	Correct	56 ms	17740 KB	Output is correct
20	Correct	55 ms	20188 KB	Output is correct
21	Correct	56 ms	20360 KB	Output is correct
22	Correct	55 ms	20232 KB	Output is correct

Subtask #6
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	4 ms	4052 KB	Output is correct
3	Correct	5 ms	4052 KB	Output is correct
4	Correct	1 ms	2644 KB	Output is correct
5	Correct	1 ms	2644 KB	Output is correct
6	Correct	7 ms	4488 KB	Output is correct
7	Correct	6 ms	4180 KB	Output is correct
8	Correct	6 ms	4096 KB	Output is correct
9	Correct	4 ms	4180 KB	Output is correct
10	Correct	2 ms	2684 KB	Output is correct
11	Correct	2 ms	2644 KB	Output is correct
12	Correct	1 ms	2644 KB	Output is correct
13	Correct	2 ms	2644 KB	Output is correct
14	Correct	2 ms	2644 KB	Output is correct
15	Correct	18 ms	4532 KB	Output is correct
16	Correct	18 ms	4528 KB	Output is correct
17	Correct	19 ms	4516 KB	Output is correct
18	Correct	5 ms	4436 KB	Output is correct
19	Correct	4 ms	4180 KB	Output is correct
20	Correct	18 ms	4684 KB	Output is correct
21	Correct	25 ms	4640 KB	Output is correct
22	Correct	2 ms	2684 KB	Output is correct
23	Correct	5 ms	4104 KB	Output is correct
24	Correct	5 ms	4100 KB	Output is correct
25	Correct	2 ms	2644 KB	Output is correct
26	Correct	1 ms	2644 KB	Output is correct
27	Correct	5 ms	4356 KB	Output is correct
28	Correct	5 ms	4180 KB	Output is correct
29	Correct	4 ms	4180 KB	Output is correct
30	Correct	6 ms	4192 KB	Output is correct
31	Correct	1 ms	2680 KB	Output is correct
32	Correct	2 ms	2644 KB	Output is correct
33	Correct	1 ms	2644 KB	Output is correct
34	Correct	1 ms	2644 KB	Output is correct
35	Correct	2 ms	2684 KB	Output is correct
36	Correct	64 ms	21572 KB	Output is correct
37	Correct	1 ms	2644 KB	Output is correct
38	Correct	64 ms	21236 KB	Output is correct
39	Correct	70 ms	20812 KB	Output is correct
40	Correct	72 ms	21544 KB	Output is correct
41	Correct	58 ms	21672 KB	Output is correct
42	Correct	53 ms	18016 KB	Output is correct
43	Correct	55 ms	15948 KB	Output is correct
44	Correct	57 ms	15820 KB	Output is correct
45	Correct	67 ms	15984 KB	Output is correct
46	Correct	58 ms	15908 KB	Output is correct
47	Correct	52 ms	18124 KB	Output is correct
48	Correct	53 ms	18024 KB	Output is correct
49	Correct	56 ms	18456 KB	Output is correct
50	Correct	58 ms	18456 KB	Output is correct
51	Correct	70 ms	23428 KB	Output is correct
52	Correct	56 ms	23328 KB	Output is correct
53	Correct	45 ms	17660 KB	Output is correct
54	Correct	45 ms	17696 KB	Output is correct
55	Correct	55 ms	17648 KB	Output is correct
56	Correct	62 ms	17640 KB	Output is correct
57	Correct	60 ms	17808 KB	Output is correct
58	Correct	56 ms	17688 KB	Output is correct
59	Correct	57 ms	17692 KB	Output is correct
60	Correct	56 ms	17740 KB	Output is correct
61	Correct	55 ms	20188 KB	Output is correct
62	Correct	56 ms	20360 KB	Output is correct
63	Correct	55 ms	20232 KB	Output is correct
64	Correct	56 ms	20388 KB	Output is correct
65	Correct	63 ms	17872 KB	Output is correct
66	Correct	71 ms	17720 KB	Output is correct
67	Correct	61 ms	17792 KB	Output is correct
68	Correct	40 ms	17612 KB	Output is correct
69	Correct	40 ms	17600 KB	Output is correct
70	Correct	67 ms	20780 KB	Output is correct
71	Correct	55 ms	20116 KB	Output is correct
72	Correct	2 ms	2644 KB	Output is correct
73	Correct	5 ms	4052 KB	Output is correct
74	Correct	4 ms	4052 KB	Output is correct
75	Correct	1 ms	2644 KB	Output is correct
76	Correct	1 ms	2644 KB	Output is correct
77	Correct	5 ms	4360 KB	Output is correct
78	Correct	5 ms	4180 KB	Output is correct
79	Correct	4 ms	4180 KB	Output is correct
80	Correct	4 ms	4104 KB	Output is correct
81	Correct	1 ms	2644 KB	Output is correct
82	Correct	2 ms	2688 KB	Output is correct
83	Correct	2 ms	2644 KB	Output is correct
84	Correct	2 ms	2684 KB	Output is correct
85	Correct	1 ms	2644 KB	Output is correct
86	Correct	19 ms	4532 KB	Output is correct
87	Correct	18 ms	4564 KB	Output is correct
88	Correct	20 ms	4520 KB	Output is correct
89	Correct	5 ms	4436 KB	Output is correct
90	Correct	5 ms	4180 KB	Output is correct
91	Correct	18 ms	4652 KB	Output is correct
92	Correct	20 ms	4564 KB	Output is correct
93	Correct	1 ms	2644 KB	Output is correct
94	Correct	63 ms	23376 KB	Output is correct
95	Correct	74 ms	23064 KB	Output is correct
96	Correct	59 ms	22476 KB	Output is correct
97	Correct	59 ms	23348 KB	Output is correct
98	Correct	69 ms	23768 KB	Output is correct
99	Correct	59 ms	17644 KB	Output is correct
100	Correct	56 ms	17680 KB	Output is correct
101	Correct	58 ms	17724 KB	Output is correct
102	Correct	55 ms	17732 KB	Output is correct
103	Correct	53 ms	19868 KB	Output is correct
104	Correct	55 ms	20272 KB	Output is correct
105	Correct	55 ms	19916 KB	Output is correct
106	Correct	59 ms	20452 KB	Output is correct
107	Correct	58 ms	20232 KB	Output is correct
108	Correct	56 ms	23380 KB	Output is correct
109	Correct	60 ms	23364 KB	Output is correct
110	Correct	59 ms	17744 KB	Output is correct
111	Correct	45 ms	17648 KB	Output is correct
112	Correct	56 ms	17656 KB	Output is correct
113	Correct	57 ms	17740 KB	Output is correct

답안 #823563

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 15.0 / 15.0

Subtask #3 7.0 / 7.0

Subtask #4 29.0 / 29.0

Subtask #5 16.0 / 16.0

Subtask #6 25.0 / 25.0

Subtask #1
8.0 / 8.0

Subtask #2
15.0 / 15.0

Subtask #3
7.0 / 7.0

Subtask #4
29.0 / 29.0

Subtask #5
16.0 / 16.0

Subtask #6
25.0 / 25.0