제출 #1224121

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224121		colossal_pepe	Factories (JOI14_factories)	C++20	15 / 100	8082 ms	402484 KiB

factories

#include "factories.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll INF = 1e18;

int n;
vector<vector<pair<int, ll>>> t;
vector<int> ct_par;
vector<map<int, ll>> dist;

int decompose(int s, vector<int> &subt_n, vector<bool> &done) {
	auto dfs1 = [&done, &subt_n](const auto &self, int u, int par) -> void {
		subt_n[u] = 1;
		for (auto [v, d] : t[u]) {
			if (done[v] or v == par) continue;
			self(self, v, u);
			subt_n[u] += subt_n[v];
		}
	};
	dfs1(dfs1, s, -1);
	int cn = subt_n[s];

	auto dfs2 = [cn, &done, &subt_n](const auto &self, int u, int par) -> int {
		for (auto [v, d] : t[u]) {
			if (done[v] or v == par) continue;
			if (subt_n[v] * 2 > cn) return self(self, v, u);
		}
		return u;
	};
	int c = dfs2(dfs2, s, -1);

	done[c] = 1;
	dist[c][c] = 0;
	auto dfs3 = [c, &done](const auto &self, int u, int par) -> void {
		for (auto [v, d] : t[u]) {
			if (done[v] or v == par) continue;
			dist[c][v] = dist[c][u] + d;
			self(self, v, u);
		}
	};
	dfs3(dfs3, c, -1);

	for (auto [v, d] : t[c]) {
		if (done[v]) continue;
		int c_nxt = decompose(v, subt_n, done);
		ct_par[c_nxt] = c;
	}
	return c;
}

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	t.resize(n);
	for (int i = 0; i < n - 1; i++) {
		t[A[i]].push_back(make_pair(B[i], D[i]));
		t[B[i]].push_back(make_pair(A[i], D[i]));
	}
	ct_par.resize(n, -1);
	dist.resize(n);
	vector<int> subt_n(n, 0);
	vector<bool> done(n, 0);
	decompose(0, subt_n, done);
}

ll Query(int S, int X[], int T, int Y[]) {
	map<int, ll> min_dist;
	for (int i = 0; i < T; i++) {
		int u = Y[i];
		while (u != -1) {
			min_dist[u] = min((min_dist.find(u) == min_dist.end() ? INF : min_dist[u]), dist[u][Y[i]]);
			u = ct_par[u];
		}
	}
	ll ret = INF;
	for (int i = 0; i < S; i++) {
		int u = X[i];
		while (u != -1) {
			if (min_dist.find(u) != min_dist.end()) ret = min(ret, dist[u][X[i]] + min_dist[u]);
			u = ct_par[u];
		}
	}
	return ret;
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 18
• Subtask 3: 0 / 67