oj.uz

Submission #852692

# Submission time Handle Problem Language Result Execution time Memory
852692 2023-09-22T14:07:09 Z willychan Two Currencies (JOI23_currencies) C++14
100 / 100
 823 ms 31828 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds

int n,m,q;
struct Query{
	int a,b;
	ll x,y;
	int ans;
};
struct request{
	int node;
	ll v;
};
const int N = 1e5+5;

vector<int> side[N];
vector<request> Req;
vector<Query> Que;
// tree stuff
pair<int,int> dep[N];
int father[N][20];
int t;
void dfs(int cur){
	dep[cur].first=++t;
	for(auto i : side[cur]){
		if(!dep[i].first){
			father[i][0] = cur;
			dfs(i);
		}
	}
	dep[cur].second=++t;
}

bool is_father_of(int a,int b){
	return (dep[b].first>=dep[a].first && dep[b].second<=dep[a].second);
}

int lca(int a,int b){
	if(is_father_of(a,b)) return a;
	if(is_father_of(b,a)) return b;
	for(int j=19;j>=0;j--){
		if(!is_father_of(father[b][j],a)) b = father[b][j];
	}
	return father[b][0];
}

//------------------------

//bit stuff
vector<ll> vsum;
vector<ll> cnt;


void add(ll v,int ind,vector<ll> &bit){
	while(ind<=2*n){
		bit[ind]+=v;
		ind+=(ind&-ind);
	}
}
ll query(int ind,vector<ll> &bit){
	ll result = 0;
	while(ind){
		result+=bit[ind];
		ind-=(ind&-ind);
	}
	return result;
}
//--------------------


// total binary search stuff
void do_thing(int l,int r,int mi){
	for(int i=l;i<r;i++){
		if(i<0) continue;
		add(mi*Req[i].v,dep[Req[i].node].first,vsum);
		add(-1*mi*Req[i].v,dep[Req[i].node].second,vsum);
		add(mi,dep[Req[i].node].first,cnt);
		add(-1*mi,dep[Req[i].node].second,cnt);
	}
}

void split(vector<int> &qry,vector<int> &lft,vector<int> &rgt,int k){
	for(auto i : qry){
		long long sum = 0;
		sum+=query(dep[Que[i].a].first,vsum);
		sum+=query(dep[Que[i].b].first,vsum);
		sum-=2*query(dep[lca(Que[i].a,Que[i].b)].first,vsum);
	//	cout<<i<<" "<<sum<<" "<<Que[i].y<<" "<<k<<" -split"<<(sum>Que[i].y)<<"\n";
		if(sum>Que[i].y) lft.push_back(i);
		else rgt.push_back(i);
	}
	vector<int>().swap(qry);
}

void total_BS(int l,int r,vector<int> &qry){
	if(r-l<=1){
		for(auto i : qry) Que[i].ans=l;
		return;
	}
	int mid = (l+r)/2;
	do_thing(l,mid,1);
	vector<int> lft,rgt;	
	split(qry,lft,rgt,mid);
	total_BS(mid,r,rgt);
	do_thing(l,mid,-1);
	total_BS(l,mid,lft);
}

//-----------------------------------



int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	Que.resize(q);
	vsum.resize(2*n+1,0);
	cnt.resize(2*n+1,0);
	vector<pair<int,int> > es;
	for(int i=0;i<n-1;i++){
			int a,b;cin>>a>>b;	
			es.push_back({a,b});
			side[a].push_back(b);
			side[b].push_back(a);
	}
	for(int i=0;i<20;i++){
		father[1][i]=1;
	}
	dfs(1);
	for(int j=1;j<20;j++){
		for(int i=2;i<=n;i++){
			father[i][j] = father[father[i][j-1]][j-1];
		}
	}
	for(int i=0;i<m;i++){
		 int p;cin>>p;
		 p--;
		 int c;cin>>c;
		 if(dep[es[p].first]<dep[es[p].second]) swap(es[p].first,es[p].second);
		 Req.push_back({es[p].first,c});
	}
	sort(Req.begin(),Req.end(),[](const request &a,const request &b){return a.v<b.v;});
	/*
	cout<<endl;
	for(auto i : Req){
		cout<<i.node<<" "<<i.v<<endl;
	}
	cout<<endl;
	*/
	vector<int> tmp;		
	for(int i=0;i<q;i++){
		cin>>Que[i].a>>Que[i].b>>Que[i].x>>Que[i].y;
		tmp.push_back(i);
	}
	total_BS(0,m+1,tmp);
	int ttt = 0;	
	vector<int> anssort;
	for(int i=0;i<q;i++){
		anssort.push_back(i);
	}

	/*cout<<"\n";
	for(int i=0;i<q;i++){
		cout<<Que[i].ans<<"\n";
	}
	cout<<"\n\n\n-----\n";
	*/

	sort(anssort.begin(),anssort.end(),[&](const int a,const int b){return Que[a].ans<Que[b].ans;});
	vector<ll> realans(q,0);
	for(int i=0;i<q;i++){
		do_thing(ttt,Que[anssort[i]].ans,1);
		ttt = Que[anssort[i]].ans;
		realans[anssort[i]]+=Que[anssort[i]].x;
		realans[anssort[i]]+=query(dep[Que[anssort[i]].a].first,cnt);
		realans[anssort[i]]+=query(dep[Que[anssort[i]].b].first,cnt);
		realans[anssort[i]]-=2*query(dep[lca(Que[anssort[i]].a,Que[anssort[i]].b)].first,cnt);
	}
//	cout<<ttt<<endl;
	do_thing(ttt,m,1);
	for(int i=0;i<q;i++){
		realans[i]-=query(dep[Que[i].a].first,cnt);
		realans[i]-=query(dep[Que[i].b].first,cnt);
		realans[i]+=2*query(dep[lca(Que[i].a,Que[i].b)].first,cnt);
	}
	for(int i=0;i<q;i++){
		cout<<max(-1LL,realans[i])<<"\n";
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 6 ms 5464 KB Output is correct
6 Correct 8 ms 5464 KB Output is correct
7 Correct 7 ms 5208 KB Output is correct
8 Correct 8 ms 5464 KB Output is correct
9 Correct 8 ms 5464 KB Output is correct
10 Correct 9 ms 5532 KB Output is correct
11 Correct 8 ms 5296 KB Output is correct
12 Correct 8 ms 5468 KB Output is correct
13 Correct 6 ms 5464 KB Output is correct
14 Correct 7 ms 5464 KB Output is correct
15 Correct 7 ms 5464 KB Output is correct
16 Correct 8 ms 5464 KB Output is correct
17 Correct 8 ms 5464 KB Output is correct
18 Correct 8 ms 5464 KB Output is correct
19 Correct 7 ms 5468 KB Output is correct
20 Correct 7 ms 5468 KB Output is correct
21 Correct 7 ms 5464 KB Output is correct
22 Correct 7 ms 5464 KB Output is correct
23 Correct 7 ms 5468 KB Output is correct
24 Correct 8 ms 5464 KB Output is correct
25 Correct 7 ms 5468 KB Output is correct
26 Correct 7 ms 5464 KB Output is correct
27 Correct 6 ms 5464 KB Output is correct
28 Correct 7 ms 5464 KB Output is correct
29 Correct 7 ms 5464 KB Output is correct
30 Correct 8 ms 5464 KB Output is correct
31 Correct 8 ms 5464 KB Output is correct
32 Correct 10 ms 5464 KB Output is correct
33 Correct 5 ms 5464 KB Output is correct
34 Correct 5 ms 5464 KB Output is correct
35 Correct 5 ms 5468 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 9 ms 5532 KB Output is correct
3 Correct 9 ms 5468 KB Output is correct
4 Correct 8 ms 5784 KB Output is correct
5 Correct 432 ms 23164 KB Output is correct
6 Correct 560 ms 22848 KB Output is correct
7 Correct 513 ms 23356 KB Output is correct
8 Correct 399 ms 22424 KB Output is correct
9 Correct 403 ms 21884 KB Output is correct
10 Correct 640 ms 24544 KB Output is correct
11 Correct 624 ms 25424 KB Output is correct
12 Correct 618 ms 24752 KB Output is correct
13 Correct 646 ms 25088 KB Output is correct
14 Correct 619 ms 25732 KB Output is correct
15 Correct 481 ms 31104 KB Output is correct
16 Correct 433 ms 31020 KB Output is correct
17 Correct 518 ms 30796 KB Output is correct
18 Correct 776 ms 25052 KB Output is correct
19 Correct 823 ms 25396 KB Output is correct
20 Correct 800 ms 25408 KB Output is correct
21 Correct 531 ms 25672 KB Output is correct
22 Correct 580 ms 25372 KB Output is correct
23 Correct 772 ms 25412 KB Output is correct
24 Correct 544 ms 25596 KB Output is correct
25 Correct 575 ms 24936 KB Output is correct
26 Correct 548 ms 25236 KB Output is correct
27 Correct 551 ms 25380 KB Output is correct
28 Correct 448 ms 25304 KB Output is correct
29 Correct 430 ms 25152 KB Output is correct
30 Correct 471 ms 25716 KB Output is correct
31 Correct 478 ms 25544 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 5 ms 5464 KB Output is correct
3 Correct 5 ms 5464 KB Output is correct
4 Correct 5 ms 5464 KB Output is correct
5 Correct 259 ms 28844 KB Output is correct
6 Correct 228 ms 28396 KB Output is correct
7 Correct 349 ms 22968 KB Output is correct
8 Correct 392 ms 31692 KB Output is correct
9 Correct 394 ms 31552 KB Output is correct
10 Correct 409 ms 31812 KB Output is correct
11 Correct 380 ms 31156 KB Output is correct
12 Correct 358 ms 31552 KB Output is correct
13 Correct 330 ms 31556 KB Output is correct
14 Correct 324 ms 31828 KB Output is correct
15 Correct 310 ms 31808 KB Output is correct
16 Correct 342 ms 31812 KB Output is correct
17 Correct 335 ms 31676 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 6 ms 5464 KB Output is correct
6 Correct 8 ms 5464 KB Output is correct
7 Correct 7 ms 5208 KB Output is correct
8 Correct 8 ms 5464 KB Output is correct
9 Correct 8 ms 5464 KB Output is correct
10 Correct 9 ms 5532 KB Output is correct
11 Correct 8 ms 5296 KB Output is correct
12 Correct 8 ms 5468 KB Output is correct
13 Correct 6 ms 5464 KB Output is correct
14 Correct 7 ms 5464 KB Output is correct
15 Correct 7 ms 5464 KB Output is correct
16 Correct 8 ms 5464 KB Output is correct
17 Correct 8 ms 5464 KB Output is correct
18 Correct 8 ms 5464 KB Output is correct
19 Correct 7 ms 5468 KB Output is correct
20 Correct 7 ms 5468 KB Output is correct
21 Correct 7 ms 5464 KB Output is correct
22 Correct 7 ms 5464 KB Output is correct
23 Correct 7 ms 5468 KB Output is correct
24 Correct 8 ms 5464 KB Output is correct
25 Correct 7 ms 5468 KB Output is correct
26 Correct 7 ms 5464 KB Output is correct
27 Correct 6 ms 5464 KB Output is correct
28 Correct 7 ms 5464 KB Output is correct
29 Correct 7 ms 5464 KB Output is correct
30 Correct 8 ms 5464 KB Output is correct
31 Correct 8 ms 5464 KB Output is correct
32 Correct 10 ms 5464 KB Output is correct
33 Correct 5 ms 5464 KB Output is correct
34 Correct 5 ms 5464 KB Output is correct
35 Correct 5 ms 5468 KB Output is correct
36 Correct 1 ms 4952 KB Output is correct
37 Correct 9 ms 5532 KB Output is correct
38 Correct 9 ms 5468 KB Output is correct
39 Correct 8 ms 5784 KB Output is correct
40 Correct 432 ms 23164 KB Output is correct
41 Correct 560 ms 22848 KB Output is correct
42 Correct 513 ms 23356 KB Output is correct
43 Correct 399 ms 22424 KB Output is correct
44 Correct 403 ms 21884 KB Output is correct
45 Correct 640 ms 24544 KB Output is correct
46 Correct 624 ms 25424 KB Output is correct
47 Correct 618 ms 24752 KB Output is correct
48 Correct 646 ms 25088 KB Output is correct
49 Correct 619 ms 25732 KB Output is correct
50 Correct 481 ms 31104 KB Output is correct
51 Correct 433 ms 31020 KB Output is correct
52 Correct 518 ms 30796 KB Output is correct
53 Correct 776 ms 25052 KB Output is correct
54 Correct 823 ms 25396 KB Output is correct
55 Correct 800 ms 25408 KB Output is correct
56 Correct 531 ms 25672 KB Output is correct
57 Correct 580 ms 25372 KB Output is correct
58 Correct 772 ms 25412 KB Output is correct
59 Correct 544 ms 25596 KB Output is correct
60 Correct 575 ms 24936 KB Output is correct
61 Correct 548 ms 25236 KB Output is correct
62 Correct 551 ms 25380 KB Output is correct
63 Correct 448 ms 25304 KB Output is correct
64 Correct 430 ms 25152 KB Output is correct
65 Correct 471 ms 25716 KB Output is correct
66 Correct 478 ms 25544 KB Output is correct
67 Correct 1 ms 4952 KB Output is correct
68 Correct 5 ms 5464 KB Output is correct
69 Correct 5 ms 5464 KB Output is correct
70 Correct 5 ms 5464 KB Output is correct
71 Correct 259 ms 28844 KB Output is correct
72 Correct 228 ms 28396 KB Output is correct
73 Correct 349 ms 22968 KB Output is correct
74 Correct 392 ms 31692 KB Output is correct
75 Correct 394 ms 31552 KB Output is correct
76 Correct 409 ms 31812 KB Output is correct
77 Correct 380 ms 31156 KB Output is correct
78 Correct 358 ms 31552 KB Output is correct
79 Correct 330 ms 31556 KB Output is correct
80 Correct 324 ms 31828 KB Output is correct
81 Correct 310 ms 31808 KB Output is correct
82 Correct 342 ms 31812 KB Output is correct
83 Correct 335 ms 31676 KB Output is correct
84 Correct 477 ms 22336 KB Output is correct
85 Correct 439 ms 18756 KB Output is correct
86 Correct 435 ms 18240 KB Output is correct
87 Correct 636 ms 25196 KB Output is correct
88 Correct 630 ms 25476 KB Output is correct
89 Correct 597 ms 25148 KB Output is correct
90 Correct 632 ms 25424 KB Output is correct
91 Correct 631 ms 25484 KB Output is correct
92 Correct 624 ms 29496 KB Output is correct
93 Correct 543 ms 30480 KB Output is correct
94 Correct 782 ms 25324 KB Output is correct
95 Correct 778 ms 25460 KB Output is correct
96 Correct 777 ms 25648 KB Output is correct
97 Correct 747 ms 25428 KB Output is correct
98 Correct 518 ms 25524 KB Output is correct
99 Correct 552 ms 25476 KB Output is correct
100 Correct 591 ms 25512 KB Output is correct
101 Correct 558 ms 25600 KB Output is correct
102 Correct 594 ms 25428 KB Output is correct
103 Correct 635 ms 25280 KB Output is correct
104 Correct 554 ms 25468 KB Output is correct
105 Correct 480 ms 25404 KB Output is correct
106 Correct 439 ms 25124 KB Output is correct
107 Correct 490 ms 25280 KB Output is correct
108 Correct 491 ms 25220 KB Output is correct