oj.uz

Submission #291323

# Submission time Handle Problem Language Result Execution time Memory
291323 2020-09-05T05:54:41 Z someone_aa Railway (BOI17_railway) C++17
100 / 100
 427 ms 44912 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll, ll>
#define sz(x) int(x.size())
using namespace std;
const int maxn = 100100;
const int maxlog = 20;
vector<int>g[maxn];
vector<int>gt[maxn];
ll n, q, k;

int opent[maxn], euler[maxn];
int sbtsize[maxn], br;
int depth[maxn];

int parent[maxn][maxlog];

void dfs_preprocess(int node, int p, int d) {
	opent[node] = br;
	euler[br] = node;
	sbtsize[node] = 1;
	depth[node] = d;
	br++;

	parent[node][0] = p;

	for(int i:g[node]) {
		if(i == p) continue;

		dfs_preprocess(i, node, d + 1);
		sbtsize[node] += sbtsize[i];
	}
}

void lca_preprocess() {
	for(int level=1;level<maxlog;level++) {
		for(int i=1;i<=n;i++) {
			if(parent[i][level-1] == -1) continue;
			parent[i][level] = parent[parent[i][level-1]][level-1];
		}
	}
}

int lca(int a, int b) {
	if(depth[a] > depth[b]) swap(a, b);
	if(opent[b] >= opent[a] && opent[b] < opent[a] + sbtsize[a]) return a;

	for(int i=maxlog-1;i>=0;i--) {
		if(parent[a][i] == -1) continue;

		int nextnode = parent[a][i];
		if(opent[b] < opent[nextnode] || opent[b] >= opent[nextnode] + sbtsize[nextnode]) a = nextnode;
	}

	return parent[a][0];
}

int start_here[maxn], end_here[maxn];
map<pii, int> ind;
vector<int>result;

int dfs_count(int node, int p) {
	int sum = 0;
	for(int i:g[node]) {
		if(i == p) continue;

		int tmp = dfs_count(i, node);
		if(tmp >= k) {
			result.pb(ind[mp(i, node)]);
		}

		sum += tmp;
	}

	return sum + start_here[node] - end_here[node];
} 


int main() {
	cin>>n>>q>>k;

	ll u, v;
	for(int i=0;i<n-1;i++) {
		cin>>u>>v;
		g[u].pb(v);
		g[v].pb(u);

		ind[mp(u, v)] = ind[mp(v, u)] = i + 1;
	}

	memset(parent, -1, sizeof(parent));
	dfs_preprocess(1, -1,0);
	lca_preprocess();

	int s;
	bool root;
	while(q--) {
		cin>>s;

		vector<pii> v;
		set<int>st;
		for(int i=0;i<s;i++) {
			cin>>u;
			v.pb(mp(opent[u], u));
			st.insert(u);

		}

		sort(v.begin(), v.end());
		for(int i=1;i<sz(v);i++) {
			st.insert(lca(v[i].second, v[i-1].second));
		}

		v.clear();
		for(int i:st) {
			v.pb(mp(opent[i], i));
		}		sort(v.begin(), v.end());

		stack<int>node_stack;
		node_stack.push(v[0].second);
		for(int i=1;i<sz(v);i++) {

			while(!node_stack.empty()) {
				int curr = node_stack.top();
				int nextnode = v[i].second;

				if(opent[nextnode] >= opent[curr] && opent[nextnode] < opent[curr] + sbtsize[curr]) {
					start_here[nextnode]++;
					end_here[curr]++;
					node_stack.push(nextnode);
					break;
				}
				else {
					node_stack.pop();
				}
			}
		}
	}

	dfs_count(1, -1);
	sort(result.begin(), result.end());
	cout<<sz(result)<<"\n";
	for(int i:result) {
		cout<<i<<" ";
	} cout<<"\n";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:99:7: warning: unused variable 'root' [-Wunused-variable]
   99 |  bool root;
      |       ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 28 ms 14848 KB Output is correct
3 Correct 28 ms 14716 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 28 ms 15360 KB Output is correct
7 Correct 29 ms 14968 KB Output is correct
8 Correct 24 ms 14720 KB Output is correct
9 Correct 27 ms 14848 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 8 ms 12928 KB Output is correct
12 Correct 7 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 8 ms 12928 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 28 ms 14848 KB Output is correct
3 Correct 28 ms 14716 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 28 ms 15360 KB Output is correct
7 Correct 29 ms 14968 KB Output is correct
8 Correct 24 ms 14720 KB Output is correct
9 Correct 27 ms 14848 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 8 ms 12928 KB Output is correct
12 Correct 7 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 8 ms 12928 KB Output is correct
15 Correct 99 ms 15192 KB Output is correct
16 Correct 96 ms 15224 KB Output is correct
17 Correct 100 ms 15316 KB Output is correct
18 Correct 30 ms 15352 KB Output is correct
19 Correct 29 ms 14840 KB Output is correct
20 Correct 93 ms 15480 KB Output is correct
21 Correct 99 ms 15352 KB Output is correct
22 Correct 8 ms 12928 KB Output is correct
23 Correct 28 ms 14840 KB Output is correct
24 Correct 29 ms 14840 KB Output is correct
25 Correct 8 ms 12928 KB Output is correct
26 Correct 8 ms 12928 KB Output is correct
27 Correct 28 ms 15392 KB Output is correct
28 Correct 30 ms 14968 KB Output is correct
29 Correct 24 ms 14720 KB Output is correct
30 Correct 27 ms 14720 KB Output is correct
31 Correct 8 ms 12928 KB Output is correct
32 Correct 8 ms 12928 KB Output is correct
33 Correct 8 ms 12928 KB Output is correct
34 Correct 8 ms 12928 KB Output is correct
35 Correct 8 ms 12928 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 42736 KB Output is correct
2 Correct 8 ms 12928 KB Output is correct
3 Correct 322 ms 44276 KB Output is correct
4 Correct 311 ms 43704 KB Output is correct
5 Correct 313 ms 44528 KB Output is correct
6 Correct 345 ms 44912 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 373 ms 35836 KB Output is correct
2 Correct 416 ms 32956 KB Output is correct
3 Correct 413 ms 32504 KB Output is correct
4 Correct 415 ms 32312 KB Output is correct
5 Correct 414 ms 32376 KB Output is correct
6 Correct 363 ms 37752 KB Output is correct
7 Correct 359 ms 37752 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 373 ms 35836 KB Output is correct
2 Correct 416 ms 32956 KB Output is correct
3 Correct 413 ms 32504 KB Output is correct
4 Correct 415 ms 32312 KB Output is correct
5 Correct 414 ms 32376 KB Output is correct
6 Correct 363 ms 37752 KB Output is correct
7 Correct 359 ms 37752 KB Output is correct
8 Correct 372 ms 38388 KB Output is correct
9 Correct 379 ms 38264 KB Output is correct
10 Correct 307 ms 44656 KB Output is correct
11 Correct 310 ms 44528 KB Output is correct
12 Correct 302 ms 32248 KB Output is correct
13 Correct 301 ms 32248 KB Output is correct
14 Correct 422 ms 32628 KB Output is correct
15 Correct 414 ms 32632 KB Output is correct
16 Correct 419 ms 32452 KB Output is correct
17 Correct 418 ms 32376 KB Output is correct
18 Correct 411 ms 32380 KB Output is correct
19 Correct 412 ms 33116 KB Output is correct
20 Correct 371 ms 38008 KB Output is correct
21 Correct 365 ms 38136 KB Output is correct
22 Correct 362 ms 38044 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12928 KB Output is correct
2 Correct 28 ms 14848 KB Output is correct
3 Correct 28 ms 14716 KB Output is correct
4 Correct 8 ms 12928 KB Output is correct
5 Correct 8 ms 12928 KB Output is correct
6 Correct 28 ms 15360 KB Output is correct
7 Correct 29 ms 14968 KB Output is correct
8 Correct 24 ms 14720 KB Output is correct
9 Correct 27 ms 14848 KB Output is correct
10 Correct 8 ms 12928 KB Output is correct
11 Correct 8 ms 12928 KB Output is correct
12 Correct 7 ms 12928 KB Output is correct
13 Correct 8 ms 12928 KB Output is correct
14 Correct 8 ms 12928 KB Output is correct
15 Correct 99 ms 15192 KB Output is correct
16 Correct 96 ms 15224 KB Output is correct
17 Correct 100 ms 15316 KB Output is correct
18 Correct 30 ms 15352 KB Output is correct
19 Correct 29 ms 14840 KB Output is correct
20 Correct 93 ms 15480 KB Output is correct
21 Correct 99 ms 15352 KB Output is correct
22 Correct 8 ms 12928 KB Output is correct
23 Correct 28 ms 14840 KB Output is correct
24 Correct 29 ms 14840 KB Output is correct
25 Correct 8 ms 12928 KB Output is correct
26 Correct 8 ms 12928 KB Output is correct
27 Correct 28 ms 15392 KB Output is correct
28 Correct 30 ms 14968 KB Output is correct
29 Correct 24 ms 14720 KB Output is correct
30 Correct 27 ms 14720 KB Output is correct
31 Correct 8 ms 12928 KB Output is correct
32 Correct 8 ms 12928 KB Output is correct
33 Correct 8 ms 12928 KB Output is correct
34 Correct 8 ms 12928 KB Output is correct
35 Correct 8 ms 12928 KB Output is correct
36 Correct 326 ms 42736 KB Output is correct
37 Correct 8 ms 12928 KB Output is correct
38 Correct 322 ms 44276 KB Output is correct
39 Correct 311 ms 43704 KB Output is correct
40 Correct 313 ms 44528 KB Output is correct
41 Correct 345 ms 44912 KB Output is correct
42 Correct 373 ms 35836 KB Output is correct
43 Correct 416 ms 32956 KB Output is correct
44 Correct 413 ms 32504 KB Output is correct
45 Correct 415 ms 32312 KB Output is correct
46 Correct 414 ms 32376 KB Output is correct
47 Correct 363 ms 37752 KB Output is correct
48 Correct 359 ms 37752 KB Output is correct
49 Correct 372 ms 38388 KB Output is correct
50 Correct 379 ms 38264 KB Output is correct
51 Correct 307 ms 44656 KB Output is correct
52 Correct 310 ms 44528 KB Output is correct
53 Correct 302 ms 32248 KB Output is correct
54 Correct 301 ms 32248 KB Output is correct
55 Correct 422 ms 32628 KB Output is correct
56 Correct 414 ms 32632 KB Output is correct
57 Correct 419 ms 32452 KB Output is correct
58 Correct 418 ms 32376 KB Output is correct
59 Correct 411 ms 32380 KB Output is correct
60 Correct 412 ms 33116 KB Output is correct
61 Correct 371 ms 38008 KB Output is correct
62 Correct 365 ms 38136 KB Output is correct
63 Correct 362 ms 38044 KB Output is correct
64 Correct 377 ms 38268 KB Output is correct
65 Correct 422 ms 32504 KB Output is correct
66 Correct 424 ms 32760 KB Output is correct
67 Correct 411 ms 32760 KB Output is correct
68 Correct 306 ms 32248 KB Output is correct
69 Correct 309 ms 32252 KB Output is correct
70 Correct 380 ms 38652 KB Output is correct
71 Correct 361 ms 38008 KB Output is correct
72 Correct 8 ms 12928 KB Output is correct
73 Correct 30 ms 14840 KB Output is correct
74 Correct 28 ms 14848 KB Output is correct
75 Correct 8 ms 12928 KB Output is correct
76 Correct 8 ms 12928 KB Output is correct
77 Correct 30 ms 15360 KB Output is correct
78 Correct 30 ms 14976 KB Output is correct
79 Correct 24 ms 14720 KB Output is correct
80 Correct 27 ms 14840 KB Output is correct
81 Correct 9 ms 12928 KB Output is correct
82 Correct 9 ms 12928 KB Output is correct
83 Correct 8 ms 12928 KB Output is correct
84 Correct 8 ms 12928 KB Output is correct
85 Correct 8 ms 12928 KB Output is correct
86 Correct 102 ms 15096 KB Output is correct
87 Correct 100 ms 15224 KB Output is correct
88 Correct 101 ms 15224 KB Output is correct
89 Correct 31 ms 15352 KB Output is correct
90 Correct 29 ms 14840 KB Output is correct
91 Correct 99 ms 15352 KB Output is correct
92 Correct 100 ms 15224 KB Output is correct
93 Correct 8 ms 12928 KB Output is correct
94 Correct 326 ms 44580 KB Output is correct
95 Correct 311 ms 44148 KB Output is correct
96 Correct 302 ms 43640 KB Output is correct
97 Correct 311 ms 44652 KB Output is correct
98 Correct 342 ms 44912 KB Output is correct
99 Correct 408 ms 32504 KB Output is correct
100 Correct 427 ms 32604 KB Output is correct
101 Correct 421 ms 32380 KB Output is correct
102 Correct 411 ms 32888 KB Output is correct
103 Correct 397 ms 37760 KB Output is correct
104 Correct 366 ms 38136 KB Output is correct
105 Correct 366 ms 37628 KB Output is correct
106 Correct 402 ms 38520 KB Output is correct
107 Correct 368 ms 38232 KB Output is correct
108 Correct 311 ms 44656 KB Output is correct
109 Correct 308 ms 44656 KB Output is correct
110 Correct 322 ms 32248 KB Output is correct
111 Correct 308 ms 32248 KB Output is correct
112 Correct 405 ms 32632 KB Output is correct
113 Correct 399 ms 32632 KB Output is correct