Submission #1053379

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053379		vincentbucourt1	Race (IOI11_race)	C++14	43 / 100	179 ms	85820 KiB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second

const static ll INF = 1e18;
const static ll MAXN = 200001;

static ll N, sumNeed;
static vector<pair<ll, ll>> adj[MAXN];

static ll depth[MAXN], sum[MAXN];
static map<ll, ll> maps[MAXN];
static ll ans = INF;

void dfs (ll node = 0, ll parent = -1) {
	maps[node][sum[node]] = depth[node];
	for (pair<ll, ll> nxt : adj[node]) {
		ll nodenxt = nxt.f, weightnxt = nxt.s;
		if (nodenxt == parent) continue;

		depth[nodenxt] = depth[node] + 1;
		sum[nodenxt] = sum[node] + weightnxt;

		dfs(nodenxt, node);

		if (maps[nodenxt].size() > maps[node].size()) swap(maps[nodenxt], maps[node]);
		for (pair<ll, ll> elem : maps[nodenxt]) {
			ll sumOn = elem.f, depthOn = elem.s;

			ll need = -sumOn + 2*sum[node] + sumNeed;
			if (maps[node].find(need) != maps[node].end()) {
				ans = min(ans, maps[node][need] - 2*depth[node] + depthOn);
			}

			if (maps[node].find(sumOn) == maps[node].end()) {
				maps[node][sumOn] = depthOn;
			}
			else {
				maps[node][sumOn] = min(maps[node][sumOn], depthOn);
			}
		}
		maps[nodenxt].clear();
	}
}

int best_path(int N, int K, int H[][2], int L[])
{
	::N = (ll) N;
	sumNeed = (ll) K;

	if (sumNeed == 1) return 0;
	
	for (int i = 0; i < N-1; i++) {
		adj[H[i][0]].push_back({(ll) H[i][1], (ll) L[i]});
		adj[H[i][1]].push_back({(ll) H[i][0], (ll) L[i]});
	}

	dfs();

	if (ans == INF) return -1;
	else return (int) ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 0 / 57