oj.uz

Submission #767865

# Submission time Handle Problem Language Result Execution time Memory
767865 2023-06-27T08:41:02 Z Dan4Life Two Currencies (JOI23_currencies) C++17
100 / 100
 840 ms 164708 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ar = array<ll,2>;
#define pb push_back
#define sz(a) (int)a.size()
const int mxN = (int)1e5+10;
const int mxN2 = mxN*240;
const int INF = (int)1e9;
const int mxLg = 17;

ar seg[mxN2];
int n, m, q, IND=1;
int jmp[mxLg][mxN];
vector<int> v[mxN];
vector<ar> adj[mxN];
int L[mxN2], R[mxN2];
int lev[mxN], ro[mxN];

int newChild(int p, int v){
    int p2 = ++IND;
    L[p2] = L[p], R[p2] = R[p];
    seg[p2]={seg[p][0]+v,seg[p][1]+1};
    return p2;
}

int newPar(int l, int r){
    int p = ++IND; L[p] = l, R[p] = r;
    seg[p][0] = seg[l][0]+seg[r][0];
    seg[p][1] = seg[l][1]+seg[r][1];
    return p;
}

int upd(int x, int v, int p, int l=1, int r=INF){
    if(!p) return p;
    if(l==r) return newChild(p,v);
    int mid = (l+r)/2;
    if(!L[p]) L[p]=++IND;
    if(!R[p]) R[p]=++IND;
    if(x<=mid) return newPar(upd(x,v,L[p],l,mid),R[p]);
    return newPar(L[p],upd(x,v,R[p],mid+1,r));
}

ar query(ll x, int p1, int p2, int p3, int l=1, int r=INF){
    if(l==r){
        int num = min(seg[p1][1]+seg[p2][1]-2*seg[p3][1], x/l);
        return ar({(ll)num*l,num});
    }
    int mid = (l+r)/2; ar ans = {0,0};
    ll ltot = seg[L[p1]][0]+seg[L[p2]][0]-2*seg[L[p3]][0];
    int lntot = seg[L[p1]][1]+seg[L[p2]][1]-2*seg[L[p3]][1];
    if(ltot>=x) ans = query(x,L[p1],L[p2],L[p3],l,mid);
    else{
        ans = query(x-ltot,R[p1],R[p2],R[p3],mid+1,r);
        ans[0]+=ltot, ans[1]+=lntot;
    }
    return ans;
}

void dfs(int s, int p){
    jmp[0][s]=p; lev[s] = lev[p]+1;
    for(auto [u,w] : adj[s]){
        if(u==p) continue; ro[u] = ro[s];
        for(auto x : v[w]) ro[u] = upd(x,x,ro[u]);
        dfs(u,s);
    }
}

int getPath(int x, int k){
    for(int i = mxLg-1; i>=0; i--)
        if((k>>i)&1) x=jmp[i][x];
    return x;
}

int lca(int a, int b){
    if(a==b) return a;
    if(jmp[0][a]==jmp[0][b]) return jmp[0][a];
    if(lev[a]>lev[b]) swap(a,b);
    b = getPath(b,lev[b]-lev[a]);
    for(int i = mxLg-1; i>=0; i--)
        if(jmp[i][a]!=jmp[i][b] and jmp[i][a])
            a=jmp[i][a], b=jmp[i][b];
    return lca(a,b);
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m >> q; 
    int p, c, a, b; ro[1]=1;
    for(int i = 1; i < n; i++)
        cin >> a >> b, adj[a].pb({b,i}), adj[b].pb({a,i});
    for(int i = 1; i <= m; i++)
        cin >> p >> c, v[p].pb(c);
    dfs(1,0);
    for(int i = 1; i < mxLg; i++)
        for(int j = 1; j <= n; j++)
            jmp[i][j] = jmp[i-1][jmp[i-1][j]];
    for(int i = 0; i < q; i++){
        ll s, t, x, y, z; cin >> s >> t >> x >> y;
        z = ro[lca(s,t)], s = ro[s], t = ro[t];
        int num = seg[s][1]+seg[t][1]-2*seg[z][1];
        cout << max(-1ll, x-(num-query(y,s,t,z)[1])) << "\n";
    }
}

Compilation message

currencies.cpp: In function 'void dfs(int, int)':
currencies.cpp:63:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   63 |         if(u==p) continue; ro[u] = ro[s];
      |         ^~
currencies.cpp:63:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   63 |         if(u==p) continue; ro[u] = ro[s];
      |                            ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5044 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 2 ms 5076 KB Output is correct
5 Correct 7 ms 8440 KB Output is correct
6 Correct 8 ms 8276 KB Output is correct
7 Correct 6 ms 7636 KB Output is correct
8 Correct 7 ms 8680 KB Output is correct
9 Correct 7 ms 8660 KB Output is correct
10 Correct 7 ms 8660 KB Output is correct
11 Correct 7 ms 8660 KB Output is correct
12 Correct 7 ms 8660 KB Output is correct
13 Correct 7 ms 8788 KB Output is correct
14 Correct 8 ms 8788 KB Output is correct
15 Correct 7 ms 8660 KB Output is correct
16 Correct 9 ms 8708 KB Output is correct
17 Correct 7 ms 8660 KB Output is correct
18 Correct 7 ms 8660 KB Output is correct
19 Correct 6 ms 8660 KB Output is correct
20 Correct 8 ms 8660 KB Output is correct
21 Correct 7 ms 8660 KB Output is correct
22 Correct 9 ms 8660 KB Output is correct
23 Correct 9 ms 8660 KB Output is correct
24 Correct 8 ms 8660 KB Output is correct
25 Correct 8 ms 8660 KB Output is correct
26 Correct 7 ms 8676 KB Output is correct
27 Correct 7 ms 8660 KB Output is correct
28 Correct 6 ms 8660 KB Output is correct
29 Correct 6 ms 8660 KB Output is correct
30 Correct 5 ms 6868 KB Output is correct
31 Correct 5 ms 6868 KB Output is correct
32 Correct 5 ms 6868 KB Output is correct
33 Correct 8 ms 8740 KB Output is correct
34 Correct 7 ms 8788 KB Output is correct
35 Correct 7 ms 8788 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 6 ms 6868 KB Output is correct
3 Correct 7 ms 6868 KB Output is correct
4 Correct 5 ms 6868 KB Output is correct
5 Correct 188 ms 84960 KB Output is correct
6 Correct 207 ms 75224 KB Output is correct
7 Correct 244 ms 65032 KB Output is correct
8 Correct 170 ms 63140 KB Output is correct
9 Correct 154 ms 66976 KB Output is correct
10 Correct 273 ms 92620 KB Output is correct
11 Correct 239 ms 90300 KB Output is correct
12 Correct 307 ms 92592 KB Output is correct
13 Correct 249 ms 92608 KB Output is correct
14 Correct 243 ms 92548 KB Output is correct
15 Correct 374 ms 101160 KB Output is correct
16 Correct 341 ms 101756 KB Output is correct
17 Correct 357 ms 100780 KB Output is correct
18 Correct 326 ms 92804 KB Output is correct
19 Correct 319 ms 92608 KB Output is correct
20 Correct 305 ms 92692 KB Output is correct
21 Correct 170 ms 92176 KB Output is correct
22 Correct 168 ms 92132 KB Output is correct
23 Correct 201 ms 92084 KB Output is correct
24 Correct 197 ms 92072 KB Output is correct
25 Correct 227 ms 92136 KB Output is correct
26 Correct 256 ms 92224 KB Output is correct
27 Correct 211 ms 92140 KB Output is correct
28 Correct 181 ms 90244 KB Output is correct
29 Correct 176 ms 92812 KB Output is correct
30 Correct 181 ms 92644 KB Output is correct
31 Correct 186 ms 92608 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 7 ms 8788 KB Output is correct
3 Correct 7 ms 8728 KB Output is correct
4 Correct 7 ms 8740 KB Output is correct
5 Correct 417 ms 117332 KB Output is correct
6 Correct 431 ms 98768 KB Output is correct
7 Correct 523 ms 144876 KB Output is correct
8 Correct 767 ms 164632 KB Output is correct
9 Correct 777 ms 164668 KB Output is correct
10 Correct 769 ms 164684 KB Output is correct
11 Correct 654 ms 164288 KB Output is correct
12 Correct 631 ms 164104 KB Output is correct
13 Correct 702 ms 164100 KB Output is correct
14 Correct 423 ms 164636 KB Output is correct
15 Correct 381 ms 164652 KB Output is correct
16 Correct 463 ms 164700 KB Output is correct
17 Correct 465 ms 164708 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5044 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 2 ms 5076 KB Output is correct
5 Correct 7 ms 8440 KB Output is correct
6 Correct 8 ms 8276 KB Output is correct
7 Correct 6 ms 7636 KB Output is correct
8 Correct 7 ms 8680 KB Output is correct
9 Correct 7 ms 8660 KB Output is correct
10 Correct 7 ms 8660 KB Output is correct
11 Correct 7 ms 8660 KB Output is correct
12 Correct 7 ms 8660 KB Output is correct
13 Correct 7 ms 8788 KB Output is correct
14 Correct 8 ms 8788 KB Output is correct
15 Correct 7 ms 8660 KB Output is correct
16 Correct 9 ms 8708 KB Output is correct
17 Correct 7 ms 8660 KB Output is correct
18 Correct 7 ms 8660 KB Output is correct
19 Correct 6 ms 8660 KB Output is correct
20 Correct 8 ms 8660 KB Output is correct
21 Correct 7 ms 8660 KB Output is correct
22 Correct 9 ms 8660 KB Output is correct
23 Correct 9 ms 8660 KB Output is correct
24 Correct 8 ms 8660 KB Output is correct
25 Correct 8 ms 8660 KB Output is correct
26 Correct 7 ms 8676 KB Output is correct
27 Correct 7 ms 8660 KB Output is correct
28 Correct 6 ms 8660 KB Output is correct
29 Correct 6 ms 8660 KB Output is correct
30 Correct 5 ms 6868 KB Output is correct
31 Correct 5 ms 6868 KB Output is correct
32 Correct 5 ms 6868 KB Output is correct
33 Correct 8 ms 8740 KB Output is correct
34 Correct 7 ms 8788 KB Output is correct
35 Correct 7 ms 8788 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 6 ms 6868 KB Output is correct
38 Correct 7 ms 6868 KB Output is correct
39 Correct 5 ms 6868 KB Output is correct
40 Correct 188 ms 84960 KB Output is correct
41 Correct 207 ms 75224 KB Output is correct
42 Correct 244 ms 65032 KB Output is correct
43 Correct 170 ms 63140 KB Output is correct
44 Correct 154 ms 66976 KB Output is correct
45 Correct 273 ms 92620 KB Output is correct
46 Correct 239 ms 90300 KB Output is correct
47 Correct 307 ms 92592 KB Output is correct
48 Correct 249 ms 92608 KB Output is correct
49 Correct 243 ms 92548 KB Output is correct
50 Correct 374 ms 101160 KB Output is correct
51 Correct 341 ms 101756 KB Output is correct
52 Correct 357 ms 100780 KB Output is correct
53 Correct 326 ms 92804 KB Output is correct
54 Correct 319 ms 92608 KB Output is correct
55 Correct 305 ms 92692 KB Output is correct
56 Correct 170 ms 92176 KB Output is correct
57 Correct 168 ms 92132 KB Output is correct
58 Correct 201 ms 92084 KB Output is correct
59 Correct 197 ms 92072 KB Output is correct
60 Correct 227 ms 92136 KB Output is correct
61 Correct 256 ms 92224 KB Output is correct
62 Correct 211 ms 92140 KB Output is correct
63 Correct 181 ms 90244 KB Output is correct
64 Correct 176 ms 92812 KB Output is correct
65 Correct 181 ms 92644 KB Output is correct
66 Correct 186 ms 92608 KB Output is correct
67 Correct 3 ms 5076 KB Output is correct
68 Correct 7 ms 8788 KB Output is correct
69 Correct 7 ms 8728 KB Output is correct
70 Correct 7 ms 8740 KB Output is correct
71 Correct 417 ms 117332 KB Output is correct
72 Correct 431 ms 98768 KB Output is correct
73 Correct 523 ms 144876 KB Output is correct
74 Correct 767 ms 164632 KB Output is correct
75 Correct 777 ms 164668 KB Output is correct
76 Correct 769 ms 164684 KB Output is correct
77 Correct 654 ms 164288 KB Output is correct
78 Correct 631 ms 164104 KB Output is correct
79 Correct 702 ms 164100 KB Output is correct
80 Correct 423 ms 164636 KB Output is correct
81 Correct 381 ms 164652 KB Output is correct
82 Correct 463 ms 164700 KB Output is correct
83 Correct 465 ms 164708 KB Output is correct
84 Correct 350 ms 144604 KB Output is correct
85 Correct 302 ms 129384 KB Output is correct
86 Correct 274 ms 94852 KB Output is correct
87 Correct 477 ms 155444 KB Output is correct
88 Correct 448 ms 155472 KB Output is correct
89 Correct 487 ms 155504 KB Output is correct
90 Correct 424 ms 155540 KB Output is correct
91 Correct 460 ms 155496 KB Output is correct
92 Correct 840 ms 161376 KB Output is correct
93 Correct 830 ms 163396 KB Output is correct
94 Correct 607 ms 155676 KB Output is correct
95 Correct 652 ms 155608 KB Output is correct
96 Correct 664 ms 155600 KB Output is correct
97 Correct 622 ms 155652 KB Output is correct
98 Correct 323 ms 154996 KB Output is correct
99 Correct 316 ms 155040 KB Output is correct
100 Correct 347 ms 154936 KB Output is correct
101 Correct 339 ms 155180 KB Output is correct
102 Correct 419 ms 155072 KB Output is correct
103 Correct 491 ms 155036 KB Output is correct
104 Correct 472 ms 154988 KB Output is correct
105 Correct 279 ms 155408 KB Output is correct
106 Correct 281 ms 155464 KB Output is correct
107 Correct 307 ms 155468 KB Output is correct
108 Correct 292 ms 155408 KB Output is correct