oj.uz

답안 #883981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
883981 2023-12-06T13:44:19 Z NK_ Two Currencies (JOI23_currencies) C++17
100 / 100
 2062 ms 40900 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 = int64_t;
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;
 
template<class T> struct BIT {
	int N; V<T> A; void init(int n) { N = n; A = V<T>(N, 0); };
	void upd(int p, int x) { for(++p;p<=N;p+=p&-p) A[p-1] += x; }
	T sum(int l, int r) { return sum(r + 1) - sum(l); }
	T sum(int r) { T 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]) {
			int v, i; tie(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<int> B, P; BIT<ll> S; 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++) {
		ll g = qry[i][2], s = qry[i][3];
		ll ns, ng; tie(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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 976 KB Output is correct
6 Correct 9 ms 860 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 7 ms 860 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 8 ms 1068 KB Output is correct
12 Correct 7 ms 856 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct
14 Correct 8 ms 1200 KB Output is correct
15 Correct 9 ms 1120 KB Output is correct
16 Correct 9 ms 1096 KB Output is correct
17 Correct 9 ms 1116 KB Output is correct
18 Correct 9 ms 1128 KB Output is correct
19 Correct 5 ms 1084 KB Output is correct
20 Correct 6 ms 860 KB Output is correct
21 Correct 8 ms 900 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 6 ms 860 KB Output is correct
26 Correct 5 ms 860 KB Output is correct
27 Correct 6 ms 860 KB Output is correct
28 Correct 5 ms 928 KB Output is correct
29 Correct 6 ms 860 KB Output is correct
30 Correct 7 ms 860 KB Output is correct
31 Correct 7 ms 932 KB Output is correct
32 Correct 7 ms 1112 KB Output is correct
33 Correct 7 ms 1116 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 7 ms 1128 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 7 ms 856 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 786 ms 28404 KB Output is correct
6 Correct 847 ms 24128 KB Output is correct
7 Correct 861 ms 26152 KB Output is correct
8 Correct 670 ms 25164 KB Output is correct
9 Correct 738 ms 25140 KB Output is correct
10 Correct 1282 ms 31832 KB Output is correct
11 Correct 1174 ms 31768 KB Output is correct
12 Correct 1201 ms 31684 KB Output is correct
13 Correct 1247 ms 31572 KB Output is correct
14 Correct 1223 ms 31952 KB Output is correct
15 Correct 1988 ms 40176 KB Output is correct
16 Correct 1884 ms 40292 KB Output is correct
17 Correct 1943 ms 39388 KB Output is correct
18 Correct 1701 ms 31384 KB Output is correct
19 Correct 1644 ms 31252 KB Output is correct
20 Correct 1561 ms 30776 KB Output is correct
21 Correct 790 ms 31988 KB Output is correct
22 Correct 801 ms 31572 KB Output is correct
23 Correct 775 ms 31624 KB Output is correct
24 Correct 859 ms 31600 KB Output is correct
25 Correct 1008 ms 31828 KB Output is correct
26 Correct 945 ms 32084 KB Output is correct
27 Correct 880 ms 32208 KB Output is correct
28 Correct 474 ms 31568 KB Output is correct
29 Correct 421 ms 31432 KB Output is correct
30 Correct 566 ms 31132 KB Output is correct
31 Correct 548 ms 31584 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 8 ms 1236 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 912 ms 35448 KB Output is correct
6 Correct 910 ms 34200 KB Output is correct
7 Correct 903 ms 26264 KB Output is correct
8 Correct 1614 ms 40624 KB Output is correct
9 Correct 1537 ms 40660 KB Output is correct
10 Correct 2062 ms 40900 KB Output is correct
11 Correct 1594 ms 40604 KB Output is correct
12 Correct 1700 ms 40340 KB Output is correct
13 Correct 1533 ms 40724 KB Output is correct
14 Correct 574 ms 40352 KB Output is correct
15 Correct 580 ms 40344 KB Output is correct
16 Correct 1022 ms 40096 KB Output is correct
17 Correct 1030 ms 40344 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 976 KB Output is correct
6 Correct 9 ms 860 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 7 ms 860 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 8 ms 1068 KB Output is correct
12 Correct 7 ms 856 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct
14 Correct 8 ms 1200 KB Output is correct
15 Correct 9 ms 1120 KB Output is correct
16 Correct 9 ms 1096 KB Output is correct
17 Correct 9 ms 1116 KB Output is correct
18 Correct 9 ms 1128 KB Output is correct
19 Correct 5 ms 1084 KB Output is correct
20 Correct 6 ms 860 KB Output is correct
21 Correct 8 ms 900 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 6 ms 860 KB Output is correct
26 Correct 5 ms 860 KB Output is correct
27 Correct 6 ms 860 KB Output is correct
28 Correct 5 ms 928 KB Output is correct
29 Correct 6 ms 860 KB Output is correct
30 Correct 7 ms 860 KB Output is correct
31 Correct 7 ms 932 KB Output is correct
32 Correct 7 ms 1112 KB Output is correct
33 Correct 7 ms 1116 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 7 ms 1128 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 7 ms 860 KB Output is correct
38 Correct 7 ms 856 KB Output is correct
39 Correct 7 ms 860 KB Output is correct
40 Correct 786 ms 28404 KB Output is correct
41 Correct 847 ms 24128 KB Output is correct
42 Correct 861 ms 26152 KB Output is correct
43 Correct 670 ms 25164 KB Output is correct
44 Correct 738 ms 25140 KB Output is correct
45 Correct 1282 ms 31832 KB Output is correct
46 Correct 1174 ms 31768 KB Output is correct
47 Correct 1201 ms 31684 KB Output is correct
48 Correct 1247 ms 31572 KB Output is correct
49 Correct 1223 ms 31952 KB Output is correct
50 Correct 1988 ms 40176 KB Output is correct
51 Correct 1884 ms 40292 KB Output is correct
52 Correct 1943 ms 39388 KB Output is correct
53 Correct 1701 ms 31384 KB Output is correct
54 Correct 1644 ms 31252 KB Output is correct
55 Correct 1561 ms 30776 KB Output is correct
56 Correct 790 ms 31988 KB Output is correct
57 Correct 801 ms 31572 KB Output is correct
58 Correct 775 ms 31624 KB Output is correct
59 Correct 859 ms 31600 KB Output is correct
60 Correct 1008 ms 31828 KB Output is correct
61 Correct 945 ms 32084 KB Output is correct
62 Correct 880 ms 32208 KB Output is correct
63 Correct 474 ms 31568 KB Output is correct
64 Correct 421 ms 31432 KB Output is correct
65 Correct 566 ms 31132 KB Output is correct
66 Correct 548 ms 31584 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 8 ms 1236 KB Output is correct
69 Correct 7 ms 1116 KB Output is correct
70 Correct 7 ms 1116 KB Output is correct
71 Correct 912 ms 35448 KB Output is correct
72 Correct 910 ms 34200 KB Output is correct
73 Correct 903 ms 26264 KB Output is correct
74 Correct 1614 ms 40624 KB Output is correct
75 Correct 1537 ms 40660 KB Output is correct
76 Correct 2062 ms 40900 KB Output is correct
77 Correct 1594 ms 40604 KB Output is correct
78 Correct 1700 ms 40340 KB Output is correct
79 Correct 1533 ms 40724 KB Output is correct
80 Correct 574 ms 40352 KB Output is correct
81 Correct 580 ms 40344 KB Output is correct
82 Correct 1022 ms 40096 KB Output is correct
83 Correct 1030 ms 40344 KB Output is correct
84 Correct 1020 ms 25184 KB Output is correct
85 Correct 706 ms 19684 KB Output is correct
86 Correct 625 ms 18744 KB Output is correct
87 Correct 1252 ms 31568 KB Output is correct
88 Correct 1232 ms 31952 KB Output is correct
89 Correct 1351 ms 31532 KB Output is correct
90 Correct 1321 ms 31836 KB Output is correct
91 Correct 1408 ms 31920 KB Output is correct
92 Correct 1978 ms 37084 KB Output is correct
93 Correct 2060 ms 39572 KB Output is correct
94 Correct 2045 ms 31192 KB Output is correct
95 Correct 1956 ms 31240 KB Output is correct
96 Correct 1906 ms 31444 KB Output is correct
97 Correct 1900 ms 31256 KB Output is correct
98 Correct 886 ms 31628 KB Output is correct
99 Correct 888 ms 31624 KB Output is correct
100 Correct 1004 ms 31480 KB Output is correct
101 Correct 1198 ms 31864 KB Output is correct
102 Correct 1388 ms 31564 KB Output is correct
103 Correct 1564 ms 31568 KB Output is correct
104 Correct 1320 ms 31768 KB Output is correct
105 Correct 555 ms 31252 KB Output is correct
106 Correct 493 ms 31512 KB Output is correct
107 Correct 585 ms 31368 KB Output is correct
108 Correct 605 ms 31328 KB Output is correct