oj.uz

답안 #197160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197160 2020-01-19T11:42:38 Z dndhk Railway (BOI17_railway) C++14
100 / 100
 174 ms 24976 KB 
#include <bits/stdc++.h>

#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1000000000;
const int MAX_N = 100000;
const int MAX_K = 20;

int N, M, K;
vector<int> gp[MAX_N+1];
int lv[MAX_N+1], up[MAX_N+1][MAX_K+1], p[MAX_N+1];
int in[MAX_N+1], out[MAX_N+1], cnt;
int dp[MAX_N+1];
vector<pii> edge;

void dfs(int x){
	in[x] = ++cnt;
	up[x][0] = p[x];
	for(int i=1; i<MAX_K; i++){
		up[x][i] = up[up[x][i-1]][i-1];
	}
	for(int i : gp[x]){
		if(i==p[x])	continue;
		lv[i] = lv[x]+1;
		p[i] = x;
		dfs(i);
	}
	out[x] = ++cnt;
}

int lca(int x, int y){
	for(int i=MAX_K-1; i>=0; i--){
		if(lv[up[x][i]]>=lv[y]){
			x = up[x][i];
		}
		if(lv[up[y][i]]>=lv[x]){
			y = up[y][i];
		}
	}
	if(x==y)	return x;
	for(int i=MAX_K-1; i>=0; i--){
		if(up[x][i]!=up[y][i]){
			x = up[x][i];
			y = up[y][i];
		}
	}
	return up[x][0];
}

vector<int> v;
bool sf(int x, int y){
	return in[x]<in[y];
}
vector<int> ans;

void dfs2(int x){
	for(int i : gp[x]){
		if(i==p[x])	continue;
		dfs2(i);
		dp[x]+=dp[i];
	}
}

int main(){
	scanf("%d%d%d", &N, &M, &K);
	for(int i=1; i<N; i++){
		int a, b;
		scanf("%d%d", &a, &b);
		edge.pb({a, b});
		gp[a].pb(b); gp[b].pb(a);
	}
	lv[1] = 1; dfs(1);
	for(int i=1; i<=M; i++){
		int sz; scanf("%d", &sz);
		while(!v.empty())	v.pop_back();
		while(sz--){
			int x; scanf("%d", &x);
			v.pb(x);
		}
		sort(v.begin(), v.end(), sf);
		int r = v[0];
		for(int i=0; i<v.size()-1; i++){
			int l = lca(v[i], v[i+1]);
			if(lv[l]>=lv[r]){
				dp[v[i+1]]++;
				dp[l]--;
			}else{
				dp[r]++;
				dp[v[i+1]]++;
				dp[l]-=2;
				r = l;
			}
		}
	}
	dfs2(1);
	// for(int i=1; i<=N; i++){
	// 	cout<<i<<" "<<p[i]<<" "<<dp[i]<<endl;
	// }
	for(int i=0; i<edge.size(); i++){
		if(p[edge[i].first]==edge[i].second && dp[edge[i].first]>=K){
			ans.pb(i+1);
		}else if(p[edge[i].second]==edge[i].first && dp[edge[i].second]>=K){
			ans.pb(i+1);
		}
	}
	printf("%d\n", (int)ans.size());
	for(int i=0; i<ans.size(); i++){
		printf("%d ", ans[i]);
	}
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:88:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<v.size()-1; i++){
                ~^~~~~~~~~~~
railway.cpp:105:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<edge.size(); i++){
               ~^~~~~~~~~~~~
railway.cpp:113:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<ans.size(); i++){
               ~^~~~~~~~~~~
railway.cpp:71: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:74:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~
railway.cpp:80:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int sz; scanf("%d", &sz);
           ~~~~~^~~~~~~~~~~
railway.cpp:83:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    int x; scanf("%d", &x);
           ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2680 KB Output is correct
2 Correct 11 ms 4216 KB Output is correct
3 Correct 12 ms 4216 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 3 ms 2680 KB Output is correct
6 Correct 14 ms 4472 KB Output is correct
7 Correct 11 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Correct 10 ms 4216 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2708 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 7 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2680 KB Output is correct
2 Correct 11 ms 4216 KB Output is correct
3 Correct 12 ms 4216 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 3 ms 2680 KB Output is correct
6 Correct 14 ms 4472 KB Output is correct
7 Correct 11 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Correct 10 ms 4216 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2708 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 7 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 40 ms 4540 KB Output is correct
16 Correct 41 ms 4604 KB Output is correct
17 Correct 41 ms 4676 KB Output is correct
18 Correct 12 ms 4472 KB Output is correct
19 Correct 12 ms 4216 KB Output is correct
20 Correct 45 ms 4856 KB Output is correct
21 Correct 47 ms 4732 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 11 ms 4220 KB Output is correct
24 Correct 11 ms 4216 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 12 ms 4472 KB Output is correct
28 Correct 12 ms 4348 KB Output is correct
29 Correct 10 ms 4216 KB Output is correct
30 Correct 12 ms 4216 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 6 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 24524 KB Output is correct
2 Correct 5 ms 2680 KB Output is correct
3 Correct 144 ms 24044 KB Output is correct
4 Correct 137 ms 23276 KB Output is correct
5 Correct 168 ms 24556 KB Output is correct
6 Correct 143 ms 24976 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 20908 KB Output is correct
2 Correct 136 ms 18948 KB Output is correct
3 Correct 137 ms 18920 KB Output is correct
4 Correct 130 ms 18664 KB Output is correct
5 Correct 133 ms 18668 KB Output is correct
6 Correct 121 ms 21100 KB Output is correct
7 Correct 121 ms 21148 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 20908 KB Output is correct
2 Correct 136 ms 18948 KB Output is correct
3 Correct 137 ms 18920 KB Output is correct
4 Correct 130 ms 18664 KB Output is correct
5 Correct 133 ms 18668 KB Output is correct
6 Correct 121 ms 21100 KB Output is correct
7 Correct 121 ms 21148 KB Output is correct
8 Correct 144 ms 21100 KB Output is correct
9 Correct 141 ms 21064 KB Output is correct
10 Correct 144 ms 24632 KB Output is correct
11 Correct 144 ms 24596 KB Output is correct
12 Correct 106 ms 18412 KB Output is correct
13 Correct 109 ms 18512 KB Output is correct
14 Correct 147 ms 18520 KB Output is correct
15 Correct 142 ms 18564 KB Output is correct
16 Correct 138 ms 18628 KB Output is correct
17 Correct 133 ms 18668 KB Output is correct
18 Correct 170 ms 18808 KB Output is correct
19 Correct 136 ms 18956 KB Output is correct
20 Correct 130 ms 21356 KB Output is correct
21 Correct 127 ms 21600 KB Output is correct
22 Correct 125 ms 21400 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2680 KB Output is correct
2 Correct 11 ms 4216 KB Output is correct
3 Correct 12 ms 4216 KB Output is correct
4 Correct 4 ms 2684 KB Output is correct
5 Correct 3 ms 2680 KB Output is correct
6 Correct 14 ms 4472 KB Output is correct
7 Correct 11 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Correct 10 ms 4216 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 5 ms 2708 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 7 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 40 ms 4540 KB Output is correct
16 Correct 41 ms 4604 KB Output is correct
17 Correct 41 ms 4676 KB Output is correct
18 Correct 12 ms 4472 KB Output is correct
19 Correct 12 ms 4216 KB Output is correct
20 Correct 45 ms 4856 KB Output is correct
21 Correct 47 ms 4732 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 11 ms 4220 KB Output is correct
24 Correct 11 ms 4216 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 12 ms 4472 KB Output is correct
28 Correct 12 ms 4348 KB Output is correct
29 Correct 10 ms 4216 KB Output is correct
30 Correct 12 ms 4216 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 6 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 143 ms 24524 KB Output is correct
37 Correct 5 ms 2680 KB Output is correct
38 Correct 144 ms 24044 KB Output is correct
39 Correct 137 ms 23276 KB Output is correct
40 Correct 168 ms 24556 KB Output is correct
41 Correct 143 ms 24976 KB Output is correct
42 Correct 123 ms 20908 KB Output is correct
43 Correct 136 ms 18948 KB Output is correct
44 Correct 137 ms 18920 KB Output is correct
45 Correct 130 ms 18664 KB Output is correct
46 Correct 133 ms 18668 KB Output is correct
47 Correct 121 ms 21100 KB Output is correct
48 Correct 121 ms 21148 KB Output is correct
49 Correct 144 ms 21100 KB Output is correct
50 Correct 141 ms 21064 KB Output is correct
51 Correct 144 ms 24632 KB Output is correct
52 Correct 144 ms 24596 KB Output is correct
53 Correct 106 ms 18412 KB Output is correct
54 Correct 109 ms 18512 KB Output is correct
55 Correct 147 ms 18520 KB Output is correct
56 Correct 142 ms 18564 KB Output is correct
57 Correct 138 ms 18628 KB Output is correct
58 Correct 133 ms 18668 KB Output is correct
59 Correct 170 ms 18808 KB Output is correct
60 Correct 136 ms 18956 KB Output is correct
61 Correct 130 ms 21356 KB Output is correct
62 Correct 127 ms 21600 KB Output is correct
63 Correct 125 ms 21400 KB Output is correct
64 Correct 131 ms 21304 KB Output is correct
65 Correct 148 ms 18620 KB Output is correct
66 Correct 171 ms 18708 KB Output is correct
67 Correct 154 ms 18676 KB Output is correct
68 Correct 102 ms 18540 KB Output is correct
69 Correct 100 ms 18540 KB Output is correct
70 Correct 130 ms 21736 KB Output is correct
71 Correct 133 ms 20976 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 11 ms 4216 KB Output is correct
74 Correct 11 ms 4216 KB Output is correct
75 Correct 4 ms 2680 KB Output is correct
76 Correct 4 ms 2680 KB Output is correct
77 Correct 12 ms 4600 KB Output is correct
78 Correct 11 ms 4216 KB Output is correct
79 Correct 10 ms 4216 KB Output is correct
80 Correct 10 ms 4216 KB Output is correct
81 Correct 5 ms 2680 KB Output is correct
82 Correct 4 ms 2680 KB Output is correct
83 Correct 4 ms 2684 KB Output is correct
84 Correct 4 ms 2680 KB Output is correct
85 Correct 4 ms 2680 KB Output is correct
86 Correct 39 ms 4600 KB Output is correct
87 Correct 40 ms 4604 KB Output is correct
88 Correct 40 ms 4728 KB Output is correct
89 Correct 12 ms 4508 KB Output is correct
90 Correct 12 ms 4300 KB Output is correct
91 Correct 44 ms 4856 KB Output is correct
92 Correct 46 ms 4856 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 149 ms 24528 KB Output is correct
95 Correct 144 ms 23936 KB Output is correct
96 Correct 141 ms 23332 KB Output is correct
97 Correct 168 ms 24556 KB Output is correct
98 Correct 146 ms 24936 KB Output is correct
99 Correct 136 ms 18680 KB Output is correct
100 Correct 134 ms 18696 KB Output is correct
101 Correct 132 ms 18668 KB Output is correct
102 Correct 133 ms 18896 KB Output is correct
103 Correct 120 ms 21040 KB Output is correct
104 Correct 121 ms 21480 KB Output is correct
105 Correct 120 ms 20972 KB Output is correct
106 Correct 150 ms 21240 KB Output is correct
107 Correct 139 ms 21100 KB Output is correct
108 Correct 145 ms 24696 KB Output is correct
109 Correct 174 ms 24592 KB Output is correct
110 Correct 135 ms 18540 KB Output is correct
111 Correct 108 ms 18540 KB Output is correct
112 Correct 146 ms 18536 KB Output is correct
113 Correct 145 ms 18604 KB Output is correct