oj.uz

Submission #773643

# Submission time Handle Problem Language Result Execution time Memory
773643 2023-07-05T07:32:31 Z PoPularPlusPlus Two Currencies (JOI23_currencies) C++17
100 / 100
 832 ms 45348 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

const int N = 100002 , L = 20;

struct query {
	int start,end;
	ll gold , silver;
	int l , r , ans , left, right , left1, right1;
};

vector<pair<int,int>> adj[N];
vector<pair<int,int>> check_points[N];
vector<int> tp;
int start[N],tin[N],tout[N];
vector<pair<ll,int>> arr;
vector<query> queries(N);
int up[N][L],in[N],out[N],timer;

void dfs(int node , int par){
	start[node] = tp.size();
	in[node] = timer++;
	up[node][0] = par;
	for(int i = 1; i < L; i++){
		up[node][i] = up[up[node][i-1]][i-1];
	}
	for(auto i : adj[node]){
		if(i.vf == par)continue;
		for(auto j : check_points[i.vs]){
			tin[j.vs] = tp.size();
			tp.pb(j.vf);
		}
		dfs(i.vf , node);
		for(auto j : check_points[i.vs]){
			tout[j.vs] = tp.size();
			tp.pb(j.vf);
		}
	}
	out[node] = timer++;
}

bool is_lca(int x , int y){
	return in[x] <= in[y] && out[x] >= out[y];
}

int find(int x , int y){
	if(is_lca(x,y))return x;
	if(is_lca(y,x))return y;
	for(int i = L - 1; i >= 0; i--){
		if(!is_lca(up[x][i],y))x = up[x][i];
	}
	return up[x][0];
}

struct Fen {
	int n;
	vector<ll> tree;
	
	void init(int n1){
		n = n1;
		tree.assign(n + 1 , 0);
	}
	
	void set(int i , ll val){
		i++;
		while(i <= n){
			tree[i] += val;
			i += (i & -i);
		}
	}
	
	ll sum(int i){
		i++;
		ll res = 0;
		while(i > 0){
			res += tree[i];
			i -= (i & -i);
		}
		return res;
	}
};

int n , m , q;
Fen ft,ft1;

void pbs(){
	vector<int> v[m + 1];
	ft.init(2*m + 1);
	ft1.init(2*m + 1);
	for(int i = 0; i < q; i++){
		if(queries[i].l <= queries[i].r){
			v[(queries[i].l + queries[i].r)/2].pb(i);
		}
	}
	for(int i = 0; i < m; i++){
		ft.set(tin[arr[i].vs],arr[i].vf);
		ft.set(tout[arr[i].vs],-arr[i].vf);
	}
	
	for(int i : v[m]){
		ll sum = ft.sum(queries[i].right) - ft.sum(queries[i].left-1);
		sum += ft.sum(queries[i].right1) - ft.sum(queries[i].left1-1);
		if(sum <= queries[i].silver){
			queries[i].ans = 0;
			queries[i].l = m+1;
		}
		else {
			queries[i].r = m - 1;
		}
	}
	for(int j = m - 1; j >= 0; j--){
		ft.set(tin[arr[j].vs],-arr[j].vf);
		ft.set(tout[arr[j].vs],arr[j].vf);
		ft1.set(tin[arr[j].vs],1);
		ft1.set(tout[arr[j].vs],-1);
		for(int i : v[j]){
			ll sum = ft.sum(queries[i].right) - ft.sum(queries[i].left-1);
			sum += ft.sum(queries[i].right1) - ft.sum(queries[i].left1-1);
			int cnt = ft1.sum(queries[i].right) - ft1.sum(queries[i].left-1);
			cnt += ft1.sum(queries[i].right1) - ft1.sum(queries[i].left1-1);
			if(sum <= queries[i].silver){
				queries[i].ans = cnt;
				queries[i].l = j+1;
			}
			else {
				queries[i].r = j - 1;
			}
		}
	}
}

void solve(){
	cin >> n >> m >> q;
	for(int i = 0; i < n - 1; i++){
		int a , b;
		cin >> a >> b;
		adj[a].pb(mp(b,i+1));
		adj[b].pb(mp(a,i+1));
	}
	for(int i = 0; i < m; i++){
		ll p , c;
		cin >> p >> c;
		check_points[p].pb(mp(c,i));
		arr.pb(mp(c,i));
	}
	
	timer = 0;
	dfs(1,1);
		
	sort(all(arr));
	for(int i = 0; i < q; i++){
		ll s , t , x , y;
		cin >> s >> t >> x >> y;
		int left , right , left1 , right1;
		int lca = find(s,t);
		if(lca == s){
			left = start[s];
			right = start[t]-1;
			left1 = 0;
			right1 = -1;
		}
		else if(lca == t){
			left = start[t];
			right = start[s]-1;
			left1 = 0;
			right1 = -1;
		}
		else {
			left = start[lca];
			right = start[s]-1;
			left1 = start[lca];
			right1 = start[t]-1;
		}
		//cout << left << ' ' << right << ' ' << left1 << ' ' << right1 << '\n';
		queries[i] = {s,t,x,y,0,m,-1,left,right,left1,right1};
	}
		
	for(int i = 0; i < L; i++){
		pbs();
	}
	
	for(int i = 0; i < q; i++){
		if(queries[i].ans == -1 || queries[i].ans > queries[i].gold)cout << -1 << '\n';
		else cout << queries[i].gold - queries[i].ans << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Compilation message

currencies.cpp: In function 'void solve()':
currencies.cpp:195:17: warning: narrowing conversion of 's' from 'long long int' to 'int' [-Wnarrowing]
  195 |   queries[i] = {s,t,x,y,0,m,-1,left,right,left1,right1};
      |                 ^
currencies.cpp:195:19: warning: narrowing conversion of 't' from 'long long int' to 'int' [-Wnarrowing]
  195 |   queries[i] = {s,t,x,y,0,m,-1,left,right,left1,right1};
      |                   ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10528 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 5 ms 10496 KB Output is correct
4 Correct 5 ms 10456 KB Output is correct
5 Correct 12 ms 11016 KB Output is correct
6 Correct 12 ms 11092 KB Output is correct
7 Correct 10 ms 10964 KB Output is correct
8 Correct 12 ms 11044 KB Output is correct
9 Correct 12 ms 11048 KB Output is correct
10 Correct 12 ms 11092 KB Output is correct
11 Correct 12 ms 11092 KB Output is correct
12 Correct 14 ms 11092 KB Output is correct
13 Correct 12 ms 11220 KB Output is correct
14 Correct 12 ms 11220 KB Output is correct
15 Correct 12 ms 11176 KB Output is correct
16 Correct 12 ms 11152 KB Output is correct
17 Correct 12 ms 11056 KB Output is correct
18 Correct 12 ms 11052 KB Output is correct
19 Correct 11 ms 11092 KB Output is correct
20 Correct 11 ms 11048 KB Output is correct
21 Correct 11 ms 11048 KB Output is correct
22 Correct 11 ms 11092 KB Output is correct
23 Correct 11 ms 11044 KB Output is correct
24 Correct 12 ms 11092 KB Output is correct
25 Correct 13 ms 11040 KB Output is correct
26 Correct 14 ms 11132 KB Output is correct
27 Correct 11 ms 11044 KB Output is correct
28 Correct 13 ms 11092 KB Output is correct
29 Correct 14 ms 11056 KB Output is correct
30 Correct 16 ms 11056 KB Output is correct
31 Correct 12 ms 11136 KB Output is correct
32 Correct 12 ms 11044 KB Output is correct
33 Correct 11 ms 11348 KB Output is correct
34 Correct 11 ms 11360 KB Output is correct
35 Correct 12 ms 11356 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 12 ms 11128 KB Output is correct
3 Correct 12 ms 11140 KB Output is correct
4 Correct 14 ms 11144 KB Output is correct
5 Correct 446 ms 34424 KB Output is correct
6 Correct 470 ms 29512 KB Output is correct
7 Correct 431 ms 29644 KB Output is correct
8 Correct 362 ms 29504 KB Output is correct
9 Correct 368 ms 30172 KB Output is correct
10 Correct 639 ms 35392 KB Output is correct
11 Correct 621 ms 35388 KB Output is correct
12 Correct 663 ms 35380 KB Output is correct
13 Correct 596 ms 35388 KB Output is correct
14 Correct 630 ms 35340 KB Output is correct
15 Correct 652 ms 44124 KB Output is correct
16 Correct 682 ms 44912 KB Output is correct
17 Correct 629 ms 43680 KB Output is correct
18 Correct 684 ms 34844 KB Output is correct
19 Correct 692 ms 34952 KB Output is correct
20 Correct 665 ms 34912 KB Output is correct
21 Correct 526 ms 35624 KB Output is correct
22 Correct 552 ms 35704 KB Output is correct
23 Correct 497 ms 35560 KB Output is correct
24 Correct 508 ms 35812 KB Output is correct
25 Correct 604 ms 34996 KB Output is correct
26 Correct 589 ms 35048 KB Output is correct
27 Correct 541 ms 35132 KB Output is correct
28 Correct 607 ms 35388 KB Output is correct
29 Correct 581 ms 35388 KB Output is correct
30 Correct 539 ms 35380 KB Output is correct
31 Correct 581 ms 35644 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 11 ms 11308 KB Output is correct
3 Correct 11 ms 11300 KB Output is correct
4 Correct 12 ms 11348 KB Output is correct
5 Correct 360 ms 41020 KB Output is correct
6 Correct 306 ms 39104 KB Output is correct
7 Correct 504 ms 33068 KB Output is correct
8 Correct 604 ms 45200 KB Output is correct
9 Correct 604 ms 45204 KB Output is correct
10 Correct 648 ms 45348 KB Output is correct
11 Correct 645 ms 44740 KB Output is correct
12 Correct 561 ms 44804 KB Output is correct
13 Correct 626 ms 44732 KB Output is correct
14 Correct 540 ms 45136 KB Output is correct
15 Correct 535 ms 45116 KB Output is correct
16 Correct 575 ms 45196 KB Output is correct
17 Correct 565 ms 45064 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10528 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 5 ms 10496 KB Output is correct
4 Correct 5 ms 10456 KB Output is correct
5 Correct 12 ms 11016 KB Output is correct
6 Correct 12 ms 11092 KB Output is correct
7 Correct 10 ms 10964 KB Output is correct
8 Correct 12 ms 11044 KB Output is correct
9 Correct 12 ms 11048 KB Output is correct
10 Correct 12 ms 11092 KB Output is correct
11 Correct 12 ms 11092 KB Output is correct
12 Correct 14 ms 11092 KB Output is correct
13 Correct 12 ms 11220 KB Output is correct
14 Correct 12 ms 11220 KB Output is correct
15 Correct 12 ms 11176 KB Output is correct
16 Correct 12 ms 11152 KB Output is correct
17 Correct 12 ms 11056 KB Output is correct
18 Correct 12 ms 11052 KB Output is correct
19 Correct 11 ms 11092 KB Output is correct
20 Correct 11 ms 11048 KB Output is correct
21 Correct 11 ms 11048 KB Output is correct
22 Correct 11 ms 11092 KB Output is correct
23 Correct 11 ms 11044 KB Output is correct
24 Correct 12 ms 11092 KB Output is correct
25 Correct 13 ms 11040 KB Output is correct
26 Correct 14 ms 11132 KB Output is correct
27 Correct 11 ms 11044 KB Output is correct
28 Correct 13 ms 11092 KB Output is correct
29 Correct 14 ms 11056 KB Output is correct
30 Correct 16 ms 11056 KB Output is correct
31 Correct 12 ms 11136 KB Output is correct
32 Correct 12 ms 11044 KB Output is correct
33 Correct 11 ms 11348 KB Output is correct
34 Correct 11 ms 11360 KB Output is correct
35 Correct 12 ms 11356 KB Output is correct
36 Correct 5 ms 10452 KB Output is correct
37 Correct 12 ms 11128 KB Output is correct
38 Correct 12 ms 11140 KB Output is correct
39 Correct 14 ms 11144 KB Output is correct
40 Correct 446 ms 34424 KB Output is correct
41 Correct 470 ms 29512 KB Output is correct
42 Correct 431 ms 29644 KB Output is correct
43 Correct 362 ms 29504 KB Output is correct
44 Correct 368 ms 30172 KB Output is correct
45 Correct 639 ms 35392 KB Output is correct
46 Correct 621 ms 35388 KB Output is correct
47 Correct 663 ms 35380 KB Output is correct
48 Correct 596 ms 35388 KB Output is correct
49 Correct 630 ms 35340 KB Output is correct
50 Correct 652 ms 44124 KB Output is correct
51 Correct 682 ms 44912 KB Output is correct
52 Correct 629 ms 43680 KB Output is correct
53 Correct 684 ms 34844 KB Output is correct
54 Correct 692 ms 34952 KB Output is correct
55 Correct 665 ms 34912 KB Output is correct
56 Correct 526 ms 35624 KB Output is correct
57 Correct 552 ms 35704 KB Output is correct
58 Correct 497 ms 35560 KB Output is correct
59 Correct 508 ms 35812 KB Output is correct
60 Correct 604 ms 34996 KB Output is correct
61 Correct 589 ms 35048 KB Output is correct
62 Correct 541 ms 35132 KB Output is correct
63 Correct 607 ms 35388 KB Output is correct
64 Correct 581 ms 35388 KB Output is correct
65 Correct 539 ms 35380 KB Output is correct
66 Correct 581 ms 35644 KB Output is correct
67 Correct 5 ms 10452 KB Output is correct
68 Correct 11 ms 11308 KB Output is correct
69 Correct 11 ms 11300 KB Output is correct
70 Correct 12 ms 11348 KB Output is correct
71 Correct 360 ms 41020 KB Output is correct
72 Correct 306 ms 39104 KB Output is correct
73 Correct 504 ms 33068 KB Output is correct
74 Correct 604 ms 45200 KB Output is correct
75 Correct 604 ms 45204 KB Output is correct
76 Correct 648 ms 45348 KB Output is correct
77 Correct 645 ms 44740 KB Output is correct
78 Correct 561 ms 44804 KB Output is correct
79 Correct 626 ms 44732 KB Output is correct
80 Correct 540 ms 45136 KB Output is correct
81 Correct 535 ms 45116 KB Output is correct
82 Correct 575 ms 45196 KB Output is correct
83 Correct 565 ms 45064 KB Output is correct
84 Correct 486 ms 32472 KB Output is correct
85 Correct 506 ms 27708 KB Output is correct
86 Correct 409 ms 24792 KB Output is correct
87 Correct 770 ms 35460 KB Output is correct
88 Correct 770 ms 35592 KB Output is correct
89 Correct 791 ms 35516 KB Output is correct
90 Correct 776 ms 35516 KB Output is correct
91 Correct 692 ms 35512 KB Output is correct
92 Correct 745 ms 40632 KB Output is correct
93 Correct 755 ms 43280 KB Output is correct
94 Correct 764 ms 35032 KB Output is correct
95 Correct 832 ms 35088 KB Output is correct
96 Correct 772 ms 35044 KB Output is correct
97 Correct 755 ms 35036 KB Output is correct
98 Correct 600 ms 35816 KB Output is correct
99 Correct 609 ms 35832 KB Output is correct
100 Correct 612 ms 35816 KB Output is correct
101 Correct 630 ms 35732 KB Output is correct
102 Correct 711 ms 35100 KB Output is correct
103 Correct 666 ms 35176 KB Output is correct
104 Correct 626 ms 35104 KB Output is correct
105 Correct 577 ms 35636 KB Output is correct
106 Correct 604 ms 35512 KB Output is correct
107 Correct 601 ms 35540 KB Output is correct
108 Correct 593 ms 35792 KB Output is correct