답안 #984663

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
984663	2024-05-17T01:01:55 Z	aaaaaarroz	경주 (Race) (IOI11_race)	C++17	100 / 100	414 ms	107808 KB

race

#include <bits/stdc++.h>


using namespace std;


typedef long long ll;

typedef pair<ll, ll> pii;


#define pb push_back


#define f first

#define s second


const int maxn = 2e5 + 1;

vector<pii> adj[maxn];

map<ll, ll> info[maxn];

ll dist[maxn], sum[maxn];  // define these relative to root

int N, K;

ll ret;


void precomp(int u, int p, ll c, int h) {

	info[u][c] = h;

	sum[u] = c;

	dist[u] = h;

	for (auto n : adj[u]) {

		if (p == n.f) { continue; }

		precomp(n.f, u, c + n.s, h + 1);

	}

}


void small_to_large_merge(int u, int p) {

	ll target = K + 2 * sum[u];

	for (auto n : adj[u]) {

		if (n.f == p) { continue; }

		small_to_large_merge(n.f, u);

		if (info[n.f].size() > info[u].size()) { swap(info[n.f], info[u]); }

		for (auto i : info[n.f]) {

			if (info[u].find(target - i.f) != info[u].end()) {

				ret = min(ret, info[u][target - i.f] + i.s - 2 * dist[u]);

			}

		}

		for (auto i : info[n.f]) {

			if (info[u].find(i.f) == info[u].end()) {

				info[u].insert(i);

			} else {

				info[u][i.f] = min(info[u][i.f], i.s);

			}

		}

	}

}


int best_path(int n, int k, int edges[][2], int weights[]) {

	if (k == 1) { return 0; }

	N = n;

	K = k;

	ret = INT_MAX;

	for (int i = 0; i < n - 1; i++) {

		int u = edges[i][0];

		int v = edges[i][1];

		adj[u].pb(pii(v, weights[i]));

		adj[v].pb(pii(u, weights[i]));

	}

	precomp(0, -1, 0, 0);

	small_to_large_merge(0, -1);

	return ret == INT_MAX ? -1 : ret;

}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	21084 KB	Output is correct
2	Correct	4 ms	21340 KB	Output is correct
3	Correct	5 ms	21084 KB	Output is correct
4	Correct	4 ms	21084 KB	Output is correct
5	Correct	4 ms	21084 KB	Output is correct
6	Correct	4 ms	21084 KB	Output is correct
7	Correct	5 ms	21084 KB	Output is correct
8	Correct	4 ms	21336 KB	Output is correct
9	Correct	4 ms	21340 KB	Output is correct
10	Correct	5 ms	21084 KB	Output is correct
11	Correct	4 ms	21084 KB	Output is correct
12	Correct	4 ms	21084 KB	Output is correct
13	Correct	4 ms	21084 KB	Output is correct
14	Correct	4 ms	21340 KB	Output is correct
15	Correct	5 ms	21084 KB	Output is correct
16	Correct	4 ms	21340 KB	Output is correct
17	Correct	4 ms	21340 KB	Output is correct
18	Correct	4 ms	21304 KB	Output is correct
19	Correct	4 ms	21080 KB	Output is correct
20	Correct	5 ms	21084 KB	Output is correct
21	Correct	6 ms	21340 KB	Output is correct
22	Correct	5 ms	21596 KB	Output is correct
23	Correct	5 ms	21608 KB	Output is correct
24	Correct	5 ms	21596 KB	Output is correct
25	Correct	5 ms	21596 KB	Output is correct
26	Correct	5 ms	21616 KB	Output is correct
27	Correct	5 ms	21340 KB	Output is correct
28	Correct	5 ms	21528 KB	Output is correct
29	Correct	5 ms	21528 KB	Output is correct
30	Correct	5 ms	21596 KB	Output is correct
31	Correct	5 ms	21596 KB	Output is correct
32	Correct	5 ms	21592 KB	Output is correct
33	Correct	6 ms	21592 KB	Output is correct
34	Correct	5 ms	21336 KB	Output is correct
35	Correct	5 ms	21340 KB	Output is correct
36	Correct	5 ms	21340 KB	Output is correct
37	Correct	5 ms	21340 KB	Output is correct
38	Correct	5 ms	21444 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	21084 KB	Output is correct
2	Correct	4 ms	21340 KB	Output is correct
3	Correct	5 ms	21084 KB	Output is correct
4	Correct	4 ms	21084 KB	Output is correct
5	Correct	4 ms	21084 KB	Output is correct
6	Correct	4 ms	21084 KB	Output is correct
7	Correct	5 ms	21084 KB	Output is correct
8	Correct	4 ms	21336 KB	Output is correct
9	Correct	4 ms	21340 KB	Output is correct
10	Correct	5 ms	21084 KB	Output is correct
11	Correct	4 ms	21084 KB	Output is correct
12	Correct	4 ms	21084 KB	Output is correct
13	Correct	4 ms	21084 KB	Output is correct
14	Correct	4 ms	21340 KB	Output is correct
15	Correct	5 ms	21084 KB	Output is correct
16	Correct	4 ms	21340 KB	Output is correct
17	Correct	4 ms	21340 KB	Output is correct
18	Correct	4 ms	21304 KB	Output is correct
19	Correct	109 ms	44068 KB	Output is correct
20	Correct	109 ms	44112 KB	Output is correct
21	Correct	105 ms	43856 KB	Output is correct
22	Correct	127 ms	43344 KB	Output is correct
23	Correct	143 ms	56144 KB	Output is correct
24	Correct	109 ms	46160 KB	Output is correct
25	Correct	96 ms	44824 KB	Output is correct
26	Correct	66 ms	53328 KB	Output is correct
27	Correct	178 ms	53328 KB	Output is correct
28	Correct	262 ms	95260 KB	Output is correct
29	Correct	263 ms	93664 KB	Output is correct
30	Correct	171 ms	53328 KB	Output is correct
31	Correct	172 ms	53332 KB	Output is correct
32	Correct	258 ms	53296 KB	Output is correct
33	Correct	242 ms	58192 KB	Output is correct
34	Correct	317 ms	90160 KB	Output is correct

Subtask #4
57.0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	21084 KB	Output is correct
2	Correct	4 ms	21340 KB	Output is correct
3	Correct	5 ms	21084 KB	Output is correct
4	Correct	4 ms	21084 KB	Output is correct
5	Correct	4 ms	21084 KB	Output is correct
6	Correct	4 ms	21084 KB	Output is correct
7	Correct	5 ms	21084 KB	Output is correct
8	Correct	4 ms	21336 KB	Output is correct
9	Correct	4 ms	21340 KB	Output is correct
10	Correct	5 ms	21084 KB	Output is correct
11	Correct	4 ms	21084 KB	Output is correct
12	Correct	4 ms	21084 KB	Output is correct
13	Correct	4 ms	21084 KB	Output is correct
14	Correct	4 ms	21340 KB	Output is correct
15	Correct	5 ms	21084 KB	Output is correct
16	Correct	4 ms	21340 KB	Output is correct
17	Correct	4 ms	21340 KB	Output is correct
18	Correct	4 ms	21304 KB	Output is correct
19	Correct	4 ms	21080 KB	Output is correct
20	Correct	5 ms	21084 KB	Output is correct
21	Correct	6 ms	21340 KB	Output is correct
22	Correct	5 ms	21596 KB	Output is correct
23	Correct	5 ms	21608 KB	Output is correct
24	Correct	5 ms	21596 KB	Output is correct
25	Correct	5 ms	21596 KB	Output is correct
26	Correct	5 ms	21616 KB	Output is correct
27	Correct	5 ms	21340 KB	Output is correct
28	Correct	5 ms	21528 KB	Output is correct
29	Correct	5 ms	21528 KB	Output is correct
30	Correct	5 ms	21596 KB	Output is correct
31	Correct	5 ms	21596 KB	Output is correct
32	Correct	5 ms	21592 KB	Output is correct
33	Correct	6 ms	21592 KB	Output is correct
34	Correct	5 ms	21336 KB	Output is correct
35	Correct	5 ms	21340 KB	Output is correct
36	Correct	5 ms	21340 KB	Output is correct
37	Correct	5 ms	21340 KB	Output is correct
38	Correct	5 ms	21444 KB	Output is correct
39	Correct	109 ms	44068 KB	Output is correct
40	Correct	109 ms	44112 KB	Output is correct
41	Correct	105 ms	43856 KB	Output is correct
42	Correct	127 ms	43344 KB	Output is correct
43	Correct	143 ms	56144 KB	Output is correct
44	Correct	109 ms	46160 KB	Output is correct
45	Correct	96 ms	44824 KB	Output is correct
46	Correct	66 ms	53328 KB	Output is correct
47	Correct	178 ms	53328 KB	Output is correct
48	Correct	262 ms	95260 KB	Output is correct
49	Correct	263 ms	93664 KB	Output is correct
50	Correct	171 ms	53328 KB	Output is correct
51	Correct	172 ms	53332 KB	Output is correct
52	Correct	258 ms	53296 KB	Output is correct
53	Correct	242 ms	58192 KB	Output is correct
54	Correct	317 ms	90160 KB	Output is correct
55	Correct	17 ms	24152 KB	Output is correct
56	Correct	10 ms	22872 KB	Output is correct
57	Correct	59 ms	41892 KB	Output is correct
58	Correct	48 ms	34484 KB	Output is correct
59	Correct	77 ms	59472 KB	Output is correct
60	Correct	246 ms	94288 KB	Output is correct
61	Correct	194 ms	56660 KB	Output is correct
62	Correct	183 ms	53332 KB	Output is correct
63	Correct	244 ms	53212 KB	Output is correct
64	Correct	414 ms	107808 KB	Output is correct
65	Correct	394 ms	105292 KB	Output is correct
66	Correct	272 ms	89432 KB	Output is correct
67	Correct	152 ms	45752 KB	Output is correct
68	Correct	311 ms	69200 KB	Output is correct
69	Correct	357 ms	73748 KB	Output is correct
70	Correct	311 ms	67020 KB	Output is correct

답안 #984663

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