#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 = 0; i < q; i++){
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);
}
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:200:17: warning: narrowing conversion of 's' from 'long long int' to 'int' [-Wnarrowing]
200 | queries[i] = {s,t,x,y,0,m,-1,left,right,left1,right1};
| ^
currencies.cpp:200:19: warning: narrowing conversion of 't' from 'long long int' to 'int' [-Wnarrowing]
200 | queries[i] = {s,t,x,y,0,m,-1,left,right,left1,right1};
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
10528 KB |
Output is correct |
2 |
Correct |
5 ms |
10508 KB |
Output is correct |
3 |
Correct |
5 ms |
10532 KB |
Output is correct |
4 |
Correct |
5 ms |
10452 KB |
Output is correct |
5 |
Correct |
11 ms |
11052 KB |
Output is correct |
6 |
Correct |
12 ms |
11092 KB |
Output is correct |
7 |
Correct |
10 ms |
10920 KB |
Output is correct |
8 |
Correct |
13 ms |
11132 KB |
Output is correct |
9 |
Correct |
12 ms |
11092 KB |
Output is correct |
10 |
Correct |
12 ms |
11048 KB |
Output is correct |
11 |
Correct |
12 ms |
11128 KB |
Output is correct |
12 |
Correct |
12 ms |
11092 KB |
Output is correct |
13 |
Correct |
12 ms |
11316 KB |
Output is correct |
14 |
Correct |
12 ms |
11244 KB |
Output is correct |
15 |
Correct |
12 ms |
11092 KB |
Output is correct |
16 |
Correct |
12 ms |
11092 KB |
Output is correct |
17 |
Correct |
12 ms |
11092 KB |
Output is correct |
18 |
Correct |
12 ms |
11092 KB |
Output is correct |
19 |
Correct |
12 ms |
11136 KB |
Output is correct |
20 |
Correct |
11 ms |
11144 KB |
Output is correct |
21 |
Correct |
11 ms |
11144 KB |
Output is correct |
22 |
Correct |
12 ms |
11112 KB |
Output is correct |
23 |
Correct |
11 ms |
11136 KB |
Output is correct |
24 |
Correct |
14 ms |
11132 KB |
Output is correct |
25 |
Correct |
15 ms |
11112 KB |
Output is correct |
26 |
Correct |
11 ms |
11092 KB |
Output is correct |
27 |
Correct |
10 ms |
11092 KB |
Output is correct |
28 |
Correct |
11 ms |
11072 KB |
Output is correct |
29 |
Correct |
11 ms |
11092 KB |
Output is correct |
30 |
Correct |
12 ms |
11060 KB |
Output is correct |
31 |
Correct |
12 ms |
11052 KB |
Output is correct |
32 |
Correct |
13 ms |
11048 KB |
Output is correct |
33 |
Correct |
11 ms |
11348 KB |
Output is correct |
34 |
Correct |
12 ms |
11232 KB |
Output is correct |
35 |
Correct |
11 ms |
11348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
10532 KB |
Output is correct |
2 |
Correct |
12 ms |
11140 KB |
Output is correct |
3 |
Correct |
15 ms |
11092 KB |
Output is correct |
4 |
Correct |
13 ms |
11136 KB |
Output is correct |
5 |
Correct |
427 ms |
38544 KB |
Output is correct |
6 |
Correct |
482 ms |
34248 KB |
Output is correct |
7 |
Correct |
477 ms |
34124 KB |
Output is correct |
8 |
Correct |
372 ms |
33308 KB |
Output is correct |
9 |
Correct |
382 ms |
33980 KB |
Output is correct |
10 |
Correct |
630 ms |
40428 KB |
Output is correct |
11 |
Correct |
612 ms |
40444 KB |
Output is correct |
12 |
Correct |
645 ms |
40432 KB |
Output is correct |
13 |
Correct |
598 ms |
40420 KB |
Output is correct |
14 |
Correct |
616 ms |
40388 KB |
Output is correct |
15 |
Correct |
667 ms |
49804 KB |
Output is correct |
16 |
Correct |
739 ms |
50824 KB |
Output is correct |
17 |
Correct |
669 ms |
49232 KB |
Output is correct |
18 |
Correct |
667 ms |
40208 KB |
Output is correct |
19 |
Correct |
725 ms |
40240 KB |
Output is correct |
20 |
Correct |
650 ms |
40348 KB |
Output is correct |
21 |
Correct |
590 ms |
40112 KB |
Output is correct |
22 |
Correct |
613 ms |
40340 KB |
Output is correct |
23 |
Correct |
549 ms |
40200 KB |
Output is correct |
24 |
Correct |
525 ms |
40180 KB |
Output is correct |
25 |
Correct |
612 ms |
40424 KB |
Output is correct |
26 |
Correct |
580 ms |
40376 KB |
Output is correct |
27 |
Correct |
578 ms |
40508 KB |
Output is correct |
28 |
Correct |
529 ms |
40252 KB |
Output is correct |
29 |
Correct |
629 ms |
40332 KB |
Output is correct |
30 |
Correct |
506 ms |
40468 KB |
Output is correct |
31 |
Correct |
522 ms |
40748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
10452 KB |
Output is correct |
2 |
Correct |
11 ms |
11348 KB |
Output is correct |
3 |
Correct |
11 ms |
11360 KB |
Output is correct |
4 |
Correct |
11 ms |
11300 KB |
Output is correct |
5 |
Correct |
365 ms |
45208 KB |
Output is correct |
6 |
Correct |
299 ms |
43072 KB |
Output is correct |
7 |
Correct |
511 ms |
37948 KB |
Output is correct |
8 |
Correct |
612 ms |
50832 KB |
Output is correct |
9 |
Correct |
621 ms |
50816 KB |
Output is correct |
10 |
Correct |
648 ms |
50940 KB |
Output is correct |
11 |
Correct |
595 ms |
50372 KB |
Output is correct |
12 |
Correct |
655 ms |
50492 KB |
Output is correct |
13 |
Correct |
606 ms |
50372 KB |
Output is correct |
14 |
Correct |
584 ms |
50668 KB |
Output is correct |
15 |
Correct |
533 ms |
50556 KB |
Output is correct |
16 |
Correct |
573 ms |
50840 KB |
Output is correct |
17 |
Correct |
554 ms |
50700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
10528 KB |
Output is correct |
2 |
Correct |
5 ms |
10508 KB |
Output is correct |
3 |
Correct |
5 ms |
10532 KB |
Output is correct |
4 |
Correct |
5 ms |
10452 KB |
Output is correct |
5 |
Correct |
11 ms |
11052 KB |
Output is correct |
6 |
Correct |
12 ms |
11092 KB |
Output is correct |
7 |
Correct |
10 ms |
10920 KB |
Output is correct |
8 |
Correct |
13 ms |
11132 KB |
Output is correct |
9 |
Correct |
12 ms |
11092 KB |
Output is correct |
10 |
Correct |
12 ms |
11048 KB |
Output is correct |
11 |
Correct |
12 ms |
11128 KB |
Output is correct |
12 |
Correct |
12 ms |
11092 KB |
Output is correct |
13 |
Correct |
12 ms |
11316 KB |
Output is correct |
14 |
Correct |
12 ms |
11244 KB |
Output is correct |
15 |
Correct |
12 ms |
11092 KB |
Output is correct |
16 |
Correct |
12 ms |
11092 KB |
Output is correct |
17 |
Correct |
12 ms |
11092 KB |
Output is correct |
18 |
Correct |
12 ms |
11092 KB |
Output is correct |
19 |
Correct |
12 ms |
11136 KB |
Output is correct |
20 |
Correct |
11 ms |
11144 KB |
Output is correct |
21 |
Correct |
11 ms |
11144 KB |
Output is correct |
22 |
Correct |
12 ms |
11112 KB |
Output is correct |
23 |
Correct |
11 ms |
11136 KB |
Output is correct |
24 |
Correct |
14 ms |
11132 KB |
Output is correct |
25 |
Correct |
15 ms |
11112 KB |
Output is correct |
26 |
Correct |
11 ms |
11092 KB |
Output is correct |
27 |
Correct |
10 ms |
11092 KB |
Output is correct |
28 |
Correct |
11 ms |
11072 KB |
Output is correct |
29 |
Correct |
11 ms |
11092 KB |
Output is correct |
30 |
Correct |
12 ms |
11060 KB |
Output is correct |
31 |
Correct |
12 ms |
11052 KB |
Output is correct |
32 |
Correct |
13 ms |
11048 KB |
Output is correct |
33 |
Correct |
11 ms |
11348 KB |
Output is correct |
34 |
Correct |
12 ms |
11232 KB |
Output is correct |
35 |
Correct |
11 ms |
11348 KB |
Output is correct |
36 |
Correct |
5 ms |
10532 KB |
Output is correct |
37 |
Correct |
12 ms |
11140 KB |
Output is correct |
38 |
Correct |
15 ms |
11092 KB |
Output is correct |
39 |
Correct |
13 ms |
11136 KB |
Output is correct |
40 |
Correct |
427 ms |
38544 KB |
Output is correct |
41 |
Correct |
482 ms |
34248 KB |
Output is correct |
42 |
Correct |
477 ms |
34124 KB |
Output is correct |
43 |
Correct |
372 ms |
33308 KB |
Output is correct |
44 |
Correct |
382 ms |
33980 KB |
Output is correct |
45 |
Correct |
630 ms |
40428 KB |
Output is correct |
46 |
Correct |
612 ms |
40444 KB |
Output is correct |
47 |
Correct |
645 ms |
40432 KB |
Output is correct |
48 |
Correct |
598 ms |
40420 KB |
Output is correct |
49 |
Correct |
616 ms |
40388 KB |
Output is correct |
50 |
Correct |
667 ms |
49804 KB |
Output is correct |
51 |
Correct |
739 ms |
50824 KB |
Output is correct |
52 |
Correct |
669 ms |
49232 KB |
Output is correct |
53 |
Correct |
667 ms |
40208 KB |
Output is correct |
54 |
Correct |
725 ms |
40240 KB |
Output is correct |
55 |
Correct |
650 ms |
40348 KB |
Output is correct |
56 |
Correct |
590 ms |
40112 KB |
Output is correct |
57 |
Correct |
613 ms |
40340 KB |
Output is correct |
58 |
Correct |
549 ms |
40200 KB |
Output is correct |
59 |
Correct |
525 ms |
40180 KB |
Output is correct |
60 |
Correct |
612 ms |
40424 KB |
Output is correct |
61 |
Correct |
580 ms |
40376 KB |
Output is correct |
62 |
Correct |
578 ms |
40508 KB |
Output is correct |
63 |
Correct |
529 ms |
40252 KB |
Output is correct |
64 |
Correct |
629 ms |
40332 KB |
Output is correct |
65 |
Correct |
506 ms |
40468 KB |
Output is correct |
66 |
Correct |
522 ms |
40748 KB |
Output is correct |
67 |
Correct |
5 ms |
10452 KB |
Output is correct |
68 |
Correct |
11 ms |
11348 KB |
Output is correct |
69 |
Correct |
11 ms |
11360 KB |
Output is correct |
70 |
Correct |
11 ms |
11300 KB |
Output is correct |
71 |
Correct |
365 ms |
45208 KB |
Output is correct |
72 |
Correct |
299 ms |
43072 KB |
Output is correct |
73 |
Correct |
511 ms |
37948 KB |
Output is correct |
74 |
Correct |
612 ms |
50832 KB |
Output is correct |
75 |
Correct |
621 ms |
50816 KB |
Output is correct |
76 |
Correct |
648 ms |
50940 KB |
Output is correct |
77 |
Correct |
595 ms |
50372 KB |
Output is correct |
78 |
Correct |
655 ms |
50492 KB |
Output is correct |
79 |
Correct |
606 ms |
50372 KB |
Output is correct |
80 |
Correct |
584 ms |
50668 KB |
Output is correct |
81 |
Correct |
533 ms |
50556 KB |
Output is correct |
82 |
Correct |
573 ms |
50840 KB |
Output is correct |
83 |
Correct |
554 ms |
50700 KB |
Output is correct |
84 |
Correct |
519 ms |
36696 KB |
Output is correct |
85 |
Correct |
503 ms |
31804 KB |
Output is correct |
86 |
Correct |
362 ms |
28472 KB |
Output is correct |
87 |
Correct |
726 ms |
40316 KB |
Output is correct |
88 |
Correct |
750 ms |
40368 KB |
Output is correct |
89 |
Correct |
782 ms |
40264 KB |
Output is correct |
90 |
Correct |
690 ms |
40364 KB |
Output is correct |
91 |
Correct |
734 ms |
40360 KB |
Output is correct |
92 |
Correct |
731 ms |
46072 KB |
Output is correct |
93 |
Correct |
697 ms |
48764 KB |
Output is correct |
94 |
Correct |
835 ms |
40328 KB |
Output is correct |
95 |
Correct |
756 ms |
40292 KB |
Output is correct |
96 |
Correct |
752 ms |
40284 KB |
Output is correct |
97 |
Correct |
716 ms |
40248 KB |
Output is correct |
98 |
Correct |
592 ms |
40204 KB |
Output is correct |
99 |
Correct |
635 ms |
40148 KB |
Output is correct |
100 |
Correct |
583 ms |
40248 KB |
Output is correct |
101 |
Correct |
669 ms |
40328 KB |
Output is correct |
102 |
Correct |
688 ms |
40348 KB |
Output is correct |
103 |
Correct |
697 ms |
40340 KB |
Output is correct |
104 |
Correct |
678 ms |
40240 KB |
Output is correct |
105 |
Correct |
550 ms |
40584 KB |
Output is correct |
106 |
Correct |
554 ms |
40476 KB |
Output is correct |
107 |
Correct |
596 ms |
40324 KB |
Output is correct |
108 |
Correct |
639 ms |
40472 KB |
Output is correct |