oj.uz

Submission #64462

# Submission time Handle Problem Language Result Execution time Memory
64462 2018-08-04T14:37:11 Z Sherazin Race (IOI11_race) C++14
21 / 100
 3000 ms 34652 KB 
//#include <race.h>
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 2e5 + 5;
const int M = 1e6 + 5;

int n, k, ans = -1;
int sub[N];
int dp[M], tim[M];
vector<pii> g[N];

int getsz(int u, int p) {
	sub[u] = 1;
	for(pii v : g[u]) if(v.x != p) sub[u] += getsz(v.x, u);
	return sub[u];	
}

void add(int u, int p, int cost, int len, int cnt) {
	if(cost > k) return;
	if(tim[k - cost] == cnt && (ans == -1 || len + dp[k - cost] < ans)) ans = len + dp[k - cost];
	if(cost == k && (ans == -1 || len < ans)) ans = len;
	for(pii v : g[u]) if(v.x != p) add(v.x, u, cost + v.y, len + 1, cnt);
}

void prep(int u, int p, int cost, int len, int cnt) {
	if(cost > k) return;
	if(tim[cost] != cnt || len < dp[cost]) tim[cost] = cnt, dp[cost] = len;
	for(pii v : g[u]) if(v.x != p) prep(v.x, u, cost + v.y, len + 1, cnt);
}

void dfs(int u, int p, bool keep, int cost) {
	int mx = 0, hv, hve;
	for(pii v : g[u]) if(v.x != p && mx < sub[v.x]) mx = sub[v.x], hv = v.x, hve = v.y;
	for(pii v : g[u]) if(v.x != p && v.x != hv) dfs(v.x, u, 0, v.y);
	if(mx) dfs(hv, u, 1, hve);
	for(pii v : g[u]) if(v.x != p && v.x != hv) {
		add(v.x, u, v.y, 1, u);
		prep(v.x, u, v.y, 1, u);
	}
	if(tim[k] == u && (ans == -1 || dp[k] < ans)) ans = dp[k]; 
	/*printf("%d: ", u);
	for(int i = 1; i <= k + 1; i++) {if(tim[i] == u) printf("%d ", dp[i]); else printf("X ");}
	printf("\n");*/
	if(keep) prep(u, p, cost, 1, p);
}

int best_path(int N, int K, int H[][2], int L[])
{
	n = N, k = K;
	for(int i = 0; i < N - 1; i++) {
		g[H[i][0]].emplace_back(H[i][1], L[i]);
		g[H[i][1]].emplace_back(H[i][0], L[i]);
	}
	fill(begin(tim), end(tim), -1);
	getsz(0, 0);
	dfs(0, 0, 1, 0);
 
	return ans;
}

/*int main() {
	scanf("%d%d", &n, &k);
	for(int i = 1, u, v, w; i <= n; i++) {
		scanf("%d%d%d", &u, &v, &w);
		g[u].emplace_back(v, w);
		g[v].emplace_back(u, w);
	}

	fill(begin(tim), end(tim), -1);
	getsz(0, 0);
	dfs(0, 0, 1, 0);	
	printf("%d", ans);

	return 0;
}*/

Compilation message

race.cpp: In function 'void dfs(int, int, bool, int)':
race.cpp:40:32: warning: 'hv' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for(pii v : g[u]) if(v.x != p && v.x != hv) dfs(v.x, u, 0, v.y);
                       ~~~~~~~~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8924 KB Output is correct
2 Correct 10 ms 8940 KB Output is correct
3 Correct 12 ms 8992 KB Output is correct
4 Correct 10 ms 9092 KB Output is correct
5 Correct 10 ms 9092 KB Output is correct
6 Correct 12 ms 9092 KB Output is correct
7 Correct 10 ms 9108 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 13 ms 9188 KB Output is correct
10 Correct 12 ms 9192 KB Output is correct
11 Correct 10 ms 9196 KB Output is correct
12 Correct 11 ms 9204 KB Output is correct
13 Correct 13 ms 9268 KB Output is correct
14 Correct 10 ms 9272 KB Output is correct
15 Correct 12 ms 9272 KB Output is correct
16 Correct 12 ms 9272 KB Output is correct
17 Correct 10 ms 9272 KB Output is correct
18 Correct 12 ms 9272 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8924 KB Output is correct
2 Correct 10 ms 8940 KB Output is correct
3 Correct 12 ms 8992 KB Output is correct
4 Correct 10 ms 9092 KB Output is correct
5 Correct 10 ms 9092 KB Output is correct
6 Correct 12 ms 9092 KB Output is correct
7 Correct 10 ms 9108 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 13 ms 9188 KB Output is correct
10 Correct 12 ms 9192 KB Output is correct
11 Correct 10 ms 9196 KB Output is correct
12 Correct 11 ms 9204 KB Output is correct
13 Correct 13 ms 9268 KB Output is correct
14 Correct 10 ms 9272 KB Output is correct
15 Correct 12 ms 9272 KB Output is correct
16 Correct 12 ms 9272 KB Output is correct
17 Correct 10 ms 9272 KB Output is correct
18 Correct 12 ms 9272 KB Output is correct
19 Correct 11 ms 9272 KB Output is correct
20 Correct 11 ms 9272 KB Output is correct
21 Correct 11 ms 9328 KB Output is correct
22 Correct 15 ms 11964 KB Output is correct
23 Correct 16 ms 11964 KB Output is correct
24 Correct 16 ms 12252 KB Output is correct
25 Correct 17 ms 12252 KB Output is correct
26 Correct 14 ms 12252 KB Output is correct
27 Correct 15 ms 12252 KB Output is correct
28 Correct 15 ms 12252 KB Output is correct
29 Correct 14 ms 12252 KB Output is correct
30 Correct 17 ms 12252 KB Output is correct
31 Correct 17 ms 12252 KB Output is correct
32 Correct 16 ms 12252 KB Output is correct
33 Correct 14 ms 12524 KB Output is correct
34 Correct 14 ms 12524 KB Output is correct
35 Correct 17 ms 12904 KB Output is correct
36 Correct 21 ms 13328 KB Output is correct
37 Correct 22 ms 13328 KB Output is correct
38 Correct 14 ms 13328 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8924 KB Output is correct
2 Correct 10 ms 8940 KB Output is correct
3 Correct 12 ms 8992 KB Output is correct
4 Correct 10 ms 9092 KB Output is correct
5 Correct 10 ms 9092 KB Output is correct
6 Correct 12 ms 9092 KB Output is correct
7 Correct 10 ms 9108 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 13 ms 9188 KB Output is correct
10 Correct 12 ms 9192 KB Output is correct
11 Correct 10 ms 9196 KB Output is correct
12 Correct 11 ms 9204 KB Output is correct
13 Correct 13 ms 9268 KB Output is correct
14 Correct 10 ms 9272 KB Output is correct
15 Correct 12 ms 9272 KB Output is correct
16 Correct 12 ms 9272 KB Output is correct
17 Correct 10 ms 9272 KB Output is correct
18 Correct 12 ms 9272 KB Output is correct
19 Correct 171 ms 16164 KB Output is correct
20 Correct 191 ms 17512 KB Output is correct
21 Correct 255 ms 18892 KB Output is correct
22 Correct 269 ms 20332 KB Output is correct
23 Correct 136 ms 22036 KB Output is correct
24 Correct 128 ms 23192 KB Output is correct
25 Correct 2192 ms 28980 KB Output is correct
26 Execution timed out 3030 ms 34652 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8924 KB Output is correct
2 Correct 10 ms 8940 KB Output is correct
3 Correct 12 ms 8992 KB Output is correct
4 Correct 10 ms 9092 KB Output is correct
5 Correct 10 ms 9092 KB Output is correct
6 Correct 12 ms 9092 KB Output is correct
7 Correct 10 ms 9108 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 13 ms 9188 KB Output is correct
10 Correct 12 ms 9192 KB Output is correct
11 Correct 10 ms 9196 KB Output is correct
12 Correct 11 ms 9204 KB Output is correct
13 Correct 13 ms 9268 KB Output is correct
14 Correct 10 ms 9272 KB Output is correct
15 Correct 12 ms 9272 KB Output is correct
16 Correct 12 ms 9272 KB Output is correct
17 Correct 10 ms 9272 KB Output is correct
18 Correct 12 ms 9272 KB Output is correct
19 Correct 11 ms 9272 KB Output is correct
20 Correct 11 ms 9272 KB Output is correct
21 Correct 11 ms 9328 KB Output is correct
22 Correct 15 ms 11964 KB Output is correct
23 Correct 16 ms 11964 KB Output is correct
24 Correct 16 ms 12252 KB Output is correct
25 Correct 17 ms 12252 KB Output is correct
26 Correct 14 ms 12252 KB Output is correct
27 Correct 15 ms 12252 KB Output is correct
28 Correct 15 ms 12252 KB Output is correct
29 Correct 14 ms 12252 KB Output is correct
30 Correct 17 ms 12252 KB Output is correct
31 Correct 17 ms 12252 KB Output is correct
32 Correct 16 ms 12252 KB Output is correct
33 Correct 14 ms 12524 KB Output is correct
34 Correct 14 ms 12524 KB Output is correct
35 Correct 17 ms 12904 KB Output is correct
36 Correct 21 ms 13328 KB Output is correct
37 Correct 22 ms 13328 KB Output is correct
38 Correct 14 ms 13328 KB Output is correct
39 Correct 171 ms 16164 KB Output is correct
40 Correct 191 ms 17512 KB Output is correct
41 Correct 255 ms 18892 KB Output is correct
42 Correct 269 ms 20332 KB Output is correct
43 Correct 136 ms 22036 KB Output is correct
44 Correct 128 ms 23192 KB Output is correct
45 Correct 2192 ms 28980 KB Output is correct
46 Execution timed out 3030 ms 34652 KB Time limit exceeded
47 Halted 0 ms 0 KB -