답안 #109603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109603	2019-05-07T07:41:03 Z	Erkhemkhuu	경주 (Race) (IOI11_race)	C++17	21 / 100	3000 ms	13512 KB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
vector <pair <int, int> > adj[200005];
map <int, int> global_path, local_path;
bool isCentroid[200005] = {false};
int subtr_size[200005], localCentroid, k, ans;
void SubTreeSize(int v, int p) {
	subtr_size[v] = 1;
	for(auto &it: adj[v])
		if(it.F != p && !isCentroid[it.F]) {
			SubTreeSize(it.F, v);
			subtr_size[v] += subtr_size[it.F];
		}
	return;
}
void traverse(int v, int p, int w, int l) {
	if(w > k) return;
	if(w == k) ans = min(ans, l);
	int temp = global_path[k - w];
	if(temp) ans = min(ans, l + temp);
	if(!local_path[w] || local_path[w] > l) local_path[w] = l;
	for(auto &it: adj[v])
		if(it.F != p && !isCentroid[it.F])
			traverse(it.F, v, w + it.S, l + 1);
	return;
}
int findCentroid(int v, int p, int size) {
	for(auto &it: adj[v])
		if(it.F != p && !isCentroid[it.F])
			if(subtr_size[it.F] > size)
				findCentroid(it.F, v, size);
	return v;
}
void go(int v) {
	SubTreeSize(v, -1);
	localCentroid = findCentroid(v, -1, subtr_size[v]);
	global_path.clear();
	isCentroid[localCentroid] = true;
	for(auto &it: adj[localCentroid])
		if(!isCentroid[it.F]) {
        	local_path.clear();
        	traverse(it.F, localCentroid, it.S, 1);
        	for(auto &localit: local_path)
        		if(!global_path[localit.F] || global_path[localit.F] > localit.S)
        			global_path[localit.F] = localit.S;
        }
	for(auto &it: adj[localCentroid])
		if(!isCentroid[it.F])
			go(it.F);
	return;
}
int best_path(int N, int K, int H[][2], int L[]) {
	int i;
	k = K;
	for(i = 0; i < N - 1; i++) {
		adj[H[i][0]].pb(mp(H[i][1], L[i]));
		adj[H[i][1]].pb(mp(H[i][0], L[i]));
	}
	ans = 1e9;
	go(0);
	if(ans == 1e9) ans = -1;
	return ans;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	4992 KB	Output is correct
2	Correct	8 ms	4992 KB	Output is correct
3	Correct	6 ms	4992 KB	Output is correct
4	Correct	7 ms	4992 KB	Output is correct
5	Correct	7 ms	4992 KB	Output is correct
6	Correct	9 ms	5120 KB	Output is correct
7	Correct	6 ms	4992 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	7 ms	4992 KB	Output is correct
10	Correct	8 ms	4992 KB	Output is correct
11	Correct	6 ms	4992 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	7 ms	5096 KB	Output is correct
14	Correct	9 ms	4992 KB	Output is correct
15	Correct	9 ms	4992 KB	Output is correct
16	Correct	7 ms	4992 KB	Output is correct
17	Correct	9 ms	4992 KB	Output is correct
18	Correct	8 ms	4992 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	4992 KB	Output is correct
2	Correct	8 ms	4992 KB	Output is correct
3	Correct	6 ms	4992 KB	Output is correct
4	Correct	7 ms	4992 KB	Output is correct
5	Correct	7 ms	4992 KB	Output is correct
6	Correct	9 ms	5120 KB	Output is correct
7	Correct	6 ms	4992 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	7 ms	4992 KB	Output is correct
10	Correct	8 ms	4992 KB	Output is correct
11	Correct	6 ms	4992 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	7 ms	5096 KB	Output is correct
14	Correct	9 ms	4992 KB	Output is correct
15	Correct	9 ms	4992 KB	Output is correct
16	Correct	7 ms	4992 KB	Output is correct
17	Correct	9 ms	4992 KB	Output is correct
18	Correct	8 ms	4992 KB	Output is correct
19	Correct	7 ms	5120 KB	Output is correct
20	Correct	8 ms	4992 KB	Output is correct
21	Correct	12 ms	5120 KB	Output is correct
22	Correct	7 ms	5120 KB	Output is correct
23	Correct	9 ms	5120 KB	Output is correct
24	Correct	9 ms	5120 KB	Output is correct
25	Correct	11 ms	5248 KB	Output is correct
26	Correct	7 ms	5120 KB	Output is correct
27	Correct	7 ms	5120 KB	Output is correct
28	Correct	13 ms	5120 KB	Output is correct
29	Correct	10 ms	5120 KB	Output is correct
30	Correct	13 ms	5240 KB	Output is correct
31	Correct	14 ms	5248 KB	Output is correct
32	Correct	16 ms	5248 KB	Output is correct
33	Correct	17 ms	5196 KB	Output is correct
34	Correct	17 ms	5120 KB	Output is correct
35	Correct	25 ms	5144 KB	Output is correct
36	Correct	18 ms	5120 KB	Output is correct
37	Correct	57 ms	5240 KB	Output is correct
38	Correct	39 ms	5120 KB	Output is correct

Subtask #3
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	4992 KB	Output is correct
2	Correct	8 ms	4992 KB	Output is correct
3	Correct	6 ms	4992 KB	Output is correct
4	Correct	7 ms	4992 KB	Output is correct
5	Correct	7 ms	4992 KB	Output is correct
6	Correct	9 ms	5120 KB	Output is correct
7	Correct	6 ms	4992 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	7 ms	4992 KB	Output is correct
10	Correct	8 ms	4992 KB	Output is correct
11	Correct	6 ms	4992 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	7 ms	5096 KB	Output is correct
14	Correct	9 ms	4992 KB	Output is correct
15	Correct	9 ms	4992 KB	Output is correct
16	Correct	7 ms	4992 KB	Output is correct
17	Correct	9 ms	4992 KB	Output is correct
18	Correct	8 ms	4992 KB	Output is correct
19	Correct	805 ms	11648 KB	Output is correct
20	Correct	709 ms	11432 KB	Output is correct
21	Correct	714 ms	11548 KB	Output is correct
22	Correct	574 ms	11664 KB	Output is correct
23	Correct	280 ms	11788 KB	Output is correct
24	Correct	190 ms	11684 KB	Output is correct
25	Execution timed out	3009 ms	13512 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

Subtask #4
0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	4992 KB	Output is correct
2	Correct	8 ms	4992 KB	Output is correct
3	Correct	6 ms	4992 KB	Output is correct
4	Correct	7 ms	4992 KB	Output is correct
5	Correct	7 ms	4992 KB	Output is correct
6	Correct	9 ms	5120 KB	Output is correct
7	Correct	6 ms	4992 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	7 ms	4992 KB	Output is correct
10	Correct	8 ms	4992 KB	Output is correct
11	Correct	6 ms	4992 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	7 ms	5096 KB	Output is correct
14	Correct	9 ms	4992 KB	Output is correct
15	Correct	9 ms	4992 KB	Output is correct
16	Correct	7 ms	4992 KB	Output is correct
17	Correct	9 ms	4992 KB	Output is correct
18	Correct	8 ms	4992 KB	Output is correct
19	Correct	7 ms	5120 KB	Output is correct
20	Correct	8 ms	4992 KB	Output is correct
21	Correct	12 ms	5120 KB	Output is correct
22	Correct	7 ms	5120 KB	Output is correct
23	Correct	9 ms	5120 KB	Output is correct
24	Correct	9 ms	5120 KB	Output is correct
25	Correct	11 ms	5248 KB	Output is correct
26	Correct	7 ms	5120 KB	Output is correct
27	Correct	7 ms	5120 KB	Output is correct
28	Correct	13 ms	5120 KB	Output is correct
29	Correct	10 ms	5120 KB	Output is correct
30	Correct	13 ms	5240 KB	Output is correct
31	Correct	14 ms	5248 KB	Output is correct
32	Correct	16 ms	5248 KB	Output is correct
33	Correct	17 ms	5196 KB	Output is correct
34	Correct	17 ms	5120 KB	Output is correct
35	Correct	25 ms	5144 KB	Output is correct
36	Correct	18 ms	5120 KB	Output is correct
37	Correct	57 ms	5240 KB	Output is correct
38	Correct	39 ms	5120 KB	Output is correct
39	Correct	805 ms	11648 KB	Output is correct
40	Correct	709 ms	11432 KB	Output is correct
41	Correct	714 ms	11548 KB	Output is correct
42	Correct	574 ms	11664 KB	Output is correct
43	Correct	280 ms	11788 KB	Output is correct
44	Correct	190 ms	11684 KB	Output is correct
45	Execution timed out	3009 ms	13512 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

답안 #109603

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 22.0

Subtask #4 0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 22.0

Subtask #4
0 / 57.0