oj.uz

Submission #522793

# Submission time Handle Problem Language Result Execution time Memory
522793 2022-02-05T21:36:12 Z thiago_bastos Factories (JOI14_factories) C++17
100 / 100
 2479 ms 269864 KB 
#include "factories.h"
#include <vector>
#include <algorithm>
#include <utility>
#include <iostream>
using namespace std;

const int N = 5e5 + 10;

vector<pair<int, int>> adj[N], tour;
long long cost[N];
int tms, depth[N], in[N], pos[N], n;

void dfs(int u, int p) {
	in[u] = tms++;
	pos[u] = tour.size();
	tour.emplace_back(depth[u], u);
	for(auto [v, w] : adj[u]) {
		if(v == p) continue;
		cost[v] = cost[u] + w;
		depth[v] = depth[u] + 1;
		dfs(v, u);
		tour.emplace_back(depth[u], u);
	}
}

vector<vector<pair<int, int>>> sp;
const long long INF = 1e15L;

int lca(int a, int b) {
	if(pos[a] > pos[b]) swap(a, b);
	int lg = 31 - __builtin_clz(pos[b] - pos[a] + 1);
	return min(sp[lg][pos[a]], sp[lg][pos[b] - (1 << lg) + 1]).second;
}

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	for(int i = 0; i < N - 1; ++i) {
		adj[A[i]].emplace_back(B[i], D[i]);	
		adj[B[i]].emplace_back(A[i], D[i]);
	}
	dfs(0, 0);
	int lg = 32 - __builtin_clz(tour.size());
	sp = vector<vector<pair<int, int>>>(lg, vector<pair<int, int>>(tour.size()));
	for(int i = 0; i < (int)tour.size(); ++i) sp[0][i] = tour[i];
	for(int i = 1; i < lg; ++i)
	for(int j = 0; j + (1 << i) <= (int)tour.size(); ++j)
		sp[i][j] = min(sp[i - 1][j], sp[i - 1][(1 << (i - 1)) + j]);
}

bool cmp(pair<int, int> a, pair<int, int> b) {
	return in[a.first] < in[b.first];
}

long long st[2][2 * N];
vector<pair<int, int>> U;

long long query(long long st[], int l, int r) {
	long long ans = INF;
	int n = U.size();
	for(l += n, r += n; l <= r; l /= 2, r /= 2) {
		if(l & 1) ans = min(ans, st[l++]);
		if(~r & 1) ans = min(ans, st[r--]);
	}
	return ans;
}

long long solve(int lo, int hi, int p) {
	if(lo >= hi) return INF;
	int l = lo, r = hi + 1;

	while(l < r) {
		int mid = (l + r) / 2;
		int u = U[lo].first, v = U[mid].first;
		if(lca(u, v) == p) r = mid;
		else l = mid + 1;
	}

	if(r <= lo) return solve(lo + 1, hi, p);
	int u = U[lo].first, v = U[r - 1].first;
	int w = lca(u, v);
	long long ans = query(st[0], lo, r - 1) + query(st[1], lo, r - 1) - 2 * cost[w];	
	return min(ans, min(solve(lo, r - 1, w),solve(r, hi, p)));
}

long long Query(int S, int X[], int T, int Y[]) {

	U.resize(S + T);
	for(int i = 0; i < S; ++i) U[i] = {X[i], 0};
	for(int i = 0; i < T; ++i) U[S + i] = {Y[i], 1};
	sort(U.begin(), U.end(), cmp);

	int m = S + T;

	for(int i = 0; i < m; ++i) {
		st[0][i + m] = cost[U[i].first];
		st[1][i + m] = INF;
		if(U[i].second) swap(st[0][i + m], st[1][i + m]);	
	}

	for(int k = 0; k < 2; ++k)
	for(int i = m - 1; i >= 0; --i)
		st[k][i] = min(st[k][2 * i], st[k][2 * i + 1]);
	
	return solve(0, m - 1, -1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12560 KB Output is correct
2 Correct 567 ms 31168 KB Output is correct
3 Correct 689 ms 31152 KB Output is correct
4 Correct 684 ms 31304 KB Output is correct
5 Correct 823 ms 31444 KB Output is correct
6 Correct 516 ms 31416 KB Output is correct
7 Correct 719 ms 31200 KB Output is correct
8 Correct 669 ms 31336 KB Output is correct
9 Correct 792 ms 31480 KB Output is correct
10 Correct 532 ms 31424 KB Output is correct
11 Correct 656 ms 31116 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12236 KB Output is correct
2 Correct 1103 ms 242460 KB Output is correct
3 Correct 1042 ms 244120 KB Output is correct
4 Correct 854 ms 243064 KB Output is correct
5 Correct 1255 ms 266384 KB Output is correct
6 Correct 1134 ms 245304 KB Output is correct
7 Correct 867 ms 73016 KB Output is correct
8 Correct 707 ms 73276 KB Output is correct
9 Correct 694 ms 76196 KB Output is correct
10 Correct 812 ms 73924 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12560 KB Output is correct
2 Correct 567 ms 31168 KB Output is correct
3 Correct 689 ms 31152 KB Output is correct
4 Correct 684 ms 31304 KB Output is correct
5 Correct 823 ms 31444 KB Output is correct
6 Correct 516 ms 31416 KB Output is correct
7 Correct 719 ms 31200 KB Output is correct
8 Correct 669 ms 31336 KB Output is correct
9 Correct 792 ms 31480 KB Output is correct
10 Correct 532 ms 31424 KB Output is correct
11 Correct 656 ms 31116 KB Output is correct
12 Correct 10 ms 12236 KB Output is correct
13 Correct 1103 ms 242460 KB Output is correct
14 Correct 1042 ms 244120 KB Output is correct
15 Correct 854 ms 243064 KB Output is correct
16 Correct 1255 ms 266384 KB Output is correct
17 Correct 1134 ms 245304 KB Output is correct
18 Correct 867 ms 73016 KB Output is correct
19 Correct 707 ms 73276 KB Output is correct
20 Correct 694 ms 76196 KB Output is correct
21 Correct 812 ms 73924 KB Output is correct
22 Correct 1600 ms 250804 KB Output is correct
23 Correct 1552 ms 252012 KB Output is correct
24 Correct 2024 ms 252972 KB Output is correct
25 Correct 2039 ms 254556 KB Output is correct
26 Correct 2145 ms 253164 KB Output is correct
27 Correct 2479 ms 269864 KB Output is correct
28 Correct 1889 ms 259440 KB Output is correct
29 Correct 1956 ms 252976 KB Output is correct
30 Correct 1966 ms 252536 KB Output is correct
31 Correct 2093 ms 253200 KB Output is correct
32 Correct 1325 ms 80772 KB Output is correct
33 Correct 1071 ms 84544 KB Output is correct
34 Correct 905 ms 71920 KB Output is correct
35 Correct 896 ms 71736 KB Output is correct
36 Correct 1224 ms 72376 KB Output is correct
37 Correct 1204 ms 72208 KB Output is correct