Submission #28928

# Submission time Handle Problem Language Result Execution time Memory
28928 2017-07-17T23:57:14 Z h0ngjun7 Race (IOI11_race) C++14
43 / 100
3000 ms 69976 KB
#include "race.h"
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;

const int MAXN = 200005;
struct EDGE { int x, w; };
int N, K, ans = -1;
vector <EDGE> v[MAXN];

void f(int x, int par, unordered_map <int, int> &d) {
	d[0] = 0;
	for (auto &y : v[x]) {
		if (y.x == par) continue;
		unordered_map <int, int> d2, d3;
		f(y.x, x, d2);
		for (auto &t : d2) {
			if (t.first + y.w > K) continue;
			d3[t.first + y.w] = t.second + 1;
		}
		d2.clear();
		if (d.size() < d3.size()) d.swap(d3);
		for (auto &t : d3) {
			if (d.count(K - t.first)) {
				if (ans == -1 || ans > d[K - t.first] + t.second)
					ans = d[K - t.first] + t.second;
			}
		}
		for (auto &t : d3) {
			if (t.first == K) {
				if (ans == -1 || ans > t.second)
					ans = t.second;
			}
			if (d.count(t.first)) d[t.first] = min(d[t.first], t.second);
			else d[t.first] = t.second;
		}
	}
}

int best_path(int _N, int _K, int H[][2], int L[]) {
	N = _N, K = _K;
	for (int i = 0; i < N - 1; i++) {
		v[H[i][0]].push_back({ H[i][1], L[i] });
		v[H[i][1]].push_back({ H[i][0], L[i] });
	}
	unordered_map <int, int> d;
	f(0, -1, d);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5092 KB Output is correct
3 Correct 5 ms 5144 KB Output is correct
4 Correct 6 ms 5144 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 6 ms 5280 KB Output is correct
7 Correct 6 ms 5280 KB Output is correct
8 Correct 6 ms 5280 KB Output is correct
9 Correct 6 ms 5280 KB Output is correct
10 Correct 6 ms 5280 KB Output is correct
11 Correct 6 ms 5300 KB Output is correct
12 Correct 7 ms 5300 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 6 ms 5356 KB Output is correct
15 Correct 6 ms 5356 KB Output is correct
16 Correct 6 ms 5356 KB Output is correct
17 Correct 7 ms 5356 KB Output is correct
18 Correct 6 ms 5356 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5092 KB Output is correct
3 Correct 5 ms 5144 KB Output is correct
4 Correct 6 ms 5144 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 6 ms 5280 KB Output is correct
7 Correct 6 ms 5280 KB Output is correct
8 Correct 6 ms 5280 KB Output is correct
9 Correct 6 ms 5280 KB Output is correct
10 Correct 6 ms 5280 KB Output is correct
11 Correct 6 ms 5300 KB Output is correct
12 Correct 7 ms 5300 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 6 ms 5356 KB Output is correct
15 Correct 6 ms 5356 KB Output is correct
16 Correct 6 ms 5356 KB Output is correct
17 Correct 7 ms 5356 KB Output is correct
18 Correct 6 ms 5356 KB Output is correct
19 Correct 6 ms 5356 KB Output is correct
20 Correct 6 ms 5356 KB Output is correct
21 Correct 8 ms 5372 KB Output is correct
22 Correct 8 ms 5372 KB Output is correct
23 Correct 8 ms 5372 KB Output is correct
24 Correct 8 ms 5372 KB Output is correct
25 Correct 8 ms 5460 KB Output is correct
26 Correct 6 ms 5460 KB Output is correct
27 Correct 7 ms 5460 KB Output is correct
28 Correct 8 ms 5460 KB Output is correct
29 Correct 7 ms 5460 KB Output is correct
30 Correct 8 ms 5460 KB Output is correct
31 Correct 8 ms 5460 KB Output is correct
32 Correct 9 ms 5460 KB Output is correct
33 Correct 9 ms 5460 KB Output is correct
34 Correct 9 ms 5460 KB Output is correct
35 Correct 10 ms 5460 KB Output is correct
36 Correct 10 ms 5460 KB Output is correct
37 Correct 21 ms 5460 KB Output is correct
38 Correct 14 ms 5460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5092 KB Output is correct
3 Correct 5 ms 5144 KB Output is correct
4 Correct 6 ms 5144 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 6 ms 5280 KB Output is correct
7 Correct 6 ms 5280 KB Output is correct
8 Correct 6 ms 5280 KB Output is correct
9 Correct 6 ms 5280 KB Output is correct
10 Correct 6 ms 5280 KB Output is correct
11 Correct 6 ms 5300 KB Output is correct
12 Correct 7 ms 5300 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 6 ms 5356 KB Output is correct
15 Correct 6 ms 5356 KB Output is correct
16 Correct 6 ms 5356 KB Output is correct
17 Correct 7 ms 5356 KB Output is correct
18 Correct 6 ms 5356 KB Output is correct
19 Correct 214 ms 10236 KB Output is correct
20 Correct 210 ms 10236 KB Output is correct
21 Correct 195 ms 10236 KB Output is correct
22 Correct 181 ms 10236 KB Output is correct
23 Correct 145 ms 10420 KB Output is correct
24 Correct 134 ms 10420 KB Output is correct
25 Correct 1235 ms 24432 KB Output is correct
26 Correct 889 ms 37756 KB Output is correct
27 Correct 457 ms 37756 KB Output is correct
28 Correct 290 ms 69976 KB Output is correct
29 Correct 351 ms 69976 KB Output is correct
30 Correct 496 ms 69976 KB Output is correct
31 Correct 455 ms 69976 KB Output is correct
32 Correct 394 ms 69976 KB Output is correct
33 Correct 2220 ms 69976 KB Output is correct
34 Correct 194 ms 69976 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5092 KB Output is correct
3 Correct 5 ms 5144 KB Output is correct
4 Correct 6 ms 5144 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 6 ms 5280 KB Output is correct
7 Correct 6 ms 5280 KB Output is correct
8 Correct 6 ms 5280 KB Output is correct
9 Correct 6 ms 5280 KB Output is correct
10 Correct 6 ms 5280 KB Output is correct
11 Correct 6 ms 5300 KB Output is correct
12 Correct 7 ms 5300 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 6 ms 5356 KB Output is correct
15 Correct 6 ms 5356 KB Output is correct
16 Correct 6 ms 5356 KB Output is correct
17 Correct 7 ms 5356 KB Output is correct
18 Correct 6 ms 5356 KB Output is correct
19 Correct 6 ms 5356 KB Output is correct
20 Correct 6 ms 5356 KB Output is correct
21 Correct 8 ms 5372 KB Output is correct
22 Correct 8 ms 5372 KB Output is correct
23 Correct 8 ms 5372 KB Output is correct
24 Correct 8 ms 5372 KB Output is correct
25 Correct 8 ms 5460 KB Output is correct
26 Correct 6 ms 5460 KB Output is correct
27 Correct 7 ms 5460 KB Output is correct
28 Correct 8 ms 5460 KB Output is correct
29 Correct 7 ms 5460 KB Output is correct
30 Correct 8 ms 5460 KB Output is correct
31 Correct 8 ms 5460 KB Output is correct
32 Correct 9 ms 5460 KB Output is correct
33 Correct 9 ms 5460 KB Output is correct
34 Correct 9 ms 5460 KB Output is correct
35 Correct 10 ms 5460 KB Output is correct
36 Correct 10 ms 5460 KB Output is correct
37 Correct 21 ms 5460 KB Output is correct
38 Correct 14 ms 5460 KB Output is correct
39 Correct 214 ms 10236 KB Output is correct
40 Correct 210 ms 10236 KB Output is correct
41 Correct 195 ms 10236 KB Output is correct
42 Correct 181 ms 10236 KB Output is correct
43 Correct 145 ms 10420 KB Output is correct
44 Correct 134 ms 10420 KB Output is correct
45 Correct 1235 ms 24432 KB Output is correct
46 Correct 889 ms 37756 KB Output is correct
47 Correct 457 ms 37756 KB Output is correct
48 Correct 290 ms 69976 KB Output is correct
49 Correct 351 ms 69976 KB Output is correct
50 Correct 496 ms 69976 KB Output is correct
51 Correct 455 ms 69976 KB Output is correct
52 Correct 394 ms 69976 KB Output is correct
53 Correct 2220 ms 69976 KB Output is correct
54 Correct 194 ms 69976 KB Output is correct
55 Correct 29 ms 69976 KB Output is correct
56 Correct 20 ms 69976 KB Output is correct
57 Correct 129 ms 69976 KB Output is correct
58 Correct 79 ms 69976 KB Output is correct
59 Execution timed out 3057 ms 69976 KB Time limit exceeded
60 Halted 0 ms 0 KB -