답안 #70775 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
70775	2018-08-23T10:43:18 Z	MrTEK	경주 (Race) (IOI11_race)	C++14	100 / 100	857 ms	96140 KB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left isc+isc
#define right isc+isc+1
#define mid (l+r)/2
#define FAfi_IO ios_base::sync_with_fidio(false);
#define escl '\n'
#define bit __builtin_popcount

typedef long long int ll;

const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9;
const int N = 2e5 + 5;
const int M = 1e6 + 5;
const int SQ = 350;
const int MOD = 998244353;

typedef long long int lli;
typedef pair<int,int> pii;

vector <pii> ed[N],vec;
vector <int> v;
int n,k,ans = INF,sub[N],vis[N],mark[M];

int calc(int cur,int back = -1) {
	sub[cur] = 0;
	for (auto i : ed[cur])
		if (i.fi != back && vis[i.fi] == 0)
			sub[cur] += calc(i.fi,cur);
	return ++sub[cur];
}

int find(int cur,int back,int sz) {
	for (auto i : ed[cur])
		if (i.fi != back && vis[i.fi] == 0 && sub[i.fi] > sz / 2)
			return find(i.fi,cur,sz);
	return cur;
}

void dfs(int cur,int back,int sum,int step) {
	if (sum == k)
		ans = min(ans,step);
	if (sum < k) {
		ans = min(ans,mark[k - sum] + step);
		vec.pb(mp(sum,step));
	}
	for (auto i : ed[cur]) {
		if (vis[i.fi] == 0 && i.fi != back)
			dfs(i.fi,cur,sum + i.sc,step + 1);
	}
}


void solve(int cur = 1) {
	int cen = find(cur,-1,calc(cur));
	v.clear();
	for (auto i : ed[cen]) {
		if (vis[i.fi]) continue;
		vec.clear();
		dfs(i.fi,cen,i.sc,1);
		for (auto j : vec) {
			mark[j.fi] = min(mark[j.fi],j.sc);
			v.pb(j.fi);
		}
	}
	for (auto i : v)
		mark[i] = INF;
	vis[cen] = 1;
	for (auto i : ed[cen])
		if (vis[i.fi] == 0)
			solve(i.fi);
}


int best_path(int N, int K, int H[][2], int L[]) {
	n = N;
	k = K;
	for (int i = 0 ; i < n - 1 ; i++) {
		int u = H[i][0] + 1, v = H[i][1] + 1 , c = L[i];
		ed[u].pb(mp(v,c));
		ed[v].pb(mp(u,c));
	}
	for (int i = 0 ; i <= k ; i++) mark[i] = INF;	
	solve();
	if (ans >= INF) return -1;
	return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	8 ms	5220 KB	Output is correct
3	Correct	7 ms	5220 KB	Output is correct
4	Correct	7 ms	5224 KB	Output is correct
5	Correct	8 ms	5248 KB	Output is correct
6	Correct	7 ms	5296 KB	Output is correct
7	Correct	7 ms	5336 KB	Output is correct
8	Correct	7 ms	5336 KB	Output is correct
9	Correct	8 ms	5336 KB	Output is correct
10	Correct	7 ms	5336 KB	Output is correct
11	Correct	7 ms	5336 KB	Output is correct
12	Correct	8 ms	5336 KB	Output is correct
13	Correct	8 ms	5336 KB	Output is correct
14	Correct	8 ms	5336 KB	Output is correct
15	Correct	8 ms	5336 KB	Output is correct
16	Correct	7 ms	5336 KB	Output is correct
17	Correct	8 ms	5336 KB	Output is correct
18	Correct	8 ms	5336 KB	Output is correct
19	Correct	286 ms	11144 KB	Output is correct
20	Correct	291 ms	12444 KB	Output is correct
21	Correct	248 ms	14192 KB	Output is correct
22	Correct	245 ms	15940 KB	Output is correct
23	Correct	241 ms	16968 KB	Output is correct
24	Correct	126 ms	18104 KB	Output is correct
25	Correct	315 ms	22908 KB	Output is correct
26	Correct	159 ms	25852 KB	Output is correct
27	Correct	349 ms	29504 KB	Output is correct
28	Correct	771 ms	40752 KB	Output is correct
29	Correct	849 ms	43296 KB	Output is correct
30	Correct	289 ms	43296 KB	Output is correct
31	Correct	339 ms	43296 KB	Output is correct
32	Correct	379 ms	44608 KB	Output is correct
33	Correct	514 ms	46336 KB	Output is correct
34	Correct	551 ms	50284 KB	Output is correct

Subtask #4
57.0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	8 ms	5220 KB	Output is correct
3	Correct	7 ms	5220 KB	Output is correct
4	Correct	7 ms	5224 KB	Output is correct
5	Correct	8 ms	5248 KB	Output is correct
6	Correct	7 ms	5296 KB	Output is correct
7	Correct	7 ms	5336 KB	Output is correct
8	Correct	7 ms	5336 KB	Output is correct
9	Correct	8 ms	5336 KB	Output is correct
10	Correct	7 ms	5336 KB	Output is correct
11	Correct	7 ms	5336 KB	Output is correct
12	Correct	8 ms	5336 KB	Output is correct
13	Correct	8 ms	5336 KB	Output is correct
14	Correct	8 ms	5336 KB	Output is correct
15	Correct	8 ms	5336 KB	Output is correct
16	Correct	7 ms	5336 KB	Output is correct
17	Correct	8 ms	5336 KB	Output is correct
18	Correct	8 ms	5336 KB	Output is correct
19	Correct	7 ms	5336 KB	Output is correct
20	Correct	7 ms	5336 KB	Output is correct
21	Correct	9 ms	5484 KB	Output is correct
22	Correct	15 ms	8940 KB	Output is correct
23	Correct	11 ms	8940 KB	Output is correct
24	Correct	11 ms	8940 KB	Output is correct
25	Correct	11 ms	8940 KB	Output is correct
26	Correct	10 ms	8940 KB	Output is correct
27	Correct	11 ms	8940 KB	Output is correct
28	Correct	9 ms	8940 KB	Output is correct
29	Correct	8 ms	8940 KB	Output is correct
30	Correct	11 ms	8940 KB	Output is correct
31	Correct	11 ms	8940 KB	Output is correct
32	Correct	12 ms	8940 KB	Output is correct
33	Correct	13 ms	8940 KB	Output is correct
34	Correct	14 ms	8940 KB	Output is correct
35	Correct	13 ms	8940 KB	Output is correct
36	Correct	11 ms	8956 KB	Output is correct
37	Correct	12 ms	8956 KB	Output is correct
38	Correct	12 ms	8956 KB	Output is correct
39	Correct	286 ms	11144 KB	Output is correct
40	Correct	291 ms	12444 KB	Output is correct
41	Correct	248 ms	14192 KB	Output is correct
42	Correct	245 ms	15940 KB	Output is correct
43	Correct	241 ms	16968 KB	Output is correct
44	Correct	126 ms	18104 KB	Output is correct
45	Correct	315 ms	22908 KB	Output is correct
46	Correct	159 ms	25852 KB	Output is correct
47	Correct	349 ms	29504 KB	Output is correct
48	Correct	771 ms	40752 KB	Output is correct
49	Correct	849 ms	43296 KB	Output is correct
50	Correct	289 ms	43296 KB	Output is correct
51	Correct	339 ms	43296 KB	Output is correct
52	Correct	379 ms	44608 KB	Output is correct
53	Correct	514 ms	46336 KB	Output is correct
54	Correct	551 ms	50284 KB	Output is correct
55	Correct	18 ms	50284 KB	Output is correct
56	Correct	18 ms	50284 KB	Output is correct
57	Correct	122 ms	50284 KB	Output is correct
58	Correct	67 ms	50284 KB	Output is correct
59	Correct	128 ms	55216 KB	Output is correct
60	Correct	857 ms	71424 KB	Output is correct
61	Correct	317 ms	71424 KB	Output is correct
62	Correct	381 ms	71424 KB	Output is correct
63	Correct	368 ms	72064 KB	Output is correct
64	Correct	619 ms	74296 KB	Output is correct
65	Correct	523 ms	74720 KB	Output is correct
66	Correct	823 ms	88584 KB	Output is correct
67	Correct	193 ms	88584 KB	Output is correct
68	Correct	360 ms	89376 KB	Output is correct
69	Correct	456 ms	93144 KB	Output is correct
70	Correct	403 ms	96140 KB	Output is correct

답안 #70775

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 22.0 / 22.0

Subtask #4 57.0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
22.0 / 22.0

Subtask #4
57.0 / 57.0