oj.uz

답안 #890087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890087 2023-12-20T14:00:39 Z Onown 공장들 (JOI14_factories) C++
33 / 100
 8000 ms 197832 KB 
#include <bits/stdc++.h>
#include <factories.h>
#pragma GCC optimize("Ofast")
using namespace std;

const int N = 5e5 + 55, L = 2e0 + 20, Q = 185;
const long long I = 1e18 + 118;
int n, q, h[N], par[N][L];
long long ans, spt[N][L], dis[N];
vector<pair<int, int>> adj[N];

void dfs(int v, int p) {
	for (auto [u, w]: adj[v])
		if (u != p) {
			par[u][0] = v;
			spt[u][0] = w;
			h[u] = h[v] + 1;
			dfs(u, v);
		}
}

void dfsu(int v, int p) {
	for (auto [u, w]: adj[v])
		if (u != p) {
			dfsu(u, v);
			dis[v] = min(dis[v], dis[u] + w);
		}
}

void dfsd(int v, int p) {
	for (auto [u, w]: adj[v])
		if (u != p) {
			dis[u] = min(dis[u], dis[v] + w);
			dfsd(u, v);
		}
}

long long distance(int v, int u) {
	long long res = 0;
	if (h[v] < h[u]) swap(v, u);
	for (int i = 0; i < L && res < ans; i++)
		if ((1 << i) & (h[v] - h[u])) {
			res += spt[v][i];
			v = par[v][i];
		}
	if (v == u) return res;

	for (int i = L - 1; i >= 0 && res < ans; i--)
		if (par[v][i] != par[u][i]) {
			res += spt[v][i] + spt[u][i];
			v = par[v][i];
			u = par[u][i];
		}
	return res + spt[v][0] + spt[u][0];
}

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	for (int i = 0; i < n - 1; i++) {
		adj[A[i] + 1].push_back({B[i] + 1, D[i]});
		adj[B[i] + 1].push_back({A[i] + 1, D[i]});
	}

	dfs(1, 0);
	for (int i = 1; i < L; i++)
		for (int j = 1; j <= n; j++) {
			par[j][i] = par[par[j][i - 1]][i - 1];
			spt[j][i] = spt[j][i - 1] + spt[par[j][i - 1]][i - 1];
		}
}

long long Query(int S, int X[], int T, int Y[]) {
	ans = I;
	if (S < Q) {
		for (int i = 0; i < T; i++)
			for (int j = 0; j < S; j++)
				ans = min(ans, distance(Y[i] + 1, X[j] + 1));
		return ans;
	}
	
	for (int i = 0; i < N; dis[i++] = I);
	for (int i = 0; i < S; dis[X[i++] + 1] = 0); 
	dfsu(1, 0);
	dfsd(1, 0);

	for (int i = 0; i < T; i++)
		ans = min(ans, dis[Y[i] + 1]);
	return ans;
}

Compilation message

factories.cpp: In function 'void dfs(int, int)':
factories.cpp:13:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   13 |  for (auto [u, w]: adj[v])
      |            ^
factories.cpp: In function 'void dfsu(int, int)':
factories.cpp:23:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   23 |  for (auto [u, w]: adj[v])
      |            ^
factories.cpp: In function 'void dfsd(int, int)':
factories.cpp:31:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |  for (auto [u, w]: adj[v])
      |            ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 35416 KB Output is correct
2 Correct 720 ms 41848 KB Output is correct
3 Correct 1854 ms 41848 KB Output is correct
4 Correct 366 ms 41812 KB Output is correct
5 Correct 749 ms 41864 KB Output is correct
6 Correct 1041 ms 41860 KB Output is correct
7 Correct 1768 ms 41856 KB Output is correct
8 Correct 1408 ms 41852 KB Output is correct
9 Correct 727 ms 41972 KB Output is correct
10 Correct 1024 ms 41868 KB Output is correct
11 Correct 1513 ms 41872 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 1284 ms 186932 KB Output is correct
3 Correct 2283 ms 188000 KB Output is correct
4 Correct 841 ms 187864 KB Output is correct
5 Correct 3077 ms 197832 KB Output is correct
6 Correct 1967 ms 188320 KB Output is correct
7 Correct 2009 ms 69108 KB Output is correct
8 Correct 1050 ms 69292 KB Output is correct
9 Correct 2948 ms 70372 KB Output is correct
10 Correct 1533 ms 69548 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 35416 KB Output is correct
2 Correct 720 ms 41848 KB Output is correct
3 Correct 1854 ms 41848 KB Output is correct
4 Correct 366 ms 41812 KB Output is correct
5 Correct 749 ms 41864 KB Output is correct
6 Correct 1041 ms 41860 KB Output is correct
7 Correct 1768 ms 41856 KB Output is correct
8 Correct 1408 ms 41852 KB Output is correct
9 Correct 727 ms 41972 KB Output is correct
10 Correct 1024 ms 41868 KB Output is correct
11 Correct 1513 ms 41872 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 1284 ms 186932 KB Output is correct
14 Correct 2283 ms 188000 KB Output is correct
15 Correct 841 ms 187864 KB Output is correct
16 Correct 3077 ms 197832 KB Output is correct
17 Correct 1967 ms 188320 KB Output is correct
18 Correct 2009 ms 69108 KB Output is correct
19 Correct 1050 ms 69292 KB Output is correct
20 Correct 2948 ms 70372 KB Output is correct
21 Correct 1533 ms 69548 KB Output is correct
22 Correct 6227 ms 188384 KB Output is correct
23 Correct 3842 ms 189240 KB Output is correct
24 Correct 7183 ms 189268 KB Output is correct
25 Correct 7110 ms 190900 KB Output is correct
26 Execution timed out 8038 ms 189484 KB Time limit exceeded
27 Halted 0 ms 0 KB -