oj.uz

Submission #829629

# Submission time Handle Problem Language Result Execution time Memory
829629 2023-08-18T13:35:10 Z CSQ31 Two Currencies (JOI23_currencies) C++17
40 / 100
 2053 ms 357560 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXNODE = 1e7+5;
int lf[MAXNODE],rg[MAXNODE],cnt[MAXNODE],ndcnt = 0;
ll sum[MAXNODE];
int new_node(){
	ndcnt++;
	return ndcnt;
}
int new_node(int v){
	ndcnt++;
	sum[ndcnt] = sum[v];
	cnt[ndcnt] = cnt[v];
	lf[ndcnt] = lf[v];
	rg[ndcnt] = rg[v];	
	return ndcnt;
}
//get the double euler tour array
//set cost(i) at tin(i) and -cost(i) at tout(i)
int upd(int v,int pos,int l,int r,ll val){
	int u = new_node(v);
	if(l==r){
		sum[u]+=val;
		if(val>0)cnt[u]++;
		if(val<0)cnt[u]--;
		return u;
	}
	int tm = (l+r)/2;
	if(pos<=tm){
		if(!lf[v])lf[v] = new_node();
		lf[u] = upd(lf[v],pos,l,tm,val);
	}else{
		if(!rg[v])rg[v] = new_node();
		rg[u] = upd(rg[v],pos,tm+1,r,val);
	}
	
	sum[u] = cnt[u] = 0;
	if(lf[u]){
		sum[u]+=sum[lf[u]];
		cnt[u]+=cnt[lf[u]];
	}
	if(rg[u]){
		sum[u]+=sum[rg[u]];
		cnt[u]+=cnt[rg[u]];
	}
	return u;
}
ll query(int v,int l,int r,int tl,int tr){
	if(l==tl && r==tr)return sum[v];
	int tm = (tl+tr)/2;
	
	if(!lf[v])lf[v] = new_node();
	if(!rg[v])rg[v] = new_node();
	
	if(r<=tm)return query(lf[v],l,r,tl,tm);
	else if(l>tm)return query(rg[v],l,r,tm+1,tr);
	else{
		return query(lf[v],l,tm,tl,tm)+query(rg[v],tm+1,r,tm+1,tr);
	}
	
}
ll query2(int v,int l,int r,int tl,int tr){
	if(l==tl && r==tr)return cnt[v];
	int tm = (tl+tr)/2;
	
	if(!lf[v])lf[v] = new_node();
	if(!rg[v])rg[v] = new_node();
	
	if(r<=tm)return query2(lf[v],l,r,tl,tm);
	else if(l>tm)return query2(rg[v],l,r,tm+1,tr);
	else{
		return query2(lf[v],l,tm,tl,tm)+query2(rg[v],tm+1,r,tm+1,tr);
	}
	
}
///////persistent seg
const int MAXN = 5e5+5;
vector<int>adj[MAXN];
int tin[MAXN],tout[MAXN],dep[MAXN],par[19][MAXN],timer = 0;
int cost[MAXN],ett[2*MAXN];
void dfs(int v,int u){
	tin[v] = ++timer;
	ett[tin[v]] = v;
	for(int x:adj[v]){
	    if(x == u)continue;	
	    par[0][x] = v;
	    dep[x] = dep[v]+1;
	    for(int i=1;i<=18;i++){
			par[i][x] = par[i-1][par[i-1][x]];
		}
		dfs(x,v);
	}
	tout[v] = ++timer;
	ett[tout[v]] = -v;
}
bool ancestor(int v,int u){return(tin[v] >= tin[u] && tout[u] >= tout[v]);}//is u an ancestor of v?
int lca(int v,int u){
	if(dep[v] > dep[u])swap(u,v);
	int dist = dep[u]-dep[v];
	for(int i=0;dist;i++,dist>>=1){
		if(dist&1)u = par[i][u];
	}
	if(u == v)return u;
	for(int i=18;i>=0;i--){
		if(par[i][v] != par[i][u]){
			u = par[i][u];
			v = par[i][v];
		}
	}
	return par[0][v];
}
 
int main()
{
	owo
	int n,m,q;
	cin>>n>>m>>q;
	vector<pii>ed(n),C(m);
	for(int i=1;i<n;i++)cin>>ed[i].fi>>ed[i].se;
	for(int i=0;i<m;i++)cin>>C[i].se>>C[i].fi;
	
	vii p(n);
	sort(all(C));
	int N = n;
	for(int i=0;i<m;i++){
		N++; //label this guy as N
		p[C[i].se].pb(N);
		cost[N] = C[i].fi;
	}
	for(int i=1;i<n;i++){
		int a = ed[i].fi;
		int b = ed[i].se;
		for(int x:p[i]){
			adj[a].pb(x);
			adj[x].pb(a);
			a = x;
		}
		adj[a].pb(b);
		adj[b].pb(a);
	}
	dfs(1,-1);
	vector<int>root(2*N+1);
	for(int i=1;i<=2*N;i++){
		root[i] = new_node(root[i-1]);
		
		int v = abs(ett[i]);
		if(v > n){
			if(ett[i]>0)root[i] = upd(root[i],v,1,N,cost[v]);
			else        root[i] = upd(root[i],v,1,N,-cost[v]);
		}
	}
	while(q--){
		int s,t,x;
		ll y;
		cin>>s>>t>>x>>y;
		int v = lca(s,t);
		int l = 1,r = N;
		//cout<<s<<" "<<t<<" "<<v<<'\n';
		while(r>=l){
			int tm = (l+r)/2;
			ll a = query(root[tin[v]],1,tm,1,N);
			ll b = query(root[tin[s]],1,tm,1,N);
			ll c = query(root[tin[t]],1,tm,1,N);
			if(b+c-2*a > y)r = tm-1;
			else l = tm+1;
		}
		int gol = cnt[root[tin[s]]] + cnt[root[tin[t]]] - 2*cnt[root[tin[v]]];
		gol -= query2(root[tin[s]],1,r,1,N) + query2(root[tin[t]],1,r,1,N);
		gol += 2*query2(root[tin[v]],1,r,1,N);
		if(x>=gol)cout<<x-gol<<'\n';
		else cout<<-1<<'\n';
	}
	
	
	
	
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12244 KB Output is correct
2 Correct 6 ms 12244 KB Output is correct
3 Correct 6 ms 12204 KB Output is correct
4 Correct 6 ms 12204 KB Output is correct
5 Correct 13 ms 14164 KB Output is correct
6 Correct 13 ms 14164 KB Output is correct
7 Correct 12 ms 13728 KB Output is correct
8 Correct 13 ms 14292 KB Output is correct
9 Correct 13 ms 14292 KB Output is correct
10 Correct 13 ms 14264 KB Output is correct
11 Correct 13 ms 14340 KB Output is correct
12 Correct 13 ms 14292 KB Output is correct
13 Correct 14 ms 14560 KB Output is correct
14 Correct 20 ms 14564 KB Output is correct
15 Correct 14 ms 14420 KB Output is correct
16 Correct 14 ms 14420 KB Output is correct
17 Correct 13 ms 14396 KB Output is correct
18 Correct 14 ms 14384 KB Output is correct
19 Correct 16 ms 14268 KB Output is correct
20 Correct 13 ms 14292 KB Output is correct
21 Correct 13 ms 14292 KB Output is correct
22 Correct 16 ms 14368 KB Output is correct
23 Correct 17 ms 14312 KB Output is correct
24 Correct 14 ms 14400 KB Output is correct
25 Correct 14 ms 14396 KB Output is correct
26 Correct 12 ms 14276 KB Output is correct
27 Correct 14 ms 14244 KB Output is correct
28 Correct 12 ms 14284 KB Output is correct
29 Correct 11 ms 14292 KB Output is correct
30 Correct 14 ms 14292 KB Output is correct
31 Correct 14 ms 14372 KB Output is correct
32 Correct 14 ms 14356 KB Output is correct
33 Correct 14 ms 14548 KB Output is correct
34 Correct 14 ms 14652 KB Output is correct
35 Correct 17 ms 14644 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12244 KB Output is correct
2 Correct 14 ms 14292 KB Output is correct
3 Correct 14 ms 14268 KB Output is correct
4 Correct 15 ms 14392 KB Output is correct
5 Correct 988 ms 126304 KB Output is correct
6 Correct 1414 ms 113500 KB Output is correct
7 Correct 1402 ms 98612 KB Output is correct
8 Correct 947 ms 97120 KB Output is correct
9 Correct 900 ms 101148 KB Output is correct
10 Correct 1651 ms 138016 KB Output is correct
11 Correct 1614 ms 137952 KB Output is correct
12 Correct 1640 ms 137800 KB Output is correct
13 Correct 1569 ms 137716 KB Output is correct
14 Correct 1576 ms 138088 KB Output is correct
15 Correct 1664 ms 153028 KB Output is correct
16 Correct 1717 ms 153540 KB Output is correct
17 Correct 1787 ms 152772 KB Output is correct
18 Correct 2021 ms 138824 KB Output is correct
19 Correct 1990 ms 138672 KB Output is correct
20 Correct 2053 ms 138824 KB Output is correct
21 Runtime error 961 ms 357560 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12244 KB Output is correct
2 Correct 18 ms 14548 KB Output is correct
3 Correct 16 ms 14568 KB Output is correct
4 Correct 15 ms 14508 KB Output is correct
5 Correct 1010 ms 110620 KB Output is correct
6 Correct 986 ms 96520 KB Output is correct
7 Correct 1336 ms 128688 KB Output is correct
8 Correct 1911 ms 149796 KB Output is correct
9 Correct 1927 ms 149736 KB Output is correct
10 Correct 2025 ms 149908 KB Output is correct
11 Correct 1430 ms 149016 KB Output is correct
12 Correct 1367 ms 149056 KB Output is correct
13 Correct 1458 ms 149032 KB Output is correct
14 Correct 1057 ms 146900 KB Output is correct
15 Correct 986 ms 146084 KB Output is correct
16 Correct 1192 ms 147632 KB Output is correct
17 Correct 1151 ms 147312 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12244 KB Output is correct
2 Correct 6 ms 12244 KB Output is correct
3 Correct 6 ms 12204 KB Output is correct
4 Correct 6 ms 12204 KB Output is correct
5 Correct 13 ms 14164 KB Output is correct
6 Correct 13 ms 14164 KB Output is correct
7 Correct 12 ms 13728 KB Output is correct
8 Correct 13 ms 14292 KB Output is correct
9 Correct 13 ms 14292 KB Output is correct
10 Correct 13 ms 14264 KB Output is correct
11 Correct 13 ms 14340 KB Output is correct
12 Correct 13 ms 14292 KB Output is correct
13 Correct 14 ms 14560 KB Output is correct
14 Correct 20 ms 14564 KB Output is correct
15 Correct 14 ms 14420 KB Output is correct
16 Correct 14 ms 14420 KB Output is correct
17 Correct 13 ms 14396 KB Output is correct
18 Correct 14 ms 14384 KB Output is correct
19 Correct 16 ms 14268 KB Output is correct
20 Correct 13 ms 14292 KB Output is correct
21 Correct 13 ms 14292 KB Output is correct
22 Correct 16 ms 14368 KB Output is correct
23 Correct 17 ms 14312 KB Output is correct
24 Correct 14 ms 14400 KB Output is correct
25 Correct 14 ms 14396 KB Output is correct
26 Correct 12 ms 14276 KB Output is correct
27 Correct 14 ms 14244 KB Output is correct
28 Correct 12 ms 14284 KB Output is correct
29 Correct 11 ms 14292 KB Output is correct
30 Correct 14 ms 14292 KB Output is correct
31 Correct 14 ms 14372 KB Output is correct
32 Correct 14 ms 14356 KB Output is correct
33 Correct 14 ms 14548 KB Output is correct
34 Correct 14 ms 14652 KB Output is correct
35 Correct 17 ms 14644 KB Output is correct
36 Correct 6 ms 12244 KB Output is correct
37 Correct 14 ms 14292 KB Output is correct
38 Correct 14 ms 14268 KB Output is correct
39 Correct 15 ms 14392 KB Output is correct
40 Correct 988 ms 126304 KB Output is correct
41 Correct 1414 ms 113500 KB Output is correct
42 Correct 1402 ms 98612 KB Output is correct
43 Correct 947 ms 97120 KB Output is correct
44 Correct 900 ms 101148 KB Output is correct
45 Correct 1651 ms 138016 KB Output is correct
46 Correct 1614 ms 137952 KB Output is correct
47 Correct 1640 ms 137800 KB Output is correct
48 Correct 1569 ms 137716 KB Output is correct
49 Correct 1576 ms 138088 KB Output is correct
50 Correct 1664 ms 153028 KB Output is correct
51 Correct 1717 ms 153540 KB Output is correct
52 Correct 1787 ms 152772 KB Output is correct
53 Correct 2021 ms 138824 KB Output is correct
54 Correct 1990 ms 138672 KB Output is correct
55 Correct 2053 ms 138824 KB Output is correct
56 Runtime error 961 ms 357560 KB Execution killed with signal 11
57 Halted 0 ms 0 KB -