oj.uz

Submission #734368

# Submission time Handle Problem Language Result Execution time Memory
734368 2023-05-02T10:32:26 Z NeroZein Two Currencies (JOI23_currencies) C++17
40 / 100
 5000 ms 45740 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

struct queries {
	int u, v, gold, silver;
};

const int Log = 18;
const int N = 100005;

int n, m, q;
vector<int> g[N]; 
pair<int,int> e[N];
pair<int,int> ch[N];

int idd; 
int up[Log][N];
int in[N], out[N], dep[N];

void Dfs (int v, int p) {
	in[v] = ++idd;
	for (int u : g[v]) {
		if (u == p) continue;
		dep[u] = dep[v] + 1; 
		up[0][u] = v;
		for (int i = 1; i < Log; ++i) {
			up[i][u] = up[i - 1][up[i - 1][u]];
		}
		Dfs(u, v);
	}
	out[v] = idd;
}

int Lca (int u, int v) {
	if (dep[u] < dep[v]) swap(u, v);
	for (int i = 0; i < Log; ++i) {
		if ((dep[u] - dep[v]) >> i & 1) {
			u = up[i][u];
		}
	}
	if (u == v) {
		return u;
	}
	for (int i = Log - 1; i >= 0; --i) {
		if (up[i][u] != up[i][v]) {
			u = up[i][u], v = up[i][v];
		}
	}
	return up[0][u];
}

int tree[N];
void upd (int id, int v) {
	while (id < N) {
		tree[id] += v;
		id += id & -id;
	}
}

void upd (int l, int r, int v) {
	upd(l, v);
	upd(r + 1, -v); 
}

int qry (int id) {
	int ret = 0;
	while (id) {
		ret += tree[id];
		id -= id & -id;
	}
	return ret;
}

int getSum (int u, int v) {
	return qry(in[u]) + qry(in[v]) - 2 * qry(in[Lca(u, v)]); 
}

void addEdge (int i, bool weighted) {
	int u = e[ch[i].first].first, v = e[ch[i].first].second; 
		int l = Lca(u, v);
	if (weighted) {
		upd(in[u], out[u], ch[i].second);
		upd(in[v], out[v], ch[i].second);
		upd(in[l], out[l], -ch[i].second);
	} else {
		upd(in[u], out[u], 1);
		upd(in[v], out[v], 1);
		upd(in[l], out[l], -1);
	}
}

int ans[N]; 
int L[N], R[N];
pair<int,int> Mid[N]; 

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m >> q; 
	for (int i = 0; i < n - 1; ++i) {
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
		e[i] = {u, v};   
	}
	Dfs(1, 1);
	for (int i = 0; i < m; ++i) {
		int p, c;
		cin >> p >> c;
		ch[i] = {p - 1, c}; 
		addEdge(i, 0);
	}
	cout << '\n';
	vector<queries> qs(q); 
	for (int i = 0; i < q; ++i) {
		int u, v, gold, silver;
		cin >> u >> v >> gold >> silver;
		qs[i] = {u, v, gold, silver}; 
		ans[i] = getSum(u, v); 
	}
	sort(ch, ch + m, [&](pair<int,int>& a, pair<int,int>& b) {
		return a.second < b.second;
	});
	for (int i = 0; i < q; ++i) {
		L[i] = -1, R[i] = m - 1; 
	}
	while (true) {
		memset(tree, 0, sizeof tree);
		bool changed = false;
		for (int i = 0; i < q; ++i) {
			if (L[i] != R[i]) {
				Mid[i] = make_pair((L[i] + R[i] + 1) >> 1, i);				
				changed = true; 
			} else {
				Mid[i] = make_pair(L[i], i); 
			}
		}
		sort(Mid, Mid + q); 
		int p = 0;
		if (!changed) {
			for (int i = 0; i < q; ++i) {
				while (p <= Mid[i].first) {
					addEdge(p, 0); 
					p++; 
				}
				ans[Mid[i].second] = qs[Mid[i].second].gold - (ans[Mid[i].second] - getSum(qs[Mid[i].second].u, qs[Mid[i].second].v));  
			}
			break; 
		}
		for (int i = 0; i < q; ++i) {
			while (p <= Mid[i].first) {
				addEdge(p, 1); 
				p++;
			}
			int id = Mid[i].second;
			if (getSum(qs[id].u, qs[id].v) <= qs[id].silver) {
				L[id] = Mid[i].first;
			} else {
				R[id] = Mid[i].first - 1; 
			}
		}
	}
	for (int i = 0; i < q; ++i) {
		cout << max(-1LL, ans[i]) << '\n';
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 13 ms 4180 KB Output is correct
6 Correct 16 ms 4280 KB Output is correct
7 Correct 13 ms 4052 KB Output is correct
8 Correct 16 ms 4292 KB Output is correct
9 Correct 15 ms 4292 KB Output is correct
10 Correct 16 ms 4296 KB Output is correct
11 Correct 18 ms 4292 KB Output is correct
12 Correct 17 ms 4276 KB Output is correct
13 Correct 15 ms 4396 KB Output is correct
14 Correct 16 ms 4308 KB Output is correct
15 Correct 16 ms 4324 KB Output is correct
16 Correct 17 ms 4320 KB Output is correct
17 Correct 16 ms 4300 KB Output is correct
18 Correct 16 ms 4308 KB Output is correct
19 Correct 15 ms 4292 KB Output is correct
20 Correct 15 ms 4180 KB Output is correct
21 Correct 16 ms 4180 KB Output is correct
22 Correct 15 ms 4300 KB Output is correct
23 Correct 15 ms 4308 KB Output is correct
24 Correct 19 ms 4288 KB Output is correct
25 Correct 15 ms 4296 KB Output is correct
26 Correct 12 ms 4292 KB Output is correct
27 Correct 12 ms 4296 KB Output is correct
28 Correct 12 ms 4180 KB Output is correct
29 Correct 11 ms 4180 KB Output is correct
30 Correct 16 ms 4300 KB Output is correct
31 Correct 16 ms 4296 KB Output is correct
32 Correct 19 ms 4264 KB Output is correct
33 Correct 18 ms 4308 KB Output is correct
34 Correct 17 ms 4408 KB Output is correct
35 Correct 14 ms 4408 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 16 ms 4292 KB Output is correct
3 Correct 16 ms 4296 KB Output is correct
4 Correct 16 ms 4164 KB Output is correct
5 Correct 3047 ms 35524 KB Output is correct
6 Correct 3650 ms 31432 KB Output is correct
7 Correct 4034 ms 33880 KB Output is correct
8 Correct 2890 ms 32232 KB Output is correct
9 Correct 2726 ms 31872 KB Output is correct
10 Execution timed out 5092 ms 38988 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 14 ms 4436 KB Output is correct
3 Correct 13 ms 4308 KB Output is correct
4 Correct 13 ms 4412 KB Output is correct
5 Correct 1601 ms 40032 KB Output is correct
6 Correct 1487 ms 39084 KB Output is correct
7 Correct 1678 ms 31536 KB Output is correct
8 Correct 2582 ms 45672 KB Output is correct
9 Correct 2660 ms 45668 KB Output is correct
10 Correct 2526 ms 45644 KB Output is correct
11 Correct 1376 ms 45604 KB Output is correct
12 Correct 1432 ms 45604 KB Output is correct
13 Correct 1368 ms 45600 KB Output is correct
14 Correct 862 ms 45488 KB Output is correct
15 Correct 853 ms 45444 KB Output is correct
16 Correct 1108 ms 45608 KB Output is correct
17 Correct 1144 ms 45740 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 13 ms 4180 KB Output is correct
6 Correct 16 ms 4280 KB Output is correct
7 Correct 13 ms 4052 KB Output is correct
8 Correct 16 ms 4292 KB Output is correct
9 Correct 15 ms 4292 KB Output is correct
10 Correct 16 ms 4296 KB Output is correct
11 Correct 18 ms 4292 KB Output is correct
12 Correct 17 ms 4276 KB Output is correct
13 Correct 15 ms 4396 KB Output is correct
14 Correct 16 ms 4308 KB Output is correct
15 Correct 16 ms 4324 KB Output is correct
16 Correct 17 ms 4320 KB Output is correct
17 Correct 16 ms 4300 KB Output is correct
18 Correct 16 ms 4308 KB Output is correct
19 Correct 15 ms 4292 KB Output is correct
20 Correct 15 ms 4180 KB Output is correct
21 Correct 16 ms 4180 KB Output is correct
22 Correct 15 ms 4300 KB Output is correct
23 Correct 15 ms 4308 KB Output is correct
24 Correct 19 ms 4288 KB Output is correct
25 Correct 15 ms 4296 KB Output is correct
26 Correct 12 ms 4292 KB Output is correct
27 Correct 12 ms 4296 KB Output is correct
28 Correct 12 ms 4180 KB Output is correct
29 Correct 11 ms 4180 KB Output is correct
30 Correct 16 ms 4300 KB Output is correct
31 Correct 16 ms 4296 KB Output is correct
32 Correct 19 ms 4264 KB Output is correct
33 Correct 18 ms 4308 KB Output is correct
34 Correct 17 ms 4408 KB Output is correct
35 Correct 14 ms 4408 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 16 ms 4292 KB Output is correct
38 Correct 16 ms 4296 KB Output is correct
39 Correct 16 ms 4164 KB Output is correct
40 Correct 3047 ms 35524 KB Output is correct
41 Correct 3650 ms 31432 KB Output is correct
42 Correct 4034 ms 33880 KB Output is correct
43 Correct 2890 ms 32232 KB Output is correct
44 Correct 2726 ms 31872 KB Output is correct
45 Execution timed out 5092 ms 38988 KB Time limit exceeded
46 Halted 0 ms 0 KB -