제출 #1053198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053198		vincentbucourt1	경주 (Race) (IOI11_race)	C++14	0 / 100	3 ms	19544 KiB

race

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

const static int INF = 1e9;
const int MAXN = 200001;

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

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

void dfs (int node = 0, int parent = -1) {
	for (pair<int, int> nxt : adj[node]) {
		int 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]) {
			int sumOn = elem.f, depthOn = elem.s;

			int need = -sumOn + 2*sum[node] + sumNeed;
			if (maps[node].find(need) != maps[node].end()) {
				ans = min(ans, (int) (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], (ll) depthOn);
			}
		}
		maps[nodenxt].clear();
	}

	if (maps[node].find(sumNeed) != maps[node].end()) {
		ans = min(ans, (int) (maps[node][sumNeed] - depth[node]));
	}
}

int best_path(int N, int K, int H[][2], int L[])
{
	::N = N;
	sumNeed = K;
	for (int i = 0; i < N-1; i++) {
		adj[H[i][0]].push_back({H[i][1], L[i]});
		adj[H[i][1]].push_back({H[i][0], L[i]});
	}

	dfs();

	return ans;
}

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