oj.uz

Submission #961366

# Submission time Handle Problem Language Result Execution time Memory
961366 2024-04-11T22:47:16 Z MarwenElarbi Two Currencies (JOI23_currencies) C++17
100 / 100
 4683 ms 207096 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,int>pii;
typedef pair<pii,pii>pi2;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
vector<int>adj[100005];
int in[100005];
int out[100005];
int d[100005];
int two[25][100005];
int ptr=0;
int h[100005];
 
void dfs(int index, int par){
	in[index]=++ptr;
	for(int x=0;x<20;x++){
		two[x+1][index]=two[x][two[x][index]];
	}
	for(auto it:adj[index]){
		if(it==par) continue;
		two[0][it]=index;
		d[it]=d[index]+1;
		//h[it]+=h[index];
		dfs(it,index);
	}
	out[index]=++ptr;
}
 
void dfs2(int index, int par){
	for(auto it:adj[index]){
		if(it==par) continue;
		h[it]+=h[index];
		dfs2(it,index);
	}
}
 
int lca(int a, int b){
	if(d[a]>d[b]) swap(a,b);
	int diff=d[b]-d[a];
	for(int x=0;x<19;x++){
		if(diff&(1<<x)){
			b=two[x][b];
		}
	}
	if(a==b) return a;
	for(int x=19;x>=0;x--){
		if(two[x][a]!=two[x][b]){
			a=two[x][a];
			b=two[x][b];
		}
	}
	return two[0][a];
} 
 
int fw[200005];
int fw2[200005];
 
void upd(int x, int y, int z){
	while(x<200005){
		fw[x]+=y;
		fw2[x]+=z;
		x+=x&(-x);
	}
}
 
pii sum(int x){
	int counter=0;
	int counter2=0;
	while(x>0){
		counter+=fw[x];
		counter2+=fw2[x];
		x-=x&(-x);
	}
	return {counter,counter2};
}
 
void solve(){
	int n,m,q;
	cin >> n >> m >> q;
	
	int temp,temp2;
	pii edge[n-1];
	for(int x=0;x<n-1;x++){
		cin >> temp >> temp2;
		adj[temp].push_back(temp2);
		adj[temp2].push_back(temp);
		edge[x]={temp,temp2};
	}
	
	dfs(1,-1);
	
	
	pii check[m+1]; //cost edge
	for(int x=1;x<=m;x++){
		cin >> check[x].second >> check[x].first;
		int index;
		int road=check[x].second-1;
		if(d[edge[road].first] > d[edge[road].second]){
			index=edge[road].first;
		}
		else index=edge[road].second;
		h[index]++;
		//show(index,index);
	}
	
	dfs2(1,-1);
	//for(int x=1;x<=n;x++){
		//show2(x,x,h[x],h[x]);
	//}
	
	sort(check+1,check+m+1);
	
	vector<array<int,5>>storage[m+1];
	vector<array<int,5>>storage2[m+1];
	
	
	int l[q];
	int r[q];
	int ans[q];
	for(int x=0;x<q;x++){
		int from,to,a,b;
		cin >> from >> to >> a >> b;
		array<int,5>take;
		take={from,to,a,b,x};
		storage[m/2].push_back(take);
		l[x]=0;
		r[x]=m;
		ans[x]=-1;
	}
	
	for(int k=0;k<21;k++){
		memset(fw,0,sizeof(fw));
		memset(fw2,0,sizeof(fw2));
		
		for(int x=0;x<=m;x++){
			if(x>0){
				int road=check[x].second-1;
				int index;
				if(d[edge[road].first] > d[edge[road].second]){
					index=edge[road].first;
				}
				else index=edge[road].second;
				
				upd(in[index],check[x].first,1);
				upd(out[index],-check[x].first,-1);
			}
			
			for(auto it:storage[x]){
				int from=it[0];
				int to=it[1];
				int a=it[2];
				int b=it[3];
				int id=it[4];
				
				int ant=lca(from,to);
				
				pii aa=sum(in[from]);
				pii bb=sum(in[to]);
				pii cc=sum(in[ant]);
				
				int val=aa.first + bb.first - 2*cc.first;
				if(val<=b){
					l[id]=x+1;
					int val2 = aa.second + bb.second - 2*cc.second;
					
					int len=h[from]+h[to]-h[ant]*2-val2;
					if(a-len>=0){
						ans[id]=max(ans[id],a-len);
					}
				}
				else{
					r[id]=x-1;
				}
				if(l[id]<=r[id]){
					storage2[(l[id]+r[id])/2].push_back(it);
				}
			}
		}
		
		for(int x=0;x<=m;x++){
			storage[x].clear();
			while(!storage2[x].empty()){
				storage[x].push_back(storage2[x].back());
				storage2[x].pop_back();
			}
		}
	}	
	
	for(int x=0;x<q;x++) cout << ans[x] << "\n";
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//freopen("in.txt","w",stdout);
	//cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 23388 KB Output is correct
2 Correct 7 ms 23292 KB Output is correct
3 Correct 5 ms 23308 KB Output is correct
4 Correct 5 ms 23412 KB Output is correct
5 Correct 14 ms 24996 KB Output is correct
6 Correct 17 ms 25616 KB Output is correct
7 Correct 13 ms 25436 KB Output is correct
8 Correct 20 ms 26052 KB Output is correct
9 Correct 18 ms 26024 KB Output is correct
10 Correct 16 ms 25944 KB Output is correct
11 Correct 17 ms 25864 KB Output is correct
12 Correct 16 ms 26044 KB Output is correct
13 Correct 17 ms 25948 KB Output is correct
14 Correct 16 ms 25736 KB Output is correct
15 Correct 15 ms 25860 KB Output is correct
16 Correct 19 ms 26200 KB Output is correct
17 Correct 16 ms 25956 KB Output is correct
18 Correct 16 ms 25956 KB Output is correct
19 Correct 16 ms 25796 KB Output is correct
20 Correct 15 ms 25952 KB Output is correct
21 Correct 16 ms 25768 KB Output is correct
22 Correct 15 ms 25952 KB Output is correct
23 Correct 14 ms 25948 KB Output is correct
24 Correct 16 ms 25880 KB Output is correct
25 Correct 16 ms 25956 KB Output is correct
26 Correct 12 ms 25696 KB Output is correct
27 Correct 12 ms 25692 KB Output is correct
28 Correct 13 ms 25880 KB Output is correct
29 Correct 13 ms 25524 KB Output is correct
30 Correct 16 ms 25808 KB Output is correct
31 Correct 16 ms 25944 KB Output is correct
32 Correct 16 ms 25908 KB Output is correct
33 Correct 13 ms 25948 KB Output is correct
34 Correct 17 ms 25692 KB Output is correct
35 Correct 17 ms 25692 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23404 KB Output is correct
2 Correct 16 ms 25948 KB Output is correct
3 Correct 19 ms 25936 KB Output is correct
4 Correct 16 ms 25948 KB Output is correct
5 Correct 2502 ms 136972 KB Output is correct
6 Correct 3180 ms 207096 KB Output is correct
7 Correct 3096 ms 188080 KB Output is correct
8 Correct 2465 ms 142040 KB Output is correct
9 Correct 2233 ms 133328 KB Output is correct
10 Correct 3862 ms 198376 KB Output is correct
11 Correct 3918 ms 198604 KB Output is correct
12 Correct 3955 ms 197500 KB Output is correct
13 Correct 3953 ms 200184 KB Output is correct
14 Correct 3997 ms 196624 KB Output is correct
15 Correct 2291 ms 199372 KB Output is correct
16 Correct 2032 ms 199776 KB Output is correct
17 Correct 2498 ms 198920 KB Output is correct
18 Correct 4001 ms 201292 KB Output is correct
19 Correct 3902 ms 200636 KB Output is correct
20 Correct 3806 ms 201884 KB Output is correct
21 Correct 4022 ms 204260 KB Output is correct
22 Correct 3930 ms 204360 KB Output is correct
23 Correct 3728 ms 206316 KB Output is correct
24 Correct 4057 ms 205992 KB Output is correct
25 Correct 2367 ms 196292 KB Output is correct
26 Correct 2733 ms 195628 KB Output is correct
27 Correct 1245 ms 198792 KB Output is correct
28 Correct 610 ms 203256 KB Output is correct
29 Correct 582 ms 191924 KB Output is correct
30 Correct 1080 ms 186152 KB Output is correct
31 Correct 1113 ms 183216 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23384 KB Output is correct
2 Correct 14 ms 25780 KB Output is correct
3 Correct 14 ms 25692 KB Output is correct
4 Correct 14 ms 25692 KB Output is correct
5 Correct 1074 ms 138144 KB Output is correct
6 Correct 1065 ms 142852 KB Output is correct
7 Correct 906 ms 173492 KB Output is correct
8 Correct 1899 ms 199732 KB Output is correct
9 Correct 1917 ms 199232 KB Output is correct
10 Correct 1913 ms 199572 KB Output is correct
11 Correct 935 ms 199692 KB Output is correct
12 Correct 947 ms 199908 KB Output is correct
13 Correct 959 ms 199496 KB Output is correct
14 Correct 683 ms 201916 KB Output is correct
15 Correct 676 ms 203172 KB Output is correct
16 Correct 912 ms 201304 KB Output is correct
17 Correct 908 ms 201536 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 23388 KB Output is correct
2 Correct 7 ms 23292 KB Output is correct
3 Correct 5 ms 23308 KB Output is correct
4 Correct 5 ms 23412 KB Output is correct
5 Correct 14 ms 24996 KB Output is correct
6 Correct 17 ms 25616 KB Output is correct
7 Correct 13 ms 25436 KB Output is correct
8 Correct 20 ms 26052 KB Output is correct
9 Correct 18 ms 26024 KB Output is correct
10 Correct 16 ms 25944 KB Output is correct
11 Correct 17 ms 25864 KB Output is correct
12 Correct 16 ms 26044 KB Output is correct
13 Correct 17 ms 25948 KB Output is correct
14 Correct 16 ms 25736 KB Output is correct
15 Correct 15 ms 25860 KB Output is correct
16 Correct 19 ms 26200 KB Output is correct
17 Correct 16 ms 25956 KB Output is correct
18 Correct 16 ms 25956 KB Output is correct
19 Correct 16 ms 25796 KB Output is correct
20 Correct 15 ms 25952 KB Output is correct
21 Correct 16 ms 25768 KB Output is correct
22 Correct 15 ms 25952 KB Output is correct
23 Correct 14 ms 25948 KB Output is correct
24 Correct 16 ms 25880 KB Output is correct
25 Correct 16 ms 25956 KB Output is correct
26 Correct 12 ms 25696 KB Output is correct
27 Correct 12 ms 25692 KB Output is correct
28 Correct 13 ms 25880 KB Output is correct
29 Correct 13 ms 25524 KB Output is correct
30 Correct 16 ms 25808 KB Output is correct
31 Correct 16 ms 25944 KB Output is correct
32 Correct 16 ms 25908 KB Output is correct
33 Correct 13 ms 25948 KB Output is correct
34 Correct 17 ms 25692 KB Output is correct
35 Correct 17 ms 25692 KB Output is correct
36 Correct 6 ms 23404 KB Output is correct
37 Correct 16 ms 25948 KB Output is correct
38 Correct 19 ms 25936 KB Output is correct
39 Correct 16 ms 25948 KB Output is correct
40 Correct 2502 ms 136972 KB Output is correct
41 Correct 3180 ms 207096 KB Output is correct
42 Correct 3096 ms 188080 KB Output is correct
43 Correct 2465 ms 142040 KB Output is correct
44 Correct 2233 ms 133328 KB Output is correct
45 Correct 3862 ms 198376 KB Output is correct
46 Correct 3918 ms 198604 KB Output is correct
47 Correct 3955 ms 197500 KB Output is correct
48 Correct 3953 ms 200184 KB Output is correct
49 Correct 3997 ms 196624 KB Output is correct
50 Correct 2291 ms 199372 KB Output is correct
51 Correct 2032 ms 199776 KB Output is correct
52 Correct 2498 ms 198920 KB Output is correct
53 Correct 4001 ms 201292 KB Output is correct
54 Correct 3902 ms 200636 KB Output is correct
55 Correct 3806 ms 201884 KB Output is correct
56 Correct 4022 ms 204260 KB Output is correct
57 Correct 3930 ms 204360 KB Output is correct
58 Correct 3728 ms 206316 KB Output is correct
59 Correct 4057 ms 205992 KB Output is correct
60 Correct 2367 ms 196292 KB Output is correct
61 Correct 2733 ms 195628 KB Output is correct
62 Correct 1245 ms 198792 KB Output is correct
63 Correct 610 ms 203256 KB Output is correct
64 Correct 582 ms 191924 KB Output is correct
65 Correct 1080 ms 186152 KB Output is correct
66 Correct 1113 ms 183216 KB Output is correct
67 Correct 5 ms 23384 KB Output is correct
68 Correct 14 ms 25780 KB Output is correct
69 Correct 14 ms 25692 KB Output is correct
70 Correct 14 ms 25692 KB Output is correct
71 Correct 1074 ms 138144 KB Output is correct
72 Correct 1065 ms 142852 KB Output is correct
73 Correct 906 ms 173492 KB Output is correct
74 Correct 1899 ms 199732 KB Output is correct
75 Correct 1917 ms 199232 KB Output is correct
76 Correct 1913 ms 199572 KB Output is correct
77 Correct 935 ms 199692 KB Output is correct
78 Correct 947 ms 199908 KB Output is correct
79 Correct 959 ms 199496 KB Output is correct
80 Correct 683 ms 201916 KB Output is correct
81 Correct 676 ms 203172 KB Output is correct
82 Correct 912 ms 201304 KB Output is correct
83 Correct 908 ms 201536 KB Output is correct
84 Correct 2519 ms 141972 KB Output is correct
85 Correct 1581 ms 158316 KB Output is correct
86 Correct 1452 ms 155732 KB Output is correct
87 Correct 4310 ms 197652 KB Output is correct
88 Correct 4303 ms 198240 KB Output is correct
89 Correct 4303 ms 198272 KB Output is correct
90 Correct 4347 ms 200168 KB Output is correct
91 Correct 4135 ms 197756 KB Output is correct
92 Correct 3090 ms 199632 KB Output is correct
93 Correct 2671 ms 199104 KB Output is correct
94 Correct 4220 ms 201896 KB Output is correct
95 Correct 4265 ms 200928 KB Output is correct
96 Correct 4336 ms 201680 KB Output is correct
97 Correct 4301 ms 201916 KB Output is correct
98 Correct 4683 ms 203124 KB Output is correct
99 Correct 4549 ms 202404 KB Output is correct
100 Correct 4422 ms 204356 KB Output is correct
101 Correct 4525 ms 203804 KB Output is correct
102 Correct 2463 ms 198196 KB Output is correct
103 Correct 2701 ms 198724 KB Output is correct
104 Correct 3027 ms 199436 KB Output is correct
105 Correct 809 ms 187280 KB Output is correct
106 Correct 735 ms 187000 KB Output is correct
107 Correct 1319 ms 181148 KB Output is correct
108 Correct 1232 ms 181448 KB Output is correct