oj.uz

답안 #379682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379682 2021-03-19T02:50:58 Z mode149256 공장들 (JOI14_factories) C++17
100 / 100
 7999 ms 276060 KB 
/*input

*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#include "factories.h"
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = 1e14;
const int MX = 500101;
const int L = 19;

int n;
vector<vector<pair<int, ll>>> edges;
vi dep;
vl toRoot;
vii p;
vll w;
vi in;
vi out;
int piv;

void dfs(int x, int par) {
	in[x] = piv++;
	for (auto u : edges[x]) {
		if (u.x == par) continue;

		int b = u.x;
		dep[b] = dep[x] + 1;
		toRoot[b] = toRoot[x] + u.y;
		p[b][0] = x;
		w[b][0] = u.y;
		for (int i = 1; i < L; ++i)
		{
			p[b][i] = p[p[b][i - 1]][i - 1];
			w[b][i] = w[b][i - 1] + w[p[b][i - 1]][i - 1];
		}
		dfs(u.x, x);
	}
	out[x] = piv;
}

// a is ancestor of b
int anc(int a, int b) {
	return in[a] < in[b] and out[b] <= out[a];
}

int lca(int a, int b) {
	if (dep[a] > dep[b]) swap(a, b);

	// a
	// b
	for (int i = L - 1; i >= 0; --i)
	{
		if (dep[b] - (1 << i) >= dep[a])
			b = p[b][i];
	}
	if (a == b) return a;

	for (int i = L - 1; i >= 0; i--)
	{
		if (p[a][i] != p[b][i]) {
			a = p[a][i];
			b = p[b][i];
		}
	}
	return p[a][0];
}

ll dis(int a, int b) {
	int l = lca(a, b);
	return toRoot[a] + toRoot[b] - 2 * toRoot[l];
}

void make_lca() {
	dep = vi(n);
	p = vii(n, vi(L, 0));
	w = vll(n, vl(L, 0));
	toRoot = vl(n);
	in = vi(n);
	out = vi(n);

	dep[0] = 0;
	p[0][0] = 0;
	w[0][0] = 0;
	toRoot[0] = 0;
	piv = 0;

	dfs(0, -1);
}
vi kas;
vll low;

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	edges.resize(N);
	kas = vi(N, -1);
	for (int i = 0; i < N - 1; ++i)
	{
		int a = A[i];
		int b = B[i];
		int d = D[i];
		edges[a].emplace_back(b, d);
		edges[b].emplace_back(a, d);
	}

	make_lca();
	low = vll(n, vl{INF, INF});
}

ll Query(int S, int X[], int T, int Y[]) {
	vi visi;
	for (int i = 0; i < S; ++i) {
		visi.emplace_back(X[i]);
		kas[X[i]] = 1;
	}
	for (int i = 0; i < T; ++i) {
		visi.emplace_back(Y[i]);
		kas[Y[i]] = 2;
	}

	sort(visi.begin(), visi.end(), [&](const int & a, const int & b) {
		return in[a] < in[b];
	});

	for (int i = 1; i < S + T; ++i)
	{
		if (anc(visi[i - 1], visi[i]) or anc(visi[i], visi[i - 1])) continue;

		int l = lca(visi[i - 1], visi[i]);
		if (kas[l] == -1) {
			visi.emplace_back(l);
			kas[l] = 0;
		}
	}

	sort(visi.begin(), visi.end(), [&](const int & a, const int & b) {
		return in[a] < in[b];
	});

	// visi.erase(unique(visi.begin(), visi.end()), visi.end());

	// print(visi);
	ll ats = INF;

	stack<int> ver;

	ver.push(visi[0]);
	if (kas[visi[0]]) low[visi[0]][kas[visi[0]] - 1] = 0;

	for (int i = 1; i < (int)visi.size(); ++i)
	{
		while (!anc(ver.top(), visi[i])) {
			int a = ver.top(); ver.pop();
			int b = ver.top();

			ll d = dis(a, b);
			if (kas[a] + kas[b] == 3)
				ats = min(ats, d);

			//   b
			//  /  c
			// a

			low[b][0] = min(low[b][0], low[a][0] + d);
			low[b][1] = min(low[b][1], low[a][1] + d);
		}
		ver.push(visi[i]);
		if (kas[visi[i]]) low[visi[i]][kas[visi[i]] - 1] = 0;
	}

	while (ver.size() >= 2) {
		int a = ver.top(); ver.pop();
		int b = ver.top();
		ll d = dis(a, b);
		// printf("a = %d, b = %d, d = %lld\n", a, b, d);
		if (kas[a] + kas[b] == 3)
			ats = min(ats, d);

		//   b
		//  /  c
		// a

		low[b][0] = min(low[b][0], low[a][0] + d);
		low[b][1] = min(low[b][1], low[a][1] + d);
	}

	for (auto u : visi) {
		// printf("u = %d, low = %lld %lld\n", u, low[u][0], low[u][1]);
		ats = min(ats, low[u][0] + low[u][1]);
		kas[u] = -1;
		low[u][0] = low[u][1] = INF;
	}
	return ats;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 876 KB Output is correct
2 Correct 1126 ms 10732 KB Output is correct
3 Correct 1247 ms 11116 KB Output is correct
4 Correct 1127 ms 11020 KB Output is correct
5 Correct 890 ms 11084 KB Output is correct
6 Correct 1087 ms 10732 KB Output is correct
7 Correct 1205 ms 11144 KB Output is correct
8 Correct 1196 ms 10988 KB Output is correct
9 Correct 908 ms 11116 KB Output is correct
10 Correct 985 ms 10752 KB Output is correct
11 Correct 1228 ms 10700 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 620 KB Output is correct
2 Correct 2873 ms 238444 KB Output is correct
3 Correct 5294 ms 241336 KB Output is correct
4 Correct 1896 ms 236096 KB Output is correct
5 Correct 4686 ms 271652 KB Output is correct
6 Correct 5719 ms 242632 KB Output is correct
7 Correct 4978 ms 56680 KB Output is correct
8 Correct 1847 ms 56464 KB Output is correct
9 Correct 3777 ms 61196 KB Output is correct
10 Correct 5665 ms 57764 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 876 KB Output is correct
2 Correct 1126 ms 10732 KB Output is correct
3 Correct 1247 ms 11116 KB Output is correct
4 Correct 1127 ms 11020 KB Output is correct
5 Correct 890 ms 11084 KB Output is correct
6 Correct 1087 ms 10732 KB Output is correct
7 Correct 1205 ms 11144 KB Output is correct
8 Correct 1196 ms 10988 KB Output is correct
9 Correct 908 ms 11116 KB Output is correct
10 Correct 985 ms 10752 KB Output is correct
11 Correct 1228 ms 10700 KB Output is correct
12 Correct 5 ms 620 KB Output is correct
13 Correct 2873 ms 238444 KB Output is correct
14 Correct 5294 ms 241336 KB Output is correct
15 Correct 1896 ms 236096 KB Output is correct
16 Correct 4686 ms 271652 KB Output is correct
17 Correct 5719 ms 242632 KB Output is correct
18 Correct 4978 ms 56680 KB Output is correct
19 Correct 1847 ms 56464 KB Output is correct
20 Correct 3777 ms 61196 KB Output is correct
21 Correct 5665 ms 57764 KB Output is correct
22 Correct 5199 ms 240776 KB Output is correct
23 Correct 5162 ms 242840 KB Output is correct
24 Correct 5801 ms 243888 KB Output is correct
25 Correct 6253 ms 247348 KB Output is correct
26 Correct 7848 ms 243436 KB Output is correct
27 Correct 5339 ms 276060 KB Output is correct
28 Correct 3805 ms 244764 KB Output is correct
29 Correct 7999 ms 246312 KB Output is correct
30 Correct 7968 ms 245704 KB Output is correct
31 Correct 7956 ms 246560 KB Output is correct
32 Correct 2570 ms 76604 KB Output is correct
33 Correct 2260 ms 71772 KB Output is correct
34 Correct 3243 ms 68168 KB Output is correct
35 Correct 3169 ms 68088 KB Output is correct
36 Correct 4320 ms 68972 KB Output is correct
37 Correct 4498 ms 68824 KB Output is correct