oj.uz

답안 #208061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208061 2020-03-10T00:07:43 Z ly20 Railway (BOI17_railway) C++17
100 / 100
 266 ms 37128 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 112345, MAXK = 20;
int t;
vector < int > grafo[MAXN];
int marc[MAXN], dp[MAXN][MAXK], prof[MAXN];
int id[MAXN];
void dfs(int v, int p) {
	dp[v][0] = p;
	t++;
	id[v] = t;
	for(int i = 0; i < grafo[v].size(); i++) {
		int viz = grafo[v][i];
		if(viz == p) continue;
		prof[viz] = prof[v] + 1;
		dfs(viz, v);
	}
}
int lca(int a, int b) {
	if(prof[a] > prof[b]) swap(a, b);
	int d = prof[b] - prof[a];
	for(int i = 0; i < MAXK; i++) {
		if((1 << i) & d) b = dp[b][i];
	}
	if(a == b) return a;
	for(int i = MAXK - 1; i >= 0; i--) {
		if(dp[a][i] != dp[b][i]) {
			a = dp[a][i]; b = dp[b][i];
		}
	}
	return dp[a][0];
}
void dfs2(int v, int p) {
	for(int i = 0; i < grafo[v].size(); i++) {
		int viz = grafo[v][i];
		if(viz == p) continue;
		dfs2(viz, v);
		marc[v] += marc[viz];
	}
}
bool cmp(int a, int b) {
	return id[a] < id[b];
}
map < pair < int, int >, int > mp;
int main() {
	int n, m, k;
	scanf("%d %d %d", &n, &m, &k);
	for(int i = 0; i < n - 1; i++) {
		int a, b;
		scanf("%d %d", &a, &b); a--; b--;
		grafo[a].push_back(b); grafo[b].push_back(a);
		mp[make_pair(a, b)] = i + 1; mp[make_pair(b, a)] = i + 1;
	}
	dfs(0, 0);
	for(int i = 1; i < MAXK; i++) {
		for(int j = 0; j < n; j++) {
			dp[j][i] = dp[dp[j][i - 1]][i - 1];
		}
	}
	for(int i = 0; i < m; i++) {
		int s;
		scanf("%d", &s);
		vector < int > v;
		for(int j = 0; j < s; j++) {
			int a;
			scanf("%d", &a); a--;
			marc[a]++;
			v.push_back(a);
		}
		sort(v.begin(), v.end(), cmp);
		for(int j = 1; j < s; j++) {
			//printf("%d %d\n", v[j], v[j - 1]);
			marc[lca(v[j], v[j - 1])]--;
		}
		marc[lca(v[0], v[s - 1])]--;
	}
	dfs2(0, 0);
	vector < int > resp;
	for(int i = 0; i < n; i++) {
		if(marc[i] >= k) resp.push_back(mp[make_pair(i, dp[i][0])]);
	}
	sort(resp.begin(), resp.end());
	printf("%d\n", resp.size());
	for(int i = 0; i < resp.size(); i++) {
		printf("%d ", resp[i]);
	}
	printf("\n");
	return 0;
}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:12:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < grafo[v].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~
railway.cpp: In function 'void dfs2(int, int)':
railway.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < grafo[v].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:83:28: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
  printf("%d\n", resp.size());
                 ~~~~~~~~~~~^
railway.cpp:84:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < resp.size(); i++) {
                 ~~^~~~~~~~~~~~~
railway.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &m, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a, &b); a--; b--;
   ~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s);
   ~~~~~^~~~~~~~~~
railway.cpp:66:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a); a--;
    ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2940 KB Output is correct
2 Correct 17 ms 5496 KB Output is correct
3 Correct 17 ms 5624 KB Output is correct
4 Correct 6 ms 2936 KB Output is correct
5 Correct 6 ms 2936 KB Output is correct
6 Correct 17 ms 6008 KB Output is correct
7 Correct 17 ms 5624 KB Output is correct
8 Correct 15 ms 5624 KB Output is correct
9 Correct 16 ms 5624 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 6 ms 2936 KB Output is correct
12 Correct 6 ms 2936 KB Output is correct
13 Correct 6 ms 2936 KB Output is correct
14 Correct 6 ms 2936 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2940 KB Output is correct
2 Correct 17 ms 5496 KB Output is correct
3 Correct 17 ms 5624 KB Output is correct
4 Correct 6 ms 2936 KB Output is correct
5 Correct 6 ms 2936 KB Output is correct
6 Correct 17 ms 6008 KB Output is correct
7 Correct 17 ms 5624 KB Output is correct
8 Correct 15 ms 5624 KB Output is correct
9 Correct 16 ms 5624 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 6 ms 2936 KB Output is correct
12 Correct 6 ms 2936 KB Output is correct
13 Correct 6 ms 2936 KB Output is correct
14 Correct 6 ms 2936 KB Output is correct
15 Correct 38 ms 5880 KB Output is correct
16 Correct 40 ms 6008 KB Output is correct
17 Correct 41 ms 6008 KB Output is correct
18 Correct 18 ms 6008 KB Output is correct
19 Correct 18 ms 5624 KB Output is correct
20 Correct 42 ms 6140 KB Output is correct
21 Correct 40 ms 6008 KB Output is correct
22 Correct 6 ms 2936 KB Output is correct
23 Correct 17 ms 5624 KB Output is correct
24 Correct 20 ms 5624 KB Output is correct
25 Correct 6 ms 2936 KB Output is correct
26 Correct 6 ms 2940 KB Output is correct
27 Correct 18 ms 5880 KB Output is correct
28 Correct 17 ms 5624 KB Output is correct
29 Correct 15 ms 5500 KB Output is correct
30 Correct 17 ms 5624 KB Output is correct
31 Correct 6 ms 2936 KB Output is correct
32 Correct 6 ms 2936 KB Output is correct
33 Correct 6 ms 2936 KB Output is correct
34 Correct 6 ms 2936 KB Output is correct
35 Correct 6 ms 2936 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 36592 KB Output is correct
2 Correct 6 ms 2936 KB Output is correct
3 Correct 180 ms 36340 KB Output is correct
4 Correct 178 ms 35700 KB Output is correct
5 Correct 186 ms 36668 KB Output is correct
6 Correct 195 ms 37128 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 32632 KB Output is correct
2 Correct 244 ms 29944 KB Output is correct
3 Correct 249 ms 29560 KB Output is correct
4 Correct 246 ms 29560 KB Output is correct
5 Correct 255 ms 29560 KB Output is correct
6 Correct 194 ms 32760 KB Output is correct
7 Correct 200 ms 32764 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 32632 KB Output is correct
2 Correct 244 ms 29944 KB Output is correct
3 Correct 249 ms 29560 KB Output is correct
4 Correct 246 ms 29560 KB Output is correct
5 Correct 255 ms 29560 KB Output is correct
6 Correct 194 ms 32760 KB Output is correct
7 Correct 200 ms 32764 KB Output is correct
8 Correct 219 ms 32760 KB Output is correct
9 Correct 201 ms 32760 KB Output is correct
10 Correct 174 ms 36720 KB Output is correct
11 Correct 179 ms 36720 KB Output is correct
12 Correct 177 ms 29560 KB Output is correct
13 Correct 171 ms 29432 KB Output is correct
14 Correct 241 ms 29432 KB Output is correct
15 Correct 236 ms 29432 KB Output is correct
16 Correct 253 ms 29816 KB Output is correct
17 Correct 241 ms 29560 KB Output is correct
18 Correct 240 ms 29560 KB Output is correct
19 Correct 249 ms 29816 KB Output is correct
20 Correct 203 ms 33016 KB Output is correct
21 Correct 203 ms 33016 KB Output is correct
22 Correct 213 ms 33144 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2940 KB Output is correct
2 Correct 17 ms 5496 KB Output is correct
3 Correct 17 ms 5624 KB Output is correct
4 Correct 6 ms 2936 KB Output is correct
5 Correct 6 ms 2936 KB Output is correct
6 Correct 17 ms 6008 KB Output is correct
7 Correct 17 ms 5624 KB Output is correct
8 Correct 15 ms 5624 KB Output is correct
9 Correct 16 ms 5624 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 6 ms 2936 KB Output is correct
12 Correct 6 ms 2936 KB Output is correct
13 Correct 6 ms 2936 KB Output is correct
14 Correct 6 ms 2936 KB Output is correct
15 Correct 38 ms 5880 KB Output is correct
16 Correct 40 ms 6008 KB Output is correct
17 Correct 41 ms 6008 KB Output is correct
18 Correct 18 ms 6008 KB Output is correct
19 Correct 18 ms 5624 KB Output is correct
20 Correct 42 ms 6140 KB Output is correct
21 Correct 40 ms 6008 KB Output is correct
22 Correct 6 ms 2936 KB Output is correct
23 Correct 17 ms 5624 KB Output is correct
24 Correct 20 ms 5624 KB Output is correct
25 Correct 6 ms 2936 KB Output is correct
26 Correct 6 ms 2940 KB Output is correct
27 Correct 18 ms 5880 KB Output is correct
28 Correct 17 ms 5624 KB Output is correct
29 Correct 15 ms 5500 KB Output is correct
30 Correct 17 ms 5624 KB Output is correct
31 Correct 6 ms 2936 KB Output is correct
32 Correct 6 ms 2936 KB Output is correct
33 Correct 6 ms 2936 KB Output is correct
34 Correct 6 ms 2936 KB Output is correct
35 Correct 6 ms 2936 KB Output is correct
36 Correct 197 ms 36592 KB Output is correct
37 Correct 6 ms 2936 KB Output is correct
38 Correct 180 ms 36340 KB Output is correct
39 Correct 178 ms 35700 KB Output is correct
40 Correct 186 ms 36668 KB Output is correct
41 Correct 195 ms 37128 KB Output is correct
42 Correct 199 ms 32632 KB Output is correct
43 Correct 244 ms 29944 KB Output is correct
44 Correct 249 ms 29560 KB Output is correct
45 Correct 246 ms 29560 KB Output is correct
46 Correct 255 ms 29560 KB Output is correct
47 Correct 194 ms 32760 KB Output is correct
48 Correct 200 ms 32764 KB Output is correct
49 Correct 219 ms 32760 KB Output is correct
50 Correct 201 ms 32760 KB Output is correct
51 Correct 174 ms 36720 KB Output is correct
52 Correct 179 ms 36720 KB Output is correct
53 Correct 177 ms 29560 KB Output is correct
54 Correct 171 ms 29432 KB Output is correct
55 Correct 241 ms 29432 KB Output is correct
56 Correct 236 ms 29432 KB Output is correct
57 Correct 253 ms 29816 KB Output is correct
58 Correct 241 ms 29560 KB Output is correct
59 Correct 240 ms 29560 KB Output is correct
60 Correct 249 ms 29816 KB Output is correct
61 Correct 203 ms 33016 KB Output is correct
62 Correct 203 ms 33016 KB Output is correct
63 Correct 213 ms 33144 KB Output is correct
64 Correct 206 ms 32864 KB Output is correct
65 Correct 255 ms 29580 KB Output is correct
66 Correct 266 ms 29432 KB Output is correct
67 Correct 246 ms 29560 KB Output is correct
68 Correct 201 ms 29432 KB Output is correct
69 Correct 180 ms 29304 KB Output is correct
70 Correct 210 ms 33192 KB Output is correct
71 Correct 207 ms 32504 KB Output is correct
72 Correct 6 ms 3064 KB Output is correct
73 Correct 17 ms 5496 KB Output is correct
74 Correct 18 ms 5496 KB Output is correct
75 Correct 6 ms 2936 KB Output is correct
76 Correct 6 ms 2936 KB Output is correct
77 Correct 18 ms 5880 KB Output is correct
78 Correct 17 ms 5628 KB Output is correct
79 Correct 15 ms 5496 KB Output is correct
80 Correct 18 ms 5624 KB Output is correct
81 Correct 6 ms 3064 KB Output is correct
82 Correct 6 ms 2936 KB Output is correct
83 Correct 6 ms 2936 KB Output is correct
84 Correct 6 ms 2936 KB Output is correct
85 Correct 6 ms 2936 KB Output is correct
86 Correct 38 ms 5880 KB Output is correct
87 Correct 42 ms 6008 KB Output is correct
88 Correct 40 ms 6008 KB Output is correct
89 Correct 18 ms 5880 KB Output is correct
90 Correct 18 ms 5624 KB Output is correct
91 Correct 40 ms 6136 KB Output is correct
92 Correct 42 ms 6008 KB Output is correct
93 Correct 6 ms 3096 KB Output is correct
94 Correct 196 ms 36700 KB Output is correct
95 Correct 183 ms 36340 KB Output is correct
96 Correct 176 ms 35704 KB Output is correct
97 Correct 193 ms 36720 KB Output is correct
98 Correct 181 ms 36976 KB Output is correct
99 Correct 236 ms 29560 KB Output is correct
100 Correct 244 ms 29560 KB Output is correct
101 Correct 241 ms 29560 KB Output is correct
102 Correct 242 ms 29944 KB Output is correct
103 Correct 193 ms 32760 KB Output is correct
104 Correct 199 ms 33016 KB Output is correct
105 Correct 192 ms 32736 KB Output is correct
106 Correct 206 ms 32888 KB Output is correct
107 Correct 204 ms 32760 KB Output is correct
108 Correct 188 ms 36848 KB Output is correct
109 Correct 176 ms 36716 KB Output is correct
110 Correct 169 ms 29432 KB Output is correct
111 Correct 179 ms 29432 KB Output is correct
112 Correct 233 ms 29432 KB Output is correct
113 Correct 233 ms 29432 KB Output is correct