# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
97860 |
2019-02-19T03:34:14 Z |
kitsu_hi |
Race (IOI11_race) |
C++14 |
|
3000 ms |
39612 KB |
#include "race.h"
#include<bits/stdc++.h>
using namespace std;
vector< vector< pair<int, int> > > edges;
int size_of_subtree[200005], blocked[200005];
unordered_map <int, int> big, small;
int answer = INT_MAX;
void get_size_of_subtree(int current_node, int parent) {
size_of_subtree[current_node] = 1;
for (auto child : edges[current_node]) {
if (child.first != parent) {
get_size_of_subtree(child.first, current_node);
size_of_subtree[current_node] += size_of_subtree[child.first];
}
}
}
int get_centroid(int current_node) {
for (auto child : edges[current_node]) {
if (blocked[child.first] == 0 && size_of_subtree[child.first] > size_of_subtree[current_node] / 2) {
int total_size = size_of_subtree[current_node];
size_of_subtree[current_node] -= size_of_subtree[child.first];
size_of_subtree[child.first] = total_size;
return get_centroid(child.first);
}
}
return current_node;
}
void dfs(int current_node, int parent, int sum, int depth) {
if (small.find(sum) == small.end()) small[sum] = depth;
else small[sum] = min(small[sum], depth);
for (auto child : edges[current_node]) {
if (blocked[child.first] == 0 && child.first != parent) {
dfs(child.first, current_node, sum + child.second, depth + 1);
}
}
}
void solve(int current_node, int sum) {
big.clear();
current_node = get_centroid(current_node);
blocked[current_node] = 1;
big[0] = 0;
for (auto child : edges[current_node]) {
small.clear();
if (blocked[child.first] == 1) continue;
dfs(child.first, current_node, child.second, 1);
for (auto value : small) {
if (big.find(sum - value.first) != big.end()) answer = min(answer, big[sum - value.first] + small[value.first]);
}
for (auto value : small) {
if (big.find(value.first) == big.end()) big[value.first] = small[value.first];
else big[value.first] = min(big[value.first], small[value.first]);
}
}
for (auto child : edges[current_node]) {
if (blocked[child.first] == 0) solve(child.first, sum);
}
}
int best_path(int N, int K, int H[][2], int L[])
{
edges.resize(N+1);
for (int i = 0; i < N - 1; i++) {
edges[H[i][0]].push_back(make_pair(H[i][1], L[i]));
edges[H[i][1]].push_back(make_pair(H[i][0], L[i]));
}
get_size_of_subtree(0, -1);
solve(0, K);
if (answer == INT_MAX) answer = -1;
return answer;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
384 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
2 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
384 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
2 ms |
384 KB |
Output is correct |
20 |
Correct |
2 ms |
384 KB |
Output is correct |
21 |
Correct |
4 ms |
512 KB |
Output is correct |
22 |
Correct |
4 ms |
512 KB |
Output is correct |
23 |
Correct |
5 ms |
512 KB |
Output is correct |
24 |
Correct |
4 ms |
512 KB |
Output is correct |
25 |
Correct |
4 ms |
512 KB |
Output is correct |
26 |
Correct |
5 ms |
512 KB |
Output is correct |
27 |
Correct |
4 ms |
384 KB |
Output is correct |
28 |
Correct |
4 ms |
512 KB |
Output is correct |
29 |
Correct |
5 ms |
512 KB |
Output is correct |
30 |
Correct |
6 ms |
512 KB |
Output is correct |
31 |
Correct |
6 ms |
512 KB |
Output is correct |
32 |
Correct |
5 ms |
640 KB |
Output is correct |
33 |
Correct |
5 ms |
512 KB |
Output is correct |
34 |
Correct |
6 ms |
512 KB |
Output is correct |
35 |
Correct |
5 ms |
512 KB |
Output is correct |
36 |
Correct |
6 ms |
512 KB |
Output is correct |
37 |
Correct |
4 ms |
384 KB |
Output is correct |
38 |
Correct |
5 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
384 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
427 ms |
8288 KB |
Output is correct |
20 |
Correct |
368 ms |
8468 KB |
Output is correct |
21 |
Correct |
363 ms |
8312 KB |
Output is correct |
22 |
Correct |
329 ms |
8568 KB |
Output is correct |
23 |
Correct |
497 ms |
8568 KB |
Output is correct |
24 |
Correct |
195 ms |
8440 KB |
Output is correct |
25 |
Correct |
1024 ms |
11512 KB |
Output is correct |
26 |
Correct |
200 ms |
14072 KB |
Output is correct |
27 |
Correct |
957 ms |
16892 KB |
Output is correct |
28 |
Execution timed out |
3039 ms |
39612 KB |
Time limit exceeded |
29 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
384 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
384 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
2 ms |
384 KB |
Output is correct |
19 |
Correct |
2 ms |
384 KB |
Output is correct |
20 |
Correct |
2 ms |
384 KB |
Output is correct |
21 |
Correct |
4 ms |
512 KB |
Output is correct |
22 |
Correct |
4 ms |
512 KB |
Output is correct |
23 |
Correct |
5 ms |
512 KB |
Output is correct |
24 |
Correct |
4 ms |
512 KB |
Output is correct |
25 |
Correct |
4 ms |
512 KB |
Output is correct |
26 |
Correct |
5 ms |
512 KB |
Output is correct |
27 |
Correct |
4 ms |
384 KB |
Output is correct |
28 |
Correct |
4 ms |
512 KB |
Output is correct |
29 |
Correct |
5 ms |
512 KB |
Output is correct |
30 |
Correct |
6 ms |
512 KB |
Output is correct |
31 |
Correct |
6 ms |
512 KB |
Output is correct |
32 |
Correct |
5 ms |
640 KB |
Output is correct |
33 |
Correct |
5 ms |
512 KB |
Output is correct |
34 |
Correct |
6 ms |
512 KB |
Output is correct |
35 |
Correct |
5 ms |
512 KB |
Output is correct |
36 |
Correct |
6 ms |
512 KB |
Output is correct |
37 |
Correct |
4 ms |
384 KB |
Output is correct |
38 |
Correct |
5 ms |
512 KB |
Output is correct |
39 |
Correct |
427 ms |
8288 KB |
Output is correct |
40 |
Correct |
368 ms |
8468 KB |
Output is correct |
41 |
Correct |
363 ms |
8312 KB |
Output is correct |
42 |
Correct |
329 ms |
8568 KB |
Output is correct |
43 |
Correct |
497 ms |
8568 KB |
Output is correct |
44 |
Correct |
195 ms |
8440 KB |
Output is correct |
45 |
Correct |
1024 ms |
11512 KB |
Output is correct |
46 |
Correct |
200 ms |
14072 KB |
Output is correct |
47 |
Correct |
957 ms |
16892 KB |
Output is correct |
48 |
Execution timed out |
3039 ms |
39612 KB |
Time limit exceeded |
49 |
Halted |
0 ms |
0 KB |
- |