제출 #942416

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

race

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

int n, k;
ll ans = INF;
vector<pair<int, int>>adj[200005];
bool visited[200005];
ll dp[200005], cnt[1000005];
vector<ll>v;

int get_size(int s, int e) {
	dp[s] = 1;
	for (auto u : adj[s]) {
		if (u.first == e || visited[u.first]) continue;
		get_size(u.first, s);
		dp[s] += dp[u.first];
	}
	return dp[s];
}

int get_centroid(int s, int e, int n) {
	for (auto u : adj[s]) {
		if (u.first == e || visited[u.first]) continue;
		if (dp[u.first] * 2 > n)return get_centroid(u.first, s, n);
	}
	return s;
}

void dfs(int s, int e, bool flag, int sum, ll dep = 2) {
	if (sum > k) return;
	if (!flag) {
		ans = min(ans, dep + cnt[k - sum]);
	}
	else {
		cnt[sum] = min(cnt[sum], dep);
		v.push_back(sum);
	}
	for (auto u : adj[s]) {
		if (u.first == e || visited[u.first]) continue;
		dfs(u.first, s, flag, sum + u.second, dep + 1);
	}
}

void centroid_decomposition(int node) {
	int centroid = get_centroid(node, 0, get_size(node, 0));
	visited[centroid] = true;
	for (auto u : adj[centroid]) {
		if (!visited[u.first]) {
			if (u.second <= k)ans = min(ans, 1 + cnt[k - u.second]);
			dfs(u.first, centroid, false, u.second);
			cnt[u.second] = min(cnt[u.second], 1 * 1ll);
			v.push_back(u.second);
			dfs(u.first, centroid, true, u.second);
		}
	}
	for (auto u : v) cnt[u] = INF;
	v.clear();
	for (auto u : adj[centroid]) {
		if (!visited[u.first])centroid_decomposition(u.first);
	}
}

int best_path(int N, int K, int H[][2], int L[]) {
	n = N; k = K;
	for (int i = 1; i <= 1000000; i++) cnt[i] = INF;
	for (int i = 1; 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] });
	}
	centroid_decomposition(1);
	if (ans == INF) return -1;
	return ans;
}

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