Submission #62444

# Submission time Handle Problem Language Result Execution time Memory
62444 2018-07-28T13:23:09 Z Sherazin Race (IOI11_race) C++14
100 / 100
1228 ms 77736 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, book;
int ans = -1;
int sub[N], dp[M], tim[M];
vector<pii> g[N];
bitset<N> chk;
int cent, mxnode;

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

void centroid(int u, int p, int all) {
	int mxsub = all - sub[u];
	for(pii v : g[u]) if(v.x != p && !chk[v.x]) {
		centroid(v.x, u, all);
		mxsub = max(mxsub, sub[v.x]);
	}
	if(mxsub < mxnode) cent = u, mxnode = mxsub;
}

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

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

void dfs2(int u, int p, int cost, int edge, bool fill) {
	if(cost > k) return;
	if(!fill) {
		if(tim[k - cost] == book && (edge + dp[k - cost] < ans || ans == -1)) ans = edge + dp[k - cost];
		if(cost == k && (edge < ans || ans == -1)) ans = edge;
	} else if(tim[cost] < book || edge < dp[cost]) tim[cost] = book, dp[cost] = edge;
 
	for(pii v : g[u]) if(!chk[v.x] && v.x != p) {
		dfs2(v.x, u, cost + v.y, edge + 1, fill);
	}
}

void proc(int u) {
	book++;
	if(calcsz(u, u) <= 1) return;
	mxnode = sub[u] + 1;
	centroid(u, u, sub[u]);
	u = cent;
	//printf("%d\n", u);
	for(pii v : g[u]) if(!chk[v.x]) {
		dfs2(v.x, u, v.y, 1, false);
		dfs2(v.x, u, v.y, 1, true);
	}
	chk[u] = 1;
	for(pii v : g[u]) if(!chk[v.x]) proc(v.x);
}

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]);
	}

	proc(0);
	return ans;
}

/*int main() {
	int n, k, h[100][2], l[100];
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n - 1; i++) {
		scanf("%d %d %d", &h[i][0], &h[i][1], &l[i]);
	}
	printf("%d", best_path(n, k, h, l));

	return 0;
}*/
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 5064 KB Output is correct
4 Correct 9 ms 5064 KB Output is correct
5 Correct 8 ms 5148 KB Output is correct
6 Correct 7 ms 5148 KB Output is correct
7 Correct 8 ms 5232 KB Output is correct
8 Correct 8 ms 5288 KB Output is correct
9 Correct 9 ms 5288 KB Output is correct
10 Correct 8 ms 5296 KB Output is correct
11 Correct 8 ms 5300 KB Output is correct
12 Correct 7 ms 5304 KB Output is correct
13 Correct 7 ms 5304 KB Output is correct
14 Correct 8 ms 5316 KB Output is correct
15 Correct 7 ms 5316 KB Output is correct
16 Correct 8 ms 5324 KB Output is correct
17 Correct 9 ms 5328 KB Output is correct
18 Correct 10 ms 5328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 5064 KB Output is correct
4 Correct 9 ms 5064 KB Output is correct
5 Correct 8 ms 5148 KB Output is correct
6 Correct 7 ms 5148 KB Output is correct
7 Correct 8 ms 5232 KB Output is correct
8 Correct 8 ms 5288 KB Output is correct
9 Correct 9 ms 5288 KB Output is correct
10 Correct 8 ms 5296 KB Output is correct
11 Correct 8 ms 5300 KB Output is correct
12 Correct 7 ms 5304 KB Output is correct
13 Correct 7 ms 5304 KB Output is correct
14 Correct 8 ms 5316 KB Output is correct
15 Correct 7 ms 5316 KB Output is correct
16 Correct 8 ms 5324 KB Output is correct
17 Correct 9 ms 5328 KB Output is correct
18 Correct 10 ms 5328 KB Output is correct
19 Correct 7 ms 5328 KB Output is correct
20 Correct 6 ms 5328 KB Output is correct
21 Correct 9 ms 5344 KB Output is correct
22 Correct 13 ms 10348 KB Output is correct
23 Correct 15 ms 10348 KB Output is correct
24 Correct 18 ms 11096 KB Output is correct
25 Correct 16 ms 11096 KB Output is correct
26 Correct 13 ms 11096 KB Output is correct
27 Correct 10 ms 11096 KB Output is correct
28 Correct 11 ms 11096 KB Output is correct
29 Correct 12 ms 11096 KB Output is correct
30 Correct 15 ms 11096 KB Output is correct
31 Correct 13 ms 11096 KB Output is correct
32 Correct 14 ms 11096 KB Output is correct
33 Correct 14 ms 11096 KB Output is correct
34 Correct 14 ms 11096 KB Output is correct
35 Correct 14 ms 11476 KB Output is correct
36 Correct 17 ms 12096 KB Output is correct
37 Correct 13 ms 12096 KB Output is correct
38 Correct 10 ms 12096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 5064 KB Output is correct
4 Correct 9 ms 5064 KB Output is correct
5 Correct 8 ms 5148 KB Output is correct
6 Correct 7 ms 5148 KB Output is correct
7 Correct 8 ms 5232 KB Output is correct
8 Correct 8 ms 5288 KB Output is correct
9 Correct 9 ms 5288 KB Output is correct
10 Correct 8 ms 5296 KB Output is correct
11 Correct 8 ms 5300 KB Output is correct
12 Correct 7 ms 5304 KB Output is correct
13 Correct 7 ms 5304 KB Output is correct
14 Correct 8 ms 5316 KB Output is correct
15 Correct 7 ms 5316 KB Output is correct
16 Correct 8 ms 5324 KB Output is correct
17 Correct 9 ms 5328 KB Output is correct
18 Correct 10 ms 5328 KB Output is correct
19 Correct 343 ms 12328 KB Output is correct
20 Correct 343 ms 13644 KB Output is correct
21 Correct 311 ms 14996 KB Output is correct
22 Correct 451 ms 16348 KB Output is correct
23 Correct 263 ms 18044 KB Output is correct
24 Correct 141 ms 19296 KB Output is correct
25 Correct 305 ms 24188 KB Output is correct
26 Correct 171 ms 29068 KB Output is correct
27 Correct 344 ms 30340 KB Output is correct
28 Correct 776 ms 47704 KB Output is correct
29 Correct 835 ms 49620 KB Output is correct
30 Correct 330 ms 49620 KB Output is correct
31 Correct 354 ms 49620 KB Output is correct
32 Correct 402 ms 49620 KB Output is correct
33 Correct 760 ms 49620 KB Output is correct
34 Correct 654 ms 50920 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 5064 KB Output is correct
4 Correct 9 ms 5064 KB Output is correct
5 Correct 8 ms 5148 KB Output is correct
6 Correct 7 ms 5148 KB Output is correct
7 Correct 8 ms 5232 KB Output is correct
8 Correct 8 ms 5288 KB Output is correct
9 Correct 9 ms 5288 KB Output is correct
10 Correct 8 ms 5296 KB Output is correct
11 Correct 8 ms 5300 KB Output is correct
12 Correct 7 ms 5304 KB Output is correct
13 Correct 7 ms 5304 KB Output is correct
14 Correct 8 ms 5316 KB Output is correct
15 Correct 7 ms 5316 KB Output is correct
16 Correct 8 ms 5324 KB Output is correct
17 Correct 9 ms 5328 KB Output is correct
18 Correct 10 ms 5328 KB Output is correct
19 Correct 7 ms 5328 KB Output is correct
20 Correct 6 ms 5328 KB Output is correct
21 Correct 9 ms 5344 KB Output is correct
22 Correct 13 ms 10348 KB Output is correct
23 Correct 15 ms 10348 KB Output is correct
24 Correct 18 ms 11096 KB Output is correct
25 Correct 16 ms 11096 KB Output is correct
26 Correct 13 ms 11096 KB Output is correct
27 Correct 10 ms 11096 KB Output is correct
28 Correct 11 ms 11096 KB Output is correct
29 Correct 12 ms 11096 KB Output is correct
30 Correct 15 ms 11096 KB Output is correct
31 Correct 13 ms 11096 KB Output is correct
32 Correct 14 ms 11096 KB Output is correct
33 Correct 14 ms 11096 KB Output is correct
34 Correct 14 ms 11096 KB Output is correct
35 Correct 14 ms 11476 KB Output is correct
36 Correct 17 ms 12096 KB Output is correct
37 Correct 13 ms 12096 KB Output is correct
38 Correct 10 ms 12096 KB Output is correct
39 Correct 343 ms 12328 KB Output is correct
40 Correct 343 ms 13644 KB Output is correct
41 Correct 311 ms 14996 KB Output is correct
42 Correct 451 ms 16348 KB Output is correct
43 Correct 263 ms 18044 KB Output is correct
44 Correct 141 ms 19296 KB Output is correct
45 Correct 305 ms 24188 KB Output is correct
46 Correct 171 ms 29068 KB Output is correct
47 Correct 344 ms 30340 KB Output is correct
48 Correct 776 ms 47704 KB Output is correct
49 Correct 835 ms 49620 KB Output is correct
50 Correct 330 ms 49620 KB Output is correct
51 Correct 354 ms 49620 KB Output is correct
52 Correct 402 ms 49620 KB Output is correct
53 Correct 760 ms 49620 KB Output is correct
54 Correct 654 ms 50920 KB Output is correct
55 Correct 23 ms 50920 KB Output is correct
56 Correct 24 ms 50920 KB Output is correct
57 Correct 158 ms 50920 KB Output is correct
58 Correct 55 ms 50920 KB Output is correct
59 Correct 181 ms 58680 KB Output is correct
60 Correct 1177 ms 77360 KB Output is correct
61 Correct 340 ms 77360 KB Output is correct
62 Correct 421 ms 77360 KB Output is correct
63 Correct 541 ms 77360 KB Output is correct
64 Correct 1228 ms 77360 KB Output is correct
65 Correct 529 ms 77360 KB Output is correct
66 Correct 1060 ms 77736 KB Output is correct
67 Correct 217 ms 77736 KB Output is correct
68 Correct 614 ms 77736 KB Output is correct
69 Correct 542 ms 77736 KB Output is correct
70 Correct 556 ms 77736 KB Output is correct