oj.uz

Submission #547650

# Submission time Handle Problem Language Result Execution time Memory
547650 2022-04-11T07:10:51 Z nafis_shifat Railway (BOI17_railway) C++17
100 / 100
 108 ms 27636 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;
int n, m, k;
vector<int> adj[mxn];
int in[mxn];
int out[mxn];
int T = 0;
int pa[20][mxn];
int level[mxn] = {};
int val[mxn] = {};
int l[mxn], r[mxn];
vector<int> ans;
void initLCA() {
	for(int i = 1;i < 18; i++)
		for(int j = 1;j <= n; j++)
			pa[i][j] = pa[i - 1][pa[i - 1][j]];
}


int findLCA(int u,int v) {

	if(level[u] < level[v]) swap(u,v);
	int diff = level[u] - level[v];
	for(int i = 0;i < 18; i++) if((diff>>i)&1) u = pa[i][u];
	if(u == v) return u;
	for(int i = 17;i >= 0; i--) {
		if(pa[i][u] != pa[i][v]){
			u = pa[i][u];
			v = pa[i][v];
		}
	}
	return pa[0][u];
}
void dfs0(int u, int prev) {
	in[u] = ++T;
	pa[0][u] = prev;
	level[u] = level[prev] + 1;
	for(int i : adj[u]) {
		int v = l[i] ^ r[i] ^ u;
		if(v == prev) continue;
		dfs0(v, u);
	}
	out[u] = T;
}

void dfs(int u, int prev) {
	for(int i : adj[u]) {
		int v = l[i] ^ r[i] ^ u;
		if(v == prev) continue;
		dfs(v, u);

		if(val[v] >= k) ans.push_back(i);
		val[u] += val[v];
	}
}
int main() {
	cin >> n >> m >> k;

	for(int i = 1; i < n; i++) {
		scanf("%d%d", &l[i], &r[i]);
		adj[l[i]].push_back(i);
		adj[r[i]].push_back(i);
	}

	dfs0(1, 0);
	initLCA();

	for(int i = 1; i <= m; i++) {
		int s;
		scanf("%d", &s);
		vector<int> con;
		for(int j = 1; j <= s; j++) {
			int x;
			scanf("%d", &x);
			con.push_back(x);
		}

		sort(con.begin(), con.end(), [](int a, int b) {
			return in[a] < in[b];
		});


		for(int i = 1; i < s; i++) {
			con.push_back(findLCA(con[i], con[i - 1]));
		}

		sort(con.begin(), con.end());
		con.erase(unique(con.begin(), con.end()), con.end());

		sort(con.begin(), con.end(), [](int a, int b) {
			return in[a] < in[b];
		});

		stack<int> st;

		st.push(con[0]);

		for(int i = 1; i < con.size(); i++) {
			while(!st.empty() && out[st.top()] < in[con[i]]) st.pop();
			val[con[i]]++;
			val[st.top()]--;
			
			st.push(con[i]);

		}

	}

	dfs(1, 0);
	sort(ans.begin(), ans.end());

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

	for(int i : ans) cout<<i<<" ";
	
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:102:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |   for(int i = 1; i < con.size(); i++) {
      |                  ~~^~~~~~~~~~~~
railway.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   scanf("%d%d", &l[i], &r[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
railway.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d", &s);
      |   ~~~~~^~~~~~~~~~
railway.cpp:78:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |    scanf("%d", &x);
      |    ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2660 KB Output is correct
2 Correct 6 ms 4052 KB Output is correct
3 Correct 7 ms 4052 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2660 KB Output is correct
6 Correct 7 ms 4588 KB Output is correct
7 Correct 6 ms 4204 KB Output is correct
8 Correct 5 ms 4052 KB Output is correct
9 Correct 6 ms 4104 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2656 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2660 KB Output is correct
2 Correct 6 ms 4052 KB Output is correct
3 Correct 7 ms 4052 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2660 KB Output is correct
6 Correct 7 ms 4588 KB Output is correct
7 Correct 6 ms 4204 KB Output is correct
8 Correct 5 ms 4052 KB Output is correct
9 Correct 6 ms 4104 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2656 KB Output is correct
15 Correct 33 ms 4488 KB Output is correct
16 Correct 34 ms 4492 KB Output is correct
17 Correct 32 ms 4480 KB Output is correct
18 Correct 7 ms 4584 KB Output is correct
19 Correct 6 ms 4184 KB Output is correct
20 Correct 26 ms 4588 KB Output is correct
21 Correct 29 ms 4628 KB Output is correct
22 Correct 2 ms 2656 KB Output is correct
23 Correct 7 ms 4052 KB Output is correct
24 Correct 7 ms 4104 KB Output is correct
25 Correct 2 ms 2656 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 6 ms 4564 KB Output is correct
28 Correct 6 ms 4200 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 27288 KB Output is correct
2 Correct 2 ms 2660 KB Output is correct
3 Correct 108 ms 26960 KB Output is correct
4 Correct 91 ms 26316 KB Output is correct
5 Correct 88 ms 27368 KB Output is correct
6 Correct 86 ms 27604 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 21644 KB Output is correct
2 Correct 97 ms 17520 KB Output is correct
3 Correct 100 ms 16948 KB Output is correct
4 Correct 100 ms 17048 KB Output is correct
5 Correct 96 ms 17024 KB Output is correct
6 Correct 75 ms 21764 KB Output is correct
7 Correct 78 ms 21704 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 21644 KB Output is correct
2 Correct 97 ms 17520 KB Output is correct
3 Correct 100 ms 16948 KB Output is correct
4 Correct 100 ms 17048 KB Output is correct
5 Correct 96 ms 17024 KB Output is correct
6 Correct 75 ms 21764 KB Output is correct
7 Correct 78 ms 21704 KB Output is correct
8 Correct 91 ms 21816 KB Output is correct
9 Correct 87 ms 21908 KB Output is correct
10 Correct 83 ms 27336 KB Output is correct
11 Correct 81 ms 27272 KB Output is correct
12 Correct 80 ms 16852 KB Output is correct
13 Correct 79 ms 17036 KB Output is correct
14 Correct 96 ms 16968 KB Output is correct
15 Correct 93 ms 16960 KB Output is correct
16 Correct 90 ms 16944 KB Output is correct
17 Correct 101 ms 17184 KB Output is correct
18 Correct 88 ms 17044 KB Output is correct
19 Correct 83 ms 17460 KB Output is correct
20 Correct 75 ms 22060 KB Output is correct
21 Correct 79 ms 22052 KB Output is correct
22 Correct 78 ms 22092 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2660 KB Output is correct
2 Correct 6 ms 4052 KB Output is correct
3 Correct 7 ms 4052 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2660 KB Output is correct
6 Correct 7 ms 4588 KB Output is correct
7 Correct 6 ms 4204 KB Output is correct
8 Correct 5 ms 4052 KB Output is correct
9 Correct 6 ms 4104 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2656 KB Output is correct
15 Correct 33 ms 4488 KB Output is correct
16 Correct 34 ms 4492 KB Output is correct
17 Correct 32 ms 4480 KB Output is correct
18 Correct 7 ms 4584 KB Output is correct
19 Correct 6 ms 4184 KB Output is correct
20 Correct 26 ms 4588 KB Output is correct
21 Correct 29 ms 4628 KB Output is correct
22 Correct 2 ms 2656 KB Output is correct
23 Correct 7 ms 4052 KB Output is correct
24 Correct 7 ms 4104 KB Output is correct
25 Correct 2 ms 2656 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 6 ms 4564 KB Output is correct
28 Correct 6 ms 4200 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 93 ms 27288 KB Output is correct
37 Correct 2 ms 2660 KB Output is correct
38 Correct 108 ms 26960 KB Output is correct
39 Correct 91 ms 26316 KB Output is correct
40 Correct 88 ms 27368 KB Output is correct
41 Correct 86 ms 27604 KB Output is correct
42 Correct 77 ms 21644 KB Output is correct
43 Correct 97 ms 17520 KB Output is correct
44 Correct 100 ms 16948 KB Output is correct
45 Correct 100 ms 17048 KB Output is correct
46 Correct 96 ms 17024 KB Output is correct
47 Correct 75 ms 21764 KB Output is correct
48 Correct 78 ms 21704 KB Output is correct
49 Correct 91 ms 21816 KB Output is correct
50 Correct 87 ms 21908 KB Output is correct
51 Correct 83 ms 27336 KB Output is correct
52 Correct 81 ms 27272 KB Output is correct
53 Correct 80 ms 16852 KB Output is correct
54 Correct 79 ms 17036 KB Output is correct
55 Correct 96 ms 16968 KB Output is correct
56 Correct 93 ms 16960 KB Output is correct
57 Correct 90 ms 16944 KB Output is correct
58 Correct 101 ms 17184 KB Output is correct
59 Correct 88 ms 17044 KB Output is correct
60 Correct 83 ms 17460 KB Output is correct
61 Correct 75 ms 22060 KB Output is correct
62 Correct 79 ms 22052 KB Output is correct
63 Correct 78 ms 22092 KB Output is correct
64 Correct 84 ms 21876 KB Output is correct
65 Correct 100 ms 16992 KB Output is correct
66 Correct 106 ms 16972 KB Output is correct
67 Correct 99 ms 16980 KB Output is correct
68 Correct 63 ms 16856 KB Output is correct
69 Correct 64 ms 16836 KB Output is correct
70 Correct 83 ms 22252 KB Output is correct
71 Correct 85 ms 21600 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 6 ms 4052 KB Output is correct
74 Correct 6 ms 4052 KB Output is correct
75 Correct 2 ms 2772 KB Output is correct
76 Correct 2 ms 2772 KB Output is correct
77 Correct 7 ms 4588 KB Output is correct
78 Correct 8 ms 4232 KB Output is correct
79 Correct 7 ms 4100 KB Output is correct
80 Correct 7 ms 4180 KB Output is correct
81 Correct 2 ms 2772 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2656 KB Output is correct
84 Correct 2 ms 2660 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 34 ms 4476 KB Output is correct
87 Correct 32 ms 4432 KB Output is correct
88 Correct 32 ms 4468 KB Output is correct
89 Correct 7 ms 4564 KB Output is correct
90 Correct 7 ms 4212 KB Output is correct
91 Correct 23 ms 4620 KB Output is correct
92 Correct 28 ms 4588 KB Output is correct
93 Correct 2 ms 2772 KB Output is correct
94 Correct 93 ms 27280 KB Output is correct
95 Correct 88 ms 26928 KB Output is correct
96 Correct 86 ms 26320 KB Output is correct
97 Correct 88 ms 27144 KB Output is correct
98 Correct 91 ms 27636 KB Output is correct
99 Correct 96 ms 16980 KB Output is correct
100 Correct 87 ms 16960 KB Output is correct
101 Correct 90 ms 17036 KB Output is correct
102 Correct 88 ms 17432 KB Output is correct
103 Correct 76 ms 21712 KB Output is correct
104 Correct 81 ms 22100 KB Output is correct
105 Correct 73 ms 21724 KB Output is correct
106 Correct 84 ms 21888 KB Output is correct
107 Correct 85 ms 21884 KB Output is correct
108 Correct 79 ms 27324 KB Output is correct
109 Correct 77 ms 27352 KB Output is correct
110 Correct 70 ms 16844 KB Output is correct
111 Correct 77 ms 16844 KB Output is correct
112 Correct 108 ms 16976 KB Output is correct
113 Correct 107 ms 17024 KB Output is correct