oj.uz

답안 #108725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108725 2019-05-01T07:45:23 Z turbat 경주 (Race) (IOI11_race) C++14
100 / 100
 1976 ms 38992 KB 
#include <bits/stdc++.h>
#include "race.h"
using namespace std;
using vi = vector <int>;
using pii = pair <int, int>;
#define pb push_back
#define F first
#define S second
#define N 200005
int n, k, ans = N, sz[N], mx[N], centroid;
map <int, int> dist;
bool used[N];
vector <pii> edg[N];
void get_size(int u, int p){
	sz[u] = 1;
	mx[u] = 0;
	for (pii v : edg[u])
		if (v.F != p && !used[v.F]){
			get_size(v.F, u);
			mx[u] = max(mx[u], sz[v.F]);
			sz[u] += sz[v.F];
		}
	mx[u] = max(mx[u], n - sz[u]);
}
void get_centroid(int u, int p){
	for (pii v : edg[u])
		if (v.F != p && !used[v.F])
			get_centroid(v.F, u);
	if (mx[u] <= (n + 1) / 2) centroid = u;
}
void calc(int u, int p, int lenght, int distance){
	if(distance > k) return;
	for (pii v : edg[u])
		if (v.F != p && !used[v.F])
			calc(v.F, u, lenght + 1, distance + v.S);
	if (dist.count(k - distance))
		ans = min (ans, lenght + dist[k - distance]);
}

void add(int u, int p, int lenght, int distance){
	if(distance > k) return;
	for (pii v : edg[u])
		if (v.F != p && !used[v.F])
			add(v.F, u, lenght + 1, distance + v.S);
	if (!dist.count(distance)) dist[distance] = lenght;
	else dist[distance] = min(dist[distance], lenght); 
}

void solve(int u){
	dist.clear();
	dist[0] = 0;
	get_size(u, -1);
	get_centroid(u, -1);
	used[centroid] = 1;
	get_size(centroid, -1);
	for (pii v : edg[centroid])
		if (!used[v.F]){
			calc(v.F, centroid, 1, v.S);
			add(v.F, centroid, 1, v.S);
		}
	for (pii v : edg[centroid])
		if (!used[v.F]){
			n = sz[v.F];
			solve(v.F);
		}
}
int best_path(int s, int K, int H[][2], int L[]){
	n = s;
	k = K;
	for (int i = 0;i < n - 1;i++){
		edg[H[i][0]].pb({H[i][1], L[i]});
		edg[H[i][1]].pb({H[i][0], L[i]});		
	}
	solve(0);
	return ans == N ? -1 : ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 9 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 11 ms 4992 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 7 ms 5092 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct
15 Correct 7 ms 4992 KB Output is correct
16 Correct 8 ms 4992 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5120 KB Output is correct
19 Correct 432 ms 12152 KB Output is correct
20 Correct 446 ms 12280 KB Output is correct
21 Correct 420 ms 12152 KB Output is correct
22 Correct 378 ms 12284 KB Output is correct
23 Correct 260 ms 12536 KB Output is correct
24 Correct 162 ms 12508 KB Output is correct
25 Correct 403 ms 14812 KB Output is correct
26 Correct 175 ms 17788 KB Output is correct
27 Correct 366 ms 19704 KB Output is correct
28 Correct 930 ms 31296 KB Output is correct
29 Correct 974 ms 30324 KB Output is correct
30 Correct 413 ms 19724 KB Output is correct
31 Correct 366 ms 19772 KB Output is correct
32 Correct 501 ms 19832 KB Output is correct
33 Correct 933 ms 18552 KB Output is correct
34 Correct 754 ms 19384 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 9 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 11 ms 4992 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 7 ms 5092 KB Output is correct
12 Correct 7 ms 5120 KB Output is correct
13 Correct 8 ms 5120 KB Output is correct
14 Correct 8 ms 5120 KB Output is correct
15 Correct 7 ms 4992 KB Output is correct
16 Correct 8 ms 4992 KB Output is correct
17 Correct 8 ms 5120 KB Output is correct
18 Correct 8 ms 5120 KB Output is correct
19 Correct 8 ms 5120 KB Output is correct
20 Correct 7 ms 4992 KB Output is correct
21 Correct 10 ms 5120 KB Output is correct
22 Correct 9 ms 5120 KB Output is correct
23 Correct 8 ms 5120 KB Output is correct
24 Correct 10 ms 5248 KB Output is correct
25 Correct 10 ms 5120 KB Output is correct
26 Correct 9 ms 5248 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 9 ms 5120 KB Output is correct
29 Correct 9 ms 5120 KB Output is correct
30 Correct 10 ms 5120 KB Output is correct
31 Correct 9 ms 5248 KB Output is correct
32 Correct 9 ms 5248 KB Output is correct
33 Correct 11 ms 5128 KB Output is correct
34 Correct 10 ms 5120 KB Output is correct
35 Correct 10 ms 5120 KB Output is correct
36 Correct 11 ms 5120 KB Output is correct
37 Correct 9 ms 5120 KB Output is correct
38 Correct 9 ms 5120 KB Output is correct
39 Correct 432 ms 12152 KB Output is correct
40 Correct 446 ms 12280 KB Output is correct
41 Correct 420 ms 12152 KB Output is correct
42 Correct 378 ms 12284 KB Output is correct
43 Correct 260 ms 12536 KB Output is correct
44 Correct 162 ms 12508 KB Output is correct
45 Correct 403 ms 14812 KB Output is correct
46 Correct 175 ms 17788 KB Output is correct
47 Correct 366 ms 19704 KB Output is correct
48 Correct 930 ms 31296 KB Output is correct
49 Correct 974 ms 30324 KB Output is correct
50 Correct 413 ms 19724 KB Output is correct
51 Correct 366 ms 19772 KB Output is correct
52 Correct 501 ms 19832 KB Output is correct
53 Correct 933 ms 18552 KB Output is correct
54 Correct 754 ms 19384 KB Output is correct
55 Correct 34 ms 5956 KB Output is correct
56 Correct 30 ms 5760 KB Output is correct
57 Correct 213 ms 12456 KB Output is correct
58 Correct 76 ms 12136 KB Output is correct
59 Correct 392 ms 21708 KB Output is correct
60 Correct 1818 ms 38992 KB Output is correct
61 Correct 480 ms 20092 KB Output is correct
62 Correct 471 ms 19960 KB Output is correct
63 Correct 683 ms 19960 KB Output is correct
64 Correct 1976 ms 24604 KB Output is correct
65 Correct 682 ms 20600 KB Output is correct
66 Correct 1438 ms 28408 KB Output is correct
67 Correct 220 ms 20520 KB Output is correct
68 Correct 710 ms 24076 KB Output is correct
69 Correct 919 ms 24132 KB Output is correct
70 Correct 857 ms 23256 KB Output is correct