oj.uz

Submission #899851

# Submission time Handle Problem Language Result Execution time Memory
899851 2024-01-07T07:30:25 Z Onown Factories (JOI14_factories) C++17
33 / 100
 8000 ms 292532 KB 
#include <bits/stdc++.h>
#include <factories.h>
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx")
using namespace std;

#define F first
#define S second
#define PB push_back

const int N = 5e5 + 55, L = 2e0 + 20;
const long long I = 1e18 + 118;
int n, ocr[N], lg[2 * N];
long long tr[N], dis[N];
vector<pair<int, int>> adj[N];
pair<int, int> rmq[2 * N][L];

void dfs(int v, int p, int h) {
	static int plc = 0;
	rmq[ocr[v] = plc++][0] = {h, v};
	for (auto [u, w]: adj[v])
		if (u != p) {
			tr[u] = tr[v] + w;
			dfs(u, v, h + 1);
			rmq[plc++][0] = {h, v};
		}
}

long long distance(int v, int u) {
	if (ocr[v] > ocr[u]) swap(v, u);
	int s = ocr[v], e = ocr[u], t = lg[e - s + 1];
	pair<int, int> hl = min(rmq[s][t], rmq[e - (1 << t) + 1][t]);
	return tr[v] + tr[u] - 2 * tr[hl.S];
}

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);
		}
}

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	for (int i = 0; i < n - 1; i++) {
		adj[A[i]].push_back({B[i], D[i]});
		adj[B[i]].push_back({A[i], D[i]});
	}
 
 	for (int i = 2; i < 2 * N; i++) lg[i] = lg[i / 2] + 1;
	dfs(0, -1, 0);
	for (int j = 1; j < L; j++)
		for (int i = 0; i + (1 << j) < 2 * n; i++)
			rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
}

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

	for (int i = 0; i < n; dis[i++] = I);
	for (int i = 0; i < S; i++)
		dis[X[i]] = 0;

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

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 37724 KB Output is correct
2 Correct 2063 ms 51120 KB Output is correct
3 Correct 2828 ms 51144 KB Output is correct
4 Correct 847 ms 51028 KB Output is correct
5 Correct 1364 ms 51536 KB Output is correct
6 Correct 1354 ms 51140 KB Output is correct
7 Correct 2534 ms 51152 KB Output is correct
8 Correct 879 ms 50988 KB Output is correct
9 Correct 1329 ms 51536 KB Output is correct
10 Correct 1360 ms 51136 KB Output is correct
11 Correct 2574 ms 51152 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 37468 KB Output is correct
2 Correct 801 ms 254928 KB Output is correct
3 Correct 961 ms 258668 KB Output is correct
4 Correct 591 ms 255484 KB Output is correct
5 Correct 733 ms 292532 KB Output is correct
6 Correct 789 ms 259368 KB Output is correct
7 Correct 747 ms 94288 KB Output is correct
8 Correct 560 ms 94532 KB Output is correct
9 Correct 528 ms 98644 KB Output is correct
10 Correct 608 ms 95120 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 37724 KB Output is correct
2 Correct 2063 ms 51120 KB Output is correct
3 Correct 2828 ms 51144 KB Output is correct
4 Correct 847 ms 51028 KB Output is correct
5 Correct 1364 ms 51536 KB Output is correct
6 Correct 1354 ms 51140 KB Output is correct
7 Correct 2534 ms 51152 KB Output is correct
8 Correct 879 ms 50988 KB Output is correct
9 Correct 1329 ms 51536 KB Output is correct
10 Correct 1360 ms 51136 KB Output is correct
11 Correct 2574 ms 51152 KB Output is correct
12 Correct 8 ms 37468 KB Output is correct
13 Correct 801 ms 254928 KB Output is correct
14 Correct 961 ms 258668 KB Output is correct
15 Correct 591 ms 255484 KB Output is correct
16 Correct 733 ms 292532 KB Output is correct
17 Correct 789 ms 259368 KB Output is correct
18 Correct 747 ms 94288 KB Output is correct
19 Correct 560 ms 94532 KB Output is correct
20 Correct 528 ms 98644 KB Output is correct
21 Correct 608 ms 95120 KB Output is correct
22 Correct 5699 ms 262400 KB Output is correct
23 Correct 2926 ms 263932 KB Output is correct
24 Correct 6425 ms 265896 KB Output is correct
25 Correct 6357 ms 268560 KB Output is correct
26 Execution timed out 8010 ms 266368 KB Time limit exceeded
27 Halted 0 ms 0 KB -