oj.uz

Submission #883960

# Submission time Handle Problem Language Result Execution time Memory
883960 2023-12-06T13:36:00 Z NK_ Two Currencies (JOI23_currencies) C++17
100 / 100
 2454 ms 41252 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define sz(x) int(x.size())
 
#define f first
#define s second
#define mp make_pair
 
using ll = long long;
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using QRY = array<ll, 4>;
using vpi = V<pi>;
using vpl = V<pl>;
using vi = V<int>;
using vl = V<ll>;
 
const int LG = 18;
 
struct BIT {
	int N; vl A; void init(int n) { N = n; A = vl(N, 0); };
	void upd(int p, int x) { for(++p;p<=N;p+=p&-p) A[p-1] += x; }
	ll sum(int l, int r) { return sum(r + 1) - sum(l); }
	ll sum(int r) { ll s = 0; for(;r;r-=r&-r) s += A[r-1]; return s; }
};
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, M, Q; cin >> N >> M >> Q;
 
	V<vpi> adj(N);
	for(int i = 0; i < N-1; i++) {
		int u, v; cin >> u >> v; --u, --v;
		adj[u].pb(mp(v, i));
		adj[v].pb(mp(u, i));
	}
 
	vpi C(M);
	for(auto& x : C) { cin >> x.s >> x.f; --x.s; }
	
	sort(begin(C), end(C));
	C.pb(mp(0, -1));
 
	V<QRY> qry(Q); 
	for(auto& x : qry) {
		cin >> x[0] >> x[1] >> x[2] >> x[3];
		--x[0], --x[1];
	}
 
	V<vi> up(N, vi(LG)); vi st(N), en(N), dep(N), EI(N-1); int t = 0;
	function<void(int, int)> gen = [&](int u, int p) {
		st[u] = t++;
		up[u][0] = p; for(int i = 1; i < LG; i++) up[u][i] = up[up[u][i-1]][i-1];
 
		for(auto& e : adj[u]) {
			auto [v, i] = e;
			if (v != p) {
				EI[i] = v; // v is the child of edge i
				dep[v] = dep[u] + 1;
				gen(v, u);
			}
		}
 
		en[u] = t - 1;
	};
 
	dep[0] = 0; gen(0, 0);
 
	auto jmp = [&](int u, int d) {
		for(int i = 0; i < LG; i++) if ((d >> i) & 1) u = up[u][i];
		return u;
	};	
 
	auto lca = [&](int a, int b) {
		if (dep[a] < dep[b]) swap(a, b);
		a = jmp(a, dep[a] - dep[b]);
 
		if (a == b) return a;
 
		for(int i = LG - 1; i >= 0; --i) {
			if (up[a][i] != up[b][i]) {
				a = up[a][i], b = up[b][i];
			}
		}
 
		return up[a][0];
	};
 
	BIT B, S, P; B.init(N + 1);
	for(int i = 0; i < M; i++) {
		int c, e; tie(c, e) = C[i];
		int u = EI[e];
		B.upd(st[u], 1); B.upd(en[u] + 1, -1);
	}
 
	// Parallel Binsearch
	// Largest i value that is true (LST TRUE)
	vi lo(Q, -1), hi(Q, M); vpl ans(Q, mp(-1, -1));
 
	for(int r = 0; r < LG; r++) {
		vi mid(Q); for(int i = 0; i < Q; i++) {
			if (lo[i] >= hi[i]) mid[i] = -1;
			else mid[i] = (lo[i] + hi[i] + 1) / 2;
		}
 
 		bool done = 1;
		V<vi> E(M+1); for(int i = 0; i < Q; i++) {
			if (mid[i] != -1) {
				E[mid[i]].pb(i);
				done = 0;
			}
		}

		if (done) break;
 
		S.init(N + 1), P.init(N + 1);
		for(int i = 0; i <= M; i++) {
			for(auto& idx : E[i]) { 
				int u = qry[idx][0], v = qry[idx][1], l = lca(u, v);
 
				ll s = S.sum(st[l], st[u]) + S.sum(st[l], st[v]) - 2 * S.sum(st[l], st[l]); // silver on path
				ll p = P.sum(st[l], st[u]) + P.sum(st[l], st[v]) - 2 * P.sum(st[l], st[l]); // checkpoints on path
				ll d = B.sum(st[l], st[u]) + B.sum(st[l], st[v]) - 2 * B.sum(st[l], st[l]); // checkpoints on path (all checkpoints)
				ll g = d - p;
 
				if (s <= qry[idx][3]) {
					lo[idx] = mid[idx];
					ans[idx] = mp(s, g);
				} else hi[idx] = mid[idx] - 1;
			}
 
			if (i != M) {
				int c, e; tie(c, e) = C[i];
				int u = EI[e];
				S.upd(st[u], c); S.upd(en[u] + 1, -c);
				P.upd(st[u], 1); P.upd(en[u] + 1, -1);
			}
		}
	}	
	// cout << endl << endl;
 
	for(int i = 0; i < Q; i++) {
		auto [a, b, g, s] = qry[i];
		auto [ns, ng] = ans[i];
 
		// cout << i << " ------> " << ns << " " << ng << endl;
		if (ns <= s && ng <= g) cout << g - ng << nl;
		else cout << -1 << nl;
	}
 
	exit(0-0);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 988 KB Output is correct
6 Correct 7 ms 1064 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 7 ms 1092 KB Output is correct
9 Correct 8 ms 860 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 8 ms 1088 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct
14 Correct 8 ms 1116 KB Output is correct
15 Correct 9 ms 1116 KB Output is correct
16 Correct 9 ms 1116 KB Output is correct
17 Correct 9 ms 1116 KB Output is correct
18 Correct 9 ms 1116 KB Output is correct
19 Correct 5 ms 1116 KB Output is correct
20 Correct 5 ms 1116 KB Output is correct
21 Correct 5 ms 1116 KB Output is correct
22 Correct 5 ms 1116 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 7 ms 1100 KB Output is correct
25 Correct 7 ms 856 KB Output is correct
26 Correct 5 ms 1088 KB Output is correct
27 Correct 5 ms 860 KB Output is correct
28 Correct 6 ms 860 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 8 ms 860 KB Output is correct
31 Correct 7 ms 1088 KB Output is correct
32 Correct 7 ms 860 KB Output is correct
33 Correct 8 ms 1280 KB Output is correct
34 Correct 7 ms 1116 KB Output is correct
35 Correct 7 ms 1252 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 8 ms 1076 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 880 ms 29292 KB Output is correct
6 Correct 941 ms 24544 KB Output is correct
7 Correct 993 ms 26716 KB Output is correct
8 Correct 770 ms 25888 KB Output is correct
9 Correct 843 ms 25532 KB Output is correct
10 Correct 1317 ms 32112 KB Output is correct
11 Correct 1535 ms 32224 KB Output is correct
12 Correct 1410 ms 31956 KB Output is correct
13 Correct 1446 ms 32488 KB Output is correct
14 Correct 1438 ms 32380 KB Output is correct
15 Correct 2112 ms 40280 KB Output is correct
16 Correct 2241 ms 41016 KB Output is correct
17 Correct 2348 ms 40204 KB Output is correct
18 Correct 2274 ms 32128 KB Output is correct
19 Correct 2237 ms 31680 KB Output is correct
20 Correct 2092 ms 31704 KB Output is correct
21 Correct 1002 ms 32552 KB Output is correct
22 Correct 937 ms 32420 KB Output is correct
23 Correct 913 ms 32352 KB Output is correct
24 Correct 917 ms 32636 KB Output is correct
25 Correct 1197 ms 32208 KB Output is correct
26 Correct 1097 ms 32352 KB Output is correct
27 Correct 1156 ms 32172 KB Output is correct
28 Correct 488 ms 32468 KB Output is correct
29 Correct 497 ms 32016 KB Output is correct
30 Correct 745 ms 32220 KB Output is correct
31 Correct 719 ms 32104 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 8 ms 1116 KB Output is correct
3 Correct 8 ms 1280 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 1214 ms 36368 KB Output is correct
6 Correct 1014 ms 35064 KB Output is correct
7 Correct 985 ms 26568 KB Output is correct
8 Correct 1823 ms 41252 KB Output is correct
9 Correct 2013 ms 40960 KB Output is correct
10 Correct 1896 ms 40840 KB Output is correct
11 Correct 1092 ms 41244 KB Output is correct
12 Correct 1104 ms 40992 KB Output is correct
13 Correct 1111 ms 41192 KB Output is correct
14 Correct 419 ms 40868 KB Output is correct
15 Correct 431 ms 41184 KB Output is correct
16 Correct 758 ms 40936 KB Output is correct
17 Correct 800 ms 41240 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 988 KB Output is correct
6 Correct 7 ms 1064 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 7 ms 1092 KB Output is correct
9 Correct 8 ms 860 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 8 ms 1088 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct
14 Correct 8 ms 1116 KB Output is correct
15 Correct 9 ms 1116 KB Output is correct
16 Correct 9 ms 1116 KB Output is correct
17 Correct 9 ms 1116 KB Output is correct
18 Correct 9 ms 1116 KB Output is correct
19 Correct 5 ms 1116 KB Output is correct
20 Correct 5 ms 1116 KB Output is correct
21 Correct 5 ms 1116 KB Output is correct
22 Correct 5 ms 1116 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 7 ms 1100 KB Output is correct
25 Correct 7 ms 856 KB Output is correct
26 Correct 5 ms 1088 KB Output is correct
27 Correct 5 ms 860 KB Output is correct
28 Correct 6 ms 860 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 8 ms 860 KB Output is correct
31 Correct 7 ms 1088 KB Output is correct
32 Correct 7 ms 860 KB Output is correct
33 Correct 8 ms 1280 KB Output is correct
34 Correct 7 ms 1116 KB Output is correct
35 Correct 7 ms 1252 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 8 ms 1076 KB Output is correct
38 Correct 7 ms 860 KB Output is correct
39 Correct 7 ms 1116 KB Output is correct
40 Correct 880 ms 29292 KB Output is correct
41 Correct 941 ms 24544 KB Output is correct
42 Correct 993 ms 26716 KB Output is correct
43 Correct 770 ms 25888 KB Output is correct
44 Correct 843 ms 25532 KB Output is correct
45 Correct 1317 ms 32112 KB Output is correct
46 Correct 1535 ms 32224 KB Output is correct
47 Correct 1410 ms 31956 KB Output is correct
48 Correct 1446 ms 32488 KB Output is correct
49 Correct 1438 ms 32380 KB Output is correct
50 Correct 2112 ms 40280 KB Output is correct
51 Correct 2241 ms 41016 KB Output is correct
52 Correct 2348 ms 40204 KB Output is correct
53 Correct 2274 ms 32128 KB Output is correct
54 Correct 2237 ms 31680 KB Output is correct
55 Correct 2092 ms 31704 KB Output is correct
56 Correct 1002 ms 32552 KB Output is correct
57 Correct 937 ms 32420 KB Output is correct
58 Correct 913 ms 32352 KB Output is correct
59 Correct 917 ms 32636 KB Output is correct
60 Correct 1197 ms 32208 KB Output is correct
61 Correct 1097 ms 32352 KB Output is correct
62 Correct 1156 ms 32172 KB Output is correct
63 Correct 488 ms 32468 KB Output is correct
64 Correct 497 ms 32016 KB Output is correct
65 Correct 745 ms 32220 KB Output is correct
66 Correct 719 ms 32104 KB Output is correct
67 Correct 0 ms 596 KB Output is correct
68 Correct 8 ms 1116 KB Output is correct
69 Correct 8 ms 1280 KB Output is correct
70 Correct 7 ms 1116 KB Output is correct
71 Correct 1214 ms 36368 KB Output is correct
72 Correct 1014 ms 35064 KB Output is correct
73 Correct 985 ms 26568 KB Output is correct
74 Correct 1823 ms 41252 KB Output is correct
75 Correct 2013 ms 40960 KB Output is correct
76 Correct 1896 ms 40840 KB Output is correct
77 Correct 1092 ms 41244 KB Output is correct
78 Correct 1104 ms 40992 KB Output is correct
79 Correct 1111 ms 41192 KB Output is correct
80 Correct 419 ms 40868 KB Output is correct
81 Correct 431 ms 41184 KB Output is correct
82 Correct 758 ms 40936 KB Output is correct
83 Correct 800 ms 41240 KB Output is correct
84 Correct 915 ms 25880 KB Output is correct
85 Correct 743 ms 20100 KB Output is correct
86 Correct 759 ms 19256 KB Output is correct
87 Correct 1717 ms 32116 KB Output is correct
88 Correct 1597 ms 32216 KB Output is correct
89 Correct 1494 ms 31968 KB Output is correct
90 Correct 1530 ms 32224 KB Output is correct
91 Correct 1546 ms 32356 KB Output is correct
92 Correct 2454 ms 37960 KB Output is correct
93 Correct 2359 ms 39944 KB Output is correct
94 Correct 2449 ms 31984 KB Output is correct
95 Correct 2409 ms 31716 KB Output is correct
96 Correct 2056 ms 31812 KB Output is correct
97 Correct 2344 ms 31804 KB Output is correct
98 Correct 1085 ms 32240 KB Output is correct
99 Correct 1039 ms 32044 KB Output is correct
100 Correct 1177 ms 32344 KB Output is correct
101 Correct 1168 ms 32432 KB Output is correct
102 Correct 1440 ms 32160 KB Output is correct
103 Correct 1477 ms 32332 KB Output is correct
104 Correct 1270 ms 32216 KB Output is correct
105 Correct 604 ms 32484 KB Output is correct
106 Correct 530 ms 32428 KB Output is correct
107 Correct 658 ms 32036 KB Output is correct
108 Correct 677 ms 32024 KB Output is correct