oj.uz

Submission #734382

# Submission time Handle Problem Language Result Execution time Memory
734382 2023-05-02T10:52:21 Z NeroZein Two Currencies (JOI23_currencies) C++17
100 / 100
 1168 ms 37148 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, l, 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];

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

inline 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];
inline void upd (int id, int v) {
	while (id < N) {
		tree[id] += v;
		id += id & -id;
	}
}

inline 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, int l) {
	return qry(in[u]) + qry(in[v]) - 2 * qry(in[l]); 
}

void addEdge (int i, bool weighted) {
	int u = e[ch[i].first].first, v = e[ch[i].first].second; 
	if (dep[u] < dep[v]) swap(u, v); 
	if (weighted) {
		upd(in[u], out[u], ch[i].second);
	} else {
		upd(in[u], out[u], 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);
	}
	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, Lca(u, v), gold, silver}; 
		ans[i] = getSum(u, v, qs[i].l); 
	}
	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, qs[Mid[i].second].l));  
			}
			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].l) <= 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 3 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 8 ms 4052 KB Output is correct
6 Correct 9 ms 4216 KB Output is correct
7 Correct 7 ms 4052 KB Output is correct
8 Correct 8 ms 4240 KB Output is correct
9 Correct 8 ms 4180 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 9 ms 4232 KB Output is correct
12 Correct 9 ms 4188 KB Output is correct
13 Correct 10 ms 4180 KB Output is correct
14 Correct 9 ms 4308 KB Output is correct
15 Correct 10 ms 4180 KB Output is correct
16 Correct 10 ms 4180 KB Output is correct
17 Correct 9 ms 4180 KB Output is correct
18 Correct 9 ms 4120 KB Output is correct
19 Correct 9 ms 4180 KB Output is correct
20 Correct 9 ms 4180 KB Output is correct
21 Correct 9 ms 4240 KB Output is correct
22 Correct 8 ms 4236 KB Output is correct
23 Correct 8 ms 4180 KB Output is correct
24 Correct 9 ms 4232 KB Output is correct
25 Correct 8 ms 4180 KB Output is correct
26 Correct 8 ms 4180 KB Output is correct
27 Correct 7 ms 4180 KB Output is correct
28 Correct 9 ms 4180 KB Output is correct
29 Correct 8 ms 4180 KB Output is correct
30 Correct 9 ms 4236 KB Output is correct
31 Correct 10 ms 4232 KB Output is correct
32 Correct 9 ms 4180 KB Output is correct
33 Correct 8 ms 4180 KB Output is correct
34 Correct 8 ms 4180 KB Output is correct
35 Correct 8 ms 4180 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 9 ms 4232 KB Output is correct
3 Correct 8 ms 4180 KB Output is correct
4 Correct 9 ms 4180 KB Output is correct
5 Correct 653 ms 31632 KB Output is correct
6 Correct 806 ms 27252 KB Output is correct
7 Correct 812 ms 29984 KB Output is correct
8 Correct 599 ms 28872 KB Output is correct
9 Correct 551 ms 28364 KB Output is correct
10 Correct 1008 ms 34888 KB Output is correct
11 Correct 1063 ms 34844 KB Output is correct
12 Correct 984 ms 34948 KB Output is correct
13 Correct 1043 ms 34840 KB Output is correct
14 Correct 952 ms 34732 KB Output is correct
15 Correct 948 ms 36972 KB Output is correct
16 Correct 950 ms 37072 KB Output is correct
17 Correct 888 ms 36800 KB Output is correct
18 Correct 1041 ms 34308 KB Output is correct
19 Correct 1168 ms 34412 KB Output is correct
20 Correct 1129 ms 34456 KB Output is correct
21 Correct 1025 ms 34892 KB Output is correct
22 Correct 885 ms 34900 KB Output is correct
23 Correct 916 ms 34884 KB Output is correct
24 Correct 1014 ms 34948 KB Output is correct
25 Correct 869 ms 35000 KB Output is correct
26 Correct 880 ms 34972 KB Output is correct
27 Correct 773 ms 34892 KB Output is correct
28 Correct 748 ms 34836 KB Output is correct
29 Correct 674 ms 34716 KB Output is correct
30 Correct 879 ms 34884 KB Output is correct
31 Correct 779 ms 34852 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 8 ms 4180 KB Output is correct
3 Correct 8 ms 4276 KB Output is correct
4 Correct 8 ms 4228 KB Output is correct
5 Correct 552 ms 32872 KB Output is correct
6 Correct 492 ms 32304 KB Output is correct
7 Correct 590 ms 25396 KB Output is correct
8 Correct 824 ms 37128 KB Output is correct
9 Correct 923 ms 37132 KB Output is correct
10 Correct 964 ms 37136 KB Output is correct
11 Correct 686 ms 37148 KB Output is correct
12 Correct 774 ms 37132 KB Output is correct
13 Correct 808 ms 37128 KB Output is correct
14 Correct 832 ms 37136 KB Output is correct
15 Correct 797 ms 37140 KB Output is correct
16 Correct 744 ms 37136 KB Output is correct
17 Correct 750 ms 37136 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 3 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 8 ms 4052 KB Output is correct
6 Correct 9 ms 4216 KB Output is correct
7 Correct 7 ms 4052 KB Output is correct
8 Correct 8 ms 4240 KB Output is correct
9 Correct 8 ms 4180 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 9 ms 4232 KB Output is correct
12 Correct 9 ms 4188 KB Output is correct
13 Correct 10 ms 4180 KB Output is correct
14 Correct 9 ms 4308 KB Output is correct
15 Correct 10 ms 4180 KB Output is correct
16 Correct 10 ms 4180 KB Output is correct
17 Correct 9 ms 4180 KB Output is correct
18 Correct 9 ms 4120 KB Output is correct
19 Correct 9 ms 4180 KB Output is correct
20 Correct 9 ms 4180 KB Output is correct
21 Correct 9 ms 4240 KB Output is correct
22 Correct 8 ms 4236 KB Output is correct
23 Correct 8 ms 4180 KB Output is correct
24 Correct 9 ms 4232 KB Output is correct
25 Correct 8 ms 4180 KB Output is correct
26 Correct 8 ms 4180 KB Output is correct
27 Correct 7 ms 4180 KB Output is correct
28 Correct 9 ms 4180 KB Output is correct
29 Correct 8 ms 4180 KB Output is correct
30 Correct 9 ms 4236 KB Output is correct
31 Correct 10 ms 4232 KB Output is correct
32 Correct 9 ms 4180 KB Output is correct
33 Correct 8 ms 4180 KB Output is correct
34 Correct 8 ms 4180 KB Output is correct
35 Correct 8 ms 4180 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 9 ms 4232 KB Output is correct
38 Correct 8 ms 4180 KB Output is correct
39 Correct 9 ms 4180 KB Output is correct
40 Correct 653 ms 31632 KB Output is correct
41 Correct 806 ms 27252 KB Output is correct
42 Correct 812 ms 29984 KB Output is correct
43 Correct 599 ms 28872 KB Output is correct
44 Correct 551 ms 28364 KB Output is correct
45 Correct 1008 ms 34888 KB Output is correct
46 Correct 1063 ms 34844 KB Output is correct
47 Correct 984 ms 34948 KB Output is correct
48 Correct 1043 ms 34840 KB Output is correct
49 Correct 952 ms 34732 KB Output is correct
50 Correct 948 ms 36972 KB Output is correct
51 Correct 950 ms 37072 KB Output is correct
52 Correct 888 ms 36800 KB Output is correct
53 Correct 1041 ms 34308 KB Output is correct
54 Correct 1168 ms 34412 KB Output is correct
55 Correct 1129 ms 34456 KB Output is correct
56 Correct 1025 ms 34892 KB Output is correct
57 Correct 885 ms 34900 KB Output is correct
58 Correct 916 ms 34884 KB Output is correct
59 Correct 1014 ms 34948 KB Output is correct
60 Correct 869 ms 35000 KB Output is correct
61 Correct 880 ms 34972 KB Output is correct
62 Correct 773 ms 34892 KB Output is correct
63 Correct 748 ms 34836 KB Output is correct
64 Correct 674 ms 34716 KB Output is correct
65 Correct 879 ms 34884 KB Output is correct
66 Correct 779 ms 34852 KB Output is correct
67 Correct 2 ms 3540 KB Output is correct
68 Correct 8 ms 4180 KB Output is correct
69 Correct 8 ms 4276 KB Output is correct
70 Correct 8 ms 4228 KB Output is correct
71 Correct 552 ms 32872 KB Output is correct
72 Correct 492 ms 32304 KB Output is correct
73 Correct 590 ms 25396 KB Output is correct
74 Correct 824 ms 37128 KB Output is correct
75 Correct 923 ms 37132 KB Output is correct
76 Correct 964 ms 37136 KB Output is correct
77 Correct 686 ms 37148 KB Output is correct
78 Correct 774 ms 37132 KB Output is correct
79 Correct 808 ms 37128 KB Output is correct
80 Correct 832 ms 37136 KB Output is correct
81 Correct 797 ms 37140 KB Output is correct
82 Correct 744 ms 37136 KB Output is correct
83 Correct 750 ms 37136 KB Output is correct
84 Correct 610 ms 28360 KB Output is correct
85 Correct 585 ms 22928 KB Output is correct
86 Correct 605 ms 22484 KB Output is correct
87 Correct 958 ms 34844 KB Output is correct
88 Correct 1052 ms 34856 KB Output is correct
89 Correct 1125 ms 34844 KB Output is correct
90 Correct 1054 ms 34844 KB Output is correct
91 Correct 986 ms 34932 KB Output is correct
92 Correct 921 ms 36092 KB Output is correct
93 Correct 902 ms 36796 KB Output is correct
94 Correct 977 ms 34440 KB Output is correct
95 Correct 1067 ms 34432 KB Output is correct
96 Correct 1058 ms 34436 KB Output is correct
97 Correct 1008 ms 34380 KB Output is correct
98 Correct 899 ms 34896 KB Output is correct
99 Correct 897 ms 34896 KB Output is correct
100 Correct 1010 ms 34876 KB Output is correct
101 Correct 944 ms 34880 KB Output is correct
102 Correct 784 ms 34892 KB Output is correct
103 Correct 836 ms 34840 KB Output is correct
104 Correct 859 ms 34896 KB Output is correct
105 Correct 760 ms 34860 KB Output is correct
106 Correct 701 ms 34840 KB Output is correct
107 Correct 671 ms 34800 KB Output is correct
108 Correct 712 ms 34848 KB Output is correct