oj.uz

Submission #892062

# Submission time Handle Problem Language Result Execution time Memory
892062 2023-12-24T18:12:27 Z iskhakkutbilim Two Currencies (JOI23_currencies) C++17
100 / 100
 644 ms 66244 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 998244353;
const int N = 1e5;



struct Fenwick{
	int n;
	vector<int> fenw;
	Fenwick(int sz){
		n = sz;
		fenw.resize(n+1, 0);
	};
	
	void add(int i, int x){
		for(; i <= n; i+= i&-i){
			fenw[i]+= x;
		}
	}
	
	int pref(int i){
		int s = 0;
		for(; i > 0; i-= i & -i){
			s+= fenw[i];
		}
		return s;
	}
	int sum(int l, int r){
		return pref(r) - pref(l-1);
	}
};
int n, m, q;
vector<int > g[N+10];
vector< pair<int, int> > edge;
int depth[N+10], up[N+10][20], sum[N+10][20];
int tin[N+10], tout[N+10], timer = 1;
void dfs(int v, int par){
	tin[v] = timer++;
	up[v][0] = par;
	for(int to : g[v]){
		if(to == par) continue;
		depth[to] = depth[v] + 1;
		dfs(to, v);
	}
	tout[v] = timer - 1;
}
int lca(int a, int b){
	if(depth[b] < depth[a]) swap(a, b);
	int k = depth[b] - depth[a];
	for(int i = 0;i < 20; i++){
		if(k & (1<<i)) b = up[b][i];
	}
	if(a == b) return a;
	for(int i = 19; i >= 0; i--){
		if(up[b][i] != up[a][i]){
			a = up[a][i];
			b = up[b][i];
		}
	}
	return up[a][0];
}


int ones(int a, int d){
	int s = 0;
	for(int i = 0;i < 20; i++){
		if(d & (1<<i)){
			s+= sum[a][i];
			a = up[a][i];
		}
	}
	return s;
}


signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> m >> q;
	for(int i = 1;i < n; i++){
		int a, b; cin >> a >> b;
		edge.push_back({a, b});
		g[a].push_back(b);
		g[b].push_back(a);
	}
	dfs(1, 1);
	vector<array<int, 2> > adds;
	for(int i = 0;i < m; i++){
		int p, c; cin >> p >> c;
		int a = edge[p-1].ff, b = edge[p-1].ss;
		if(depth[a] < depth[b]) swap(a, b);
		adds.push_back({a, c});
		sum[a][0]+= 1;
	}
	sort(all(adds), [&](auto A, auto B){
		return A[1] < B[1];
	});
	for(int j = 1;j < 20; j++){
		for(int i = 1;i <= n; i++){
			up[i][j] = up[up[i][j-1]][j-1];
			sum[i][j] = sum[up[i][j-1]][j-1] + sum[i][j-1];
		}
	}
	vector<array<int, 4> > query(q);
	vector<int> overall, lc;
	vector< array<int, 2> > rn(q, {0, m+1});
	for(auto &A : query){
		cin >> A[0] >> A[1] >> A[2] >> A[3];
		int all_p = lca(A[0], A[1]);
		lc.push_back(all_p);
		int checkpoints = ones(A[0],  depth[A[0]] - depth[lc.back()]) + ones(A[1], depth[A[1]] - depth[lc.back()]);
		overall.push_back(checkpoints);
	}
	vector<int> ans(q);
	for(int i = 0;i < q; i++){
		auto A = query[i];
		ans[i] = A[2] - overall[i];
	}
	
	while(true){
		Fenwick f1(n + 2), f2(n + 2);
		vector< vector<int> > middles(m + 1);
		bool finish = true;
		for(int i = 0;i < q; i++){
			if(rn[i][0] + 1 < rn[i][1]){
				int mid = (rn[i][0] + rn[i][1]) / 2;
				middles[mid].push_back(i);
				finish = false;
			}
		}
		
		for(int i = 0;i <= m; i++){
			
			for(auto idx : middles[i]){
				auto [s, t, gold, silver]  =  query[idx];
				int LC = lc[idx], checkpoints = overall[idx]; 
				int sum = f1.pref(tin[s]) + f1.pref(tin[t]) - 2 * f1.pref(tin[LC]);
				int cnt = f2.pref(tin[s]) + f2.pref(tin[t]) - 2 * f2.pref(tin[LC]);
				checkpoints-= cnt;
				if(sum <= silver){
					ans[idx] =  max(ans[idx], gold - checkpoints);
					rn[idx][0] = i;
				}else{
					rn[idx][1] = i;
				}
			}
			if(i < m){
				auto [a, c] = adds[i];
				f1.add(tin[a], c);
				f1.add(tout[a] + 1, -c);
				f2.add(tin[a], 1);
				f2.add(tout[a] + 1, -1);
			}
			
		}
		if(finish) break;
	}
	
	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 7516 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 1 ms 7516 KB Output is correct
4 Correct 1 ms 7516 KB Output is correct
5 Correct 5 ms 7772 KB Output is correct
6 Correct 6 ms 7772 KB Output is correct
7 Correct 5 ms 7928 KB Output is correct
8 Correct 6 ms 7772 KB Output is correct
9 Correct 6 ms 8012 KB Output is correct
10 Correct 6 ms 8028 KB Output is correct
11 Correct 6 ms 7772 KB Output is correct
12 Correct 6 ms 8024 KB Output is correct
13 Correct 7 ms 8028 KB Output is correct
14 Correct 7 ms 8028 KB Output is correct
15 Correct 6 ms 8028 KB Output is correct
16 Correct 7 ms 8088 KB Output is correct
17 Correct 7 ms 8028 KB Output is correct
18 Correct 6 ms 8028 KB Output is correct
19 Correct 6 ms 8028 KB Output is correct
20 Correct 6 ms 8024 KB Output is correct
21 Correct 6 ms 8008 KB Output is correct
22 Correct 6 ms 8028 KB Output is correct
23 Correct 6 ms 8028 KB Output is correct
24 Correct 6 ms 8020 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8028 KB Output is correct
27 Correct 5 ms 8028 KB Output is correct
28 Correct 5 ms 8092 KB Output is correct
29 Correct 6 ms 7996 KB Output is correct
30 Correct 6 ms 8024 KB Output is correct
31 Correct 6 ms 8024 KB Output is correct
32 Correct 6 ms 8024 KB Output is correct
33 Correct 6 ms 8024 KB Output is correct
34 Correct 6 ms 8028 KB Output is correct
35 Correct 6 ms 8200 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7516 KB Output is correct
2 Correct 6 ms 8016 KB Output is correct
3 Correct 6 ms 7776 KB Output is correct
4 Correct 6 ms 8028 KB Output is correct
5 Correct 356 ms 52260 KB Output is correct
6 Correct 434 ms 45180 KB Output is correct
7 Correct 388 ms 48952 KB Output is correct
8 Correct 323 ms 49816 KB Output is correct
9 Correct 307 ms 48792 KB Output is correct
10 Correct 536 ms 56124 KB Output is correct
11 Correct 499 ms 56208 KB Output is correct
12 Correct 522 ms 56120 KB Output is correct
13 Correct 525 ms 56304 KB Output is correct
14 Correct 511 ms 56124 KB Output is correct
15 Correct 582 ms 60116 KB Output is correct
16 Correct 528 ms 60316 KB Output is correct
17 Correct 575 ms 59948 KB Output is correct
18 Correct 577 ms 61140 KB Output is correct
19 Correct 611 ms 61040 KB Output is correct
20 Correct 643 ms 61464 KB Output is correct
21 Correct 516 ms 61132 KB Output is correct
22 Correct 552 ms 60992 KB Output is correct
23 Correct 510 ms 61084 KB Output is correct
24 Correct 505 ms 60928 KB Output is correct
25 Correct 431 ms 61532 KB Output is correct
26 Correct 456 ms 61524 KB Output is correct
27 Correct 457 ms 61548 KB Output is correct
28 Correct 366 ms 60988 KB Output is correct
29 Correct 361 ms 61240 KB Output is correct
30 Correct 363 ms 61240 KB Output is correct
31 Correct 382 ms 61716 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7512 KB Output is correct
2 Correct 6 ms 8024 KB Output is correct
3 Correct 6 ms 8028 KB Output is correct
4 Correct 6 ms 7896 KB Output is correct
5 Correct 368 ms 54844 KB Output is correct
6 Correct 350 ms 54172 KB Output is correct
7 Correct 445 ms 41928 KB Output is correct
8 Correct 596 ms 60524 KB Output is correct
9 Correct 644 ms 66244 KB Output is correct
10 Correct 566 ms 66108 KB Output is correct
11 Correct 421 ms 66176 KB Output is correct
12 Correct 439 ms 66164 KB Output is correct
13 Correct 395 ms 66100 KB Output is correct
14 Correct 350 ms 65932 KB Output is correct
15 Correct 321 ms 65876 KB Output is correct
16 Correct 372 ms 66076 KB Output is correct
17 Correct 423 ms 66160 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7516 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 1 ms 7516 KB Output is correct
4 Correct 1 ms 7516 KB Output is correct
5 Correct 5 ms 7772 KB Output is correct
6 Correct 6 ms 7772 KB Output is correct
7 Correct 5 ms 7928 KB Output is correct
8 Correct 6 ms 7772 KB Output is correct
9 Correct 6 ms 8012 KB Output is correct
10 Correct 6 ms 8028 KB Output is correct
11 Correct 6 ms 7772 KB Output is correct
12 Correct 6 ms 8024 KB Output is correct
13 Correct 7 ms 8028 KB Output is correct
14 Correct 7 ms 8028 KB Output is correct
15 Correct 6 ms 8028 KB Output is correct
16 Correct 7 ms 8088 KB Output is correct
17 Correct 7 ms 8028 KB Output is correct
18 Correct 6 ms 8028 KB Output is correct
19 Correct 6 ms 8028 KB Output is correct
20 Correct 6 ms 8024 KB Output is correct
21 Correct 6 ms 8008 KB Output is correct
22 Correct 6 ms 8028 KB Output is correct
23 Correct 6 ms 8028 KB Output is correct
24 Correct 6 ms 8020 KB Output is correct
25 Correct 5 ms 8280 KB Output is correct
26 Correct 5 ms 8028 KB Output is correct
27 Correct 5 ms 8028 KB Output is correct
28 Correct 5 ms 8092 KB Output is correct
29 Correct 6 ms 7996 KB Output is correct
30 Correct 6 ms 8024 KB Output is correct
31 Correct 6 ms 8024 KB Output is correct
32 Correct 6 ms 8024 KB Output is correct
33 Correct 6 ms 8024 KB Output is correct
34 Correct 6 ms 8028 KB Output is correct
35 Correct 6 ms 8200 KB Output is correct
36 Correct 1 ms 7516 KB Output is correct
37 Correct 6 ms 8016 KB Output is correct
38 Correct 6 ms 7776 KB Output is correct
39 Correct 6 ms 8028 KB Output is correct
40 Correct 356 ms 52260 KB Output is correct
41 Correct 434 ms 45180 KB Output is correct
42 Correct 388 ms 48952 KB Output is correct
43 Correct 323 ms 49816 KB Output is correct
44 Correct 307 ms 48792 KB Output is correct
45 Correct 536 ms 56124 KB Output is correct
46 Correct 499 ms 56208 KB Output is correct
47 Correct 522 ms 56120 KB Output is correct
48 Correct 525 ms 56304 KB Output is correct
49 Correct 511 ms 56124 KB Output is correct
50 Correct 582 ms 60116 KB Output is correct
51 Correct 528 ms 60316 KB Output is correct
52 Correct 575 ms 59948 KB Output is correct
53 Correct 577 ms 61140 KB Output is correct
54 Correct 611 ms 61040 KB Output is correct
55 Correct 643 ms 61464 KB Output is correct
56 Correct 516 ms 61132 KB Output is correct
57 Correct 552 ms 60992 KB Output is correct
58 Correct 510 ms 61084 KB Output is correct
59 Correct 505 ms 60928 KB Output is correct
60 Correct 431 ms 61532 KB Output is correct
61 Correct 456 ms 61524 KB Output is correct
62 Correct 457 ms 61548 KB Output is correct
63 Correct 366 ms 60988 KB Output is correct
64 Correct 361 ms 61240 KB Output is correct
65 Correct 363 ms 61240 KB Output is correct
66 Correct 382 ms 61716 KB Output is correct
67 Correct 1 ms 7512 KB Output is correct
68 Correct 6 ms 8024 KB Output is correct
69 Correct 6 ms 8028 KB Output is correct
70 Correct 6 ms 7896 KB Output is correct
71 Correct 368 ms 54844 KB Output is correct
72 Correct 350 ms 54172 KB Output is correct
73 Correct 445 ms 41928 KB Output is correct
74 Correct 596 ms 60524 KB Output is correct
75 Correct 644 ms 66244 KB Output is correct
76 Correct 566 ms 66108 KB Output is correct
77 Correct 421 ms 66176 KB Output is correct
78 Correct 439 ms 66164 KB Output is correct
79 Correct 395 ms 66100 KB Output is correct
80 Correct 350 ms 65932 KB Output is correct
81 Correct 321 ms 65876 KB Output is correct
82 Correct 372 ms 66076 KB Output is correct
83 Correct 423 ms 66160 KB Output is correct
84 Correct 377 ms 54128 KB Output is correct
85 Correct 342 ms 42456 KB Output is correct
86 Correct 300 ms 41084 KB Output is correct
87 Correct 554 ms 61248 KB Output is correct
88 Correct 542 ms 61332 KB Output is correct
89 Correct 531 ms 61192 KB Output is correct
90 Correct 530 ms 61244 KB Output is correct
91 Correct 553 ms 61248 KB Output is correct
92 Correct 599 ms 64432 KB Output is correct
93 Correct 555 ms 65660 KB Output is correct
94 Correct 587 ms 61044 KB Output is correct
95 Correct 587 ms 60988 KB Output is correct
96 Correct 611 ms 61140 KB Output is correct
97 Correct 592 ms 61368 KB Output is correct
98 Correct 540 ms 60996 KB Output is correct
99 Correct 569 ms 60904 KB Output is correct
100 Correct 597 ms 61016 KB Output is correct
101 Correct 602 ms 60916 KB Output is correct
102 Correct 580 ms 61604 KB Output is correct
103 Correct 577 ms 61616 KB Output is correct
104 Correct 462 ms 61784 KB Output is correct
105 Correct 375 ms 61240 KB Output is correct
106 Correct 413 ms 61240 KB Output is correct
107 Correct 381 ms 61224 KB Output is correct
108 Correct 360 ms 61244 KB Output is correct