oj.uz

Submission #883957

# Submission time Handle Problem Language Result Execution time Memory
883957 2023-12-06T13:33:30 Z NK_ Two Currencies (JOI23_currencies) C++17
100 / 100
 2250 ms 43924 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 QRY = array<ll, 4>;
using vpi = V<pi>;
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); vpi 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 8 ms 1156 KB Output is correct
7 Correct 7 ms 988 KB Output is correct
8 Correct 8 ms 1112 KB Output is correct
9 Correct 8 ms 1116 KB Output is correct
10 Correct 7 ms 1176 KB Output is correct
11 Correct 8 ms 1116 KB Output is correct
12 Correct 8 ms 1156 KB Output is correct
13 Correct 8 ms 1320 KB Output is correct
14 Correct 8 ms 1276 KB Output is correct
15 Correct 11 ms 1116 KB Output is correct
16 Correct 9 ms 1116 KB Output is correct
17 Correct 9 ms 1212 KB Output is correct
18 Correct 9 ms 1116 KB Output is correct
19 Correct 5 ms 1116 KB Output is correct
20 Correct 6 ms 1176 KB Output is correct
21 Correct 6 ms 1112 KB Output is correct
22 Correct 5 ms 1112 KB Output is correct
23 Correct 6 ms 1116 KB Output is correct
24 Correct 7 ms 1116 KB Output is correct
25 Correct 7 ms 1116 KB Output is correct
26 Correct 5 ms 1112 KB Output is correct
27 Correct 5 ms 1116 KB Output is correct
28 Correct 7 ms 1040 KB Output is correct
29 Correct 6 ms 1116 KB Output is correct
30 Correct 9 ms 1168 KB Output is correct
31 Correct 7 ms 1116 KB Output is correct
32 Correct 7 ms 976 KB Output is correct
33 Correct 8 ms 1364 KB Output is correct
34 Correct 7 ms 1116 KB Output is correct
35 Correct 7 ms 1368 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 1116 KB Output is correct
3 Correct 7 ms 1372 KB Output is correct
4 Correct 7 ms 1168 KB Output is correct
5 Correct 972 ms 31656 KB Output is correct
6 Correct 988 ms 26588 KB Output is correct
7 Correct 1022 ms 28816 KB Output is correct
8 Correct 720 ms 27812 KB Output is correct
9 Correct 765 ms 27424 KB Output is correct
10 Correct 1342 ms 34580 KB Output is correct
11 Correct 1398 ms 34508 KB Output is correct
12 Correct 1361 ms 34396 KB Output is correct
13 Correct 1402 ms 34588 KB Output is correct
14 Correct 1406 ms 34504 KB Output is correct
15 Correct 2183 ms 42848 KB Output is correct
16 Correct 2152 ms 43556 KB Output is correct
17 Correct 2250 ms 42632 KB Output is correct
18 Correct 1926 ms 34644 KB Output is correct
19 Correct 2183 ms 34292 KB Output is correct
20 Correct 1947 ms 34244 KB Output is correct
21 Correct 915 ms 34528 KB Output is correct
22 Correct 837 ms 34364 KB Output is correct
23 Correct 947 ms 34484 KB Output is correct
24 Correct 984 ms 34364 KB Output is correct
25 Correct 1114 ms 34712 KB Output is correct
26 Correct 1057 ms 35092 KB Output is correct
27 Correct 996 ms 34908 KB Output is correct
28 Correct 477 ms 34256 KB Output is correct
29 Correct 458 ms 34324 KB Output is correct
30 Correct 572 ms 34500 KB Output is correct
31 Correct 563 ms 34388 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 1116 KB Output is correct
3 Correct 7 ms 1372 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 995 ms 38500 KB Output is correct
6 Correct 930 ms 37188 KB Output is correct
7 Correct 881 ms 28660 KB Output is correct
8 Correct 1720 ms 43808 KB Output is correct
9 Correct 1532 ms 43648 KB Output is correct
10 Correct 1652 ms 43536 KB Output is correct
11 Correct 1039 ms 43860 KB Output is correct
12 Correct 951 ms 43604 KB Output is correct
13 Correct 991 ms 43924 KB Output is correct
14 Correct 425 ms 43572 KB Output is correct
15 Correct 429 ms 43912 KB Output is correct
16 Correct 694 ms 43540 KB Output is correct
17 Correct 692 ms 43428 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 8 ms 1156 KB Output is correct
7 Correct 7 ms 988 KB Output is correct
8 Correct 8 ms 1112 KB Output is correct
9 Correct 8 ms 1116 KB Output is correct
10 Correct 7 ms 1176 KB Output is correct
11 Correct 8 ms 1116 KB Output is correct
12 Correct 8 ms 1156 KB Output is correct
13 Correct 8 ms 1320 KB Output is correct
14 Correct 8 ms 1276 KB Output is correct
15 Correct 11 ms 1116 KB Output is correct
16 Correct 9 ms 1116 KB Output is correct
17 Correct 9 ms 1212 KB Output is correct
18 Correct 9 ms 1116 KB Output is correct
19 Correct 5 ms 1116 KB Output is correct
20 Correct 6 ms 1176 KB Output is correct
21 Correct 6 ms 1112 KB Output is correct
22 Correct 5 ms 1112 KB Output is correct
23 Correct 6 ms 1116 KB Output is correct
24 Correct 7 ms 1116 KB Output is correct
25 Correct 7 ms 1116 KB Output is correct
26 Correct 5 ms 1112 KB Output is correct
27 Correct 5 ms 1116 KB Output is correct
28 Correct 7 ms 1040 KB Output is correct
29 Correct 6 ms 1116 KB Output is correct
30 Correct 9 ms 1168 KB Output is correct
31 Correct 7 ms 1116 KB Output is correct
32 Correct 7 ms 976 KB Output is correct
33 Correct 8 ms 1364 KB Output is correct
34 Correct 7 ms 1116 KB Output is correct
35 Correct 7 ms 1368 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 8 ms 1116 KB Output is correct
38 Correct 7 ms 1372 KB Output is correct
39 Correct 7 ms 1168 KB Output is correct
40 Correct 972 ms 31656 KB Output is correct
41 Correct 988 ms 26588 KB Output is correct
42 Correct 1022 ms 28816 KB Output is correct
43 Correct 720 ms 27812 KB Output is correct
44 Correct 765 ms 27424 KB Output is correct
45 Correct 1342 ms 34580 KB Output is correct
46 Correct 1398 ms 34508 KB Output is correct
47 Correct 1361 ms 34396 KB Output is correct
48 Correct 1402 ms 34588 KB Output is correct
49 Correct 1406 ms 34504 KB Output is correct
50 Correct 2183 ms 42848 KB Output is correct
51 Correct 2152 ms 43556 KB Output is correct
52 Correct 2250 ms 42632 KB Output is correct
53 Correct 1926 ms 34644 KB Output is correct
54 Correct 2183 ms 34292 KB Output is correct
55 Correct 1947 ms 34244 KB Output is correct
56 Correct 915 ms 34528 KB Output is correct
57 Correct 837 ms 34364 KB Output is correct
58 Correct 947 ms 34484 KB Output is correct
59 Correct 984 ms 34364 KB Output is correct
60 Correct 1114 ms 34712 KB Output is correct
61 Correct 1057 ms 35092 KB Output is correct
62 Correct 996 ms 34908 KB Output is correct
63 Correct 477 ms 34256 KB Output is correct
64 Correct 458 ms 34324 KB Output is correct
65 Correct 572 ms 34500 KB Output is correct
66 Correct 563 ms 34388 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 7 ms 1116 KB Output is correct
69 Correct 7 ms 1372 KB Output is correct
70 Correct 7 ms 1116 KB Output is correct
71 Correct 995 ms 38500 KB Output is correct
72 Correct 930 ms 37188 KB Output is correct
73 Correct 881 ms 28660 KB Output is correct
74 Correct 1720 ms 43808 KB Output is correct
75 Correct 1532 ms 43648 KB Output is correct
76 Correct 1652 ms 43536 KB Output is correct
77 Correct 1039 ms 43860 KB Output is correct
78 Correct 951 ms 43604 KB Output is correct
79 Correct 991 ms 43924 KB Output is correct
80 Correct 425 ms 43572 KB Output is correct
81 Correct 429 ms 43912 KB Output is correct
82 Correct 694 ms 43540 KB Output is correct
83 Correct 692 ms 43428 KB Output is correct
84 Correct 804 ms 28036 KB Output is correct
85 Correct 719 ms 22060 KB Output is correct
86 Correct 658 ms 20800 KB Output is correct
87 Correct 1272 ms 34152 KB Output is correct
88 Correct 1193 ms 34068 KB Output is correct
89 Correct 1339 ms 33988 KB Output is correct
90 Correct 1278 ms 34068 KB Output is correct
91 Correct 1382 ms 34248 KB Output is correct
92 Correct 1960 ms 40588 KB Output is correct
93 Correct 2008 ms 42772 KB Output is correct
94 Correct 1922 ms 34636 KB Output is correct
95 Correct 1915 ms 34392 KB Output is correct
96 Correct 1888 ms 34356 KB Output is correct
97 Correct 1938 ms 34352 KB Output is correct
98 Correct 922 ms 34264 KB Output is correct
99 Correct 901 ms 34364 KB Output is correct
100 Correct 952 ms 34496 KB Output is correct
101 Correct 945 ms 34564 KB Output is correct
102 Correct 1089 ms 34928 KB Output is correct
103 Correct 1176 ms 35096 KB Output is correct
104 Correct 1225 ms 34736 KB Output is correct
105 Correct 559 ms 34580 KB Output is correct
106 Correct 508 ms 34440 KB Output is correct
107 Correct 654 ms 34148 KB Output is correct
108 Correct 629 ms 34328 KB Output is correct