oj.uz

Submission #767922

# Submission time Handle Problem Language Result Execution time Memory
767922 2023-06-27T09:35:34 Z Dan4Life Two Currencies (JOI23_currencies) C++17
100 / 100
 646 ms 80084 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ar = array<ll,2>;
#define pb push_back
#define all(a) begin(a),end(a)
const int mxN = (int)1e5+10;
const int mxN2 = mxN*135;
const int mxLg = 17;
 
ar seg[mxN2];
int n, m, q, IND=1;
int jmp[mxLg][mxN];
vector<ar> adj[mxN];
vector<ll> v[mxN], w;
int L[mxN2], R[mxN2];
int lev[mxN], ro[mxN], orig[mxN*2];
 
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;
    for(int i : {0,1}) seg[p][i] = seg[l][i]+seg[r][i];
    return p;
}
 
int upd(int x, int v, int p, int l=1, int r=mxN*2){
    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));
}
 
ll query(ll x, int p1, int p2, int p3, int l=1, int r=mxN*2){
    if(l==r) return min(seg[p1][1]+seg[p2][1]-2*seg[p3][1], orig[l]?(x/orig[l]):0ll);
    int mid = (l+r)/2;
    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) return query(x,L[p1],L[p2],L[p3],l,mid);
    return query(x-ltot,R[p1],R[p2],R[p3],mid+1,r)+lntot;
}
 
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,orig[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), w.pb(c);
    sort(all(w)); w.erase(unique(all(w)),end(w));
    for(int i = 1; i < n; i++) for(auto &u : v[i]) 
        u=lower_bound(all(w),u)-begin(w)+1;
    for(int cnt = 1; auto u : w) orig[cnt++]=u;
    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))) << "\n";
    }
}

Compilation message

currencies.cpp: In function 'void dfs(int, int)':
currencies.cpp:54:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   54 |         if(u==p) continue; ro[u] = ro[s];
      |         ^~
currencies.cpp:54:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   54 |         if(u==p) continue; ro[u] = ro[s];
      |                            ^~
currencies.cpp: In function 'int main()':
currencies.cpp:88:22: warning: range-based 'for' loops with initializer only available with '-std=c++2a' or '-std=gnu++2a'
   88 |     for(int cnt = 1; auto u : w) orig[cnt++]=u;
      |                      ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5032 KB Output is correct
5 Correct 5 ms 6356 KB Output is correct
6 Correct 5 ms 6436 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 5 ms 6448 KB Output is correct
9 Correct 6 ms 6468 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 6 ms 6484 KB Output is correct
12 Correct 6 ms 6484 KB Output is correct
13 Correct 6 ms 6612 KB Output is correct
14 Correct 6 ms 6612 KB Output is correct
15 Correct 6 ms 6484 KB Output is correct
16 Correct 6 ms 6576 KB Output is correct
17 Correct 6 ms 6484 KB Output is correct
18 Correct 8 ms 6580 KB Output is correct
19 Correct 5 ms 6484 KB Output is correct
20 Correct 6 ms 6436 KB Output is correct
21 Correct 5 ms 6484 KB Output is correct
22 Correct 5 ms 6456 KB Output is correct
23 Correct 5 ms 6484 KB Output is correct
24 Correct 7 ms 6516 KB Output is correct
25 Correct 6 ms 6484 KB Output is correct
26 Correct 5 ms 6528 KB Output is correct
27 Correct 5 ms 6484 KB Output is correct
28 Correct 5 ms 6524 KB Output is correct
29 Correct 6 ms 6464 KB Output is correct
30 Correct 8 ms 6484 KB Output is correct
31 Correct 5 ms 6356 KB Output is correct
32 Correct 5 ms 6336 KB Output is correct
33 Correct 6 ms 6640 KB Output is correct
34 Correct 6 ms 6672 KB Output is correct
35 Correct 6 ms 6680 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 5 ms 6324 KB Output is correct
3 Correct 5 ms 6324 KB Output is correct
4 Correct 5 ms 6356 KB Output is correct
5 Correct 168 ms 62432 KB Output is correct
6 Correct 203 ms 54608 KB Output is correct
7 Correct 159 ms 48896 KB Output is correct
8 Correct 146 ms 47856 KB Output is correct
9 Correct 153 ms 50308 KB Output is correct
10 Correct 198 ms 67136 KB Output is correct
11 Correct 230 ms 67108 KB Output is correct
12 Correct 213 ms 66864 KB Output is correct
13 Correct 211 ms 66460 KB Output is correct
14 Correct 220 ms 66416 KB Output is correct
15 Correct 259 ms 75004 KB Output is correct
16 Correct 269 ms 75560 KB Output is correct
17 Correct 294 ms 74624 KB Output is correct
18 Correct 258 ms 66588 KB Output is correct
19 Correct 246 ms 66432 KB Output is correct
20 Correct 237 ms 66580 KB Output is correct
21 Correct 155 ms 65940 KB Output is correct
22 Correct 146 ms 65848 KB Output is correct
23 Correct 153 ms 65908 KB Output is correct
24 Correct 149 ms 65848 KB Output is correct
25 Correct 176 ms 66048 KB Output is correct
26 Correct 172 ms 65972 KB Output is correct
27 Correct 175 ms 66020 KB Output is correct
28 Correct 153 ms 66392 KB Output is correct
29 Correct 145 ms 66388 KB Output is correct
30 Correct 179 ms 66412 KB Output is correct
31 Correct 155 ms 66468 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 6 ms 6708 KB Output is correct
3 Correct 6 ms 6612 KB Output is correct
4 Correct 6 ms 6656 KB Output is correct
5 Correct 304 ms 60952 KB Output is correct
6 Correct 271 ms 53336 KB Output is correct
7 Correct 368 ms 66112 KB Output is correct
8 Correct 597 ms 80084 KB Output is correct
9 Correct 563 ms 79968 KB Output is correct
10 Correct 572 ms 79992 KB Output is correct
11 Correct 449 ms 79568 KB Output is correct
12 Correct 458 ms 79500 KB Output is correct
13 Correct 455 ms 79524 KB Output is correct
14 Correct 240 ms 80060 KB Output is correct
15 Correct 225 ms 79844 KB Output is correct
16 Correct 297 ms 79976 KB Output is correct
17 Correct 321 ms 79964 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5032 KB Output is correct
5 Correct 5 ms 6356 KB Output is correct
6 Correct 5 ms 6436 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 5 ms 6448 KB Output is correct
9 Correct 6 ms 6468 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 6 ms 6484 KB Output is correct
12 Correct 6 ms 6484 KB Output is correct
13 Correct 6 ms 6612 KB Output is correct
14 Correct 6 ms 6612 KB Output is correct
15 Correct 6 ms 6484 KB Output is correct
16 Correct 6 ms 6576 KB Output is correct
17 Correct 6 ms 6484 KB Output is correct
18 Correct 8 ms 6580 KB Output is correct
19 Correct 5 ms 6484 KB Output is correct
20 Correct 6 ms 6436 KB Output is correct
21 Correct 5 ms 6484 KB Output is correct
22 Correct 5 ms 6456 KB Output is correct
23 Correct 5 ms 6484 KB Output is correct
24 Correct 7 ms 6516 KB Output is correct
25 Correct 6 ms 6484 KB Output is correct
26 Correct 5 ms 6528 KB Output is correct
27 Correct 5 ms 6484 KB Output is correct
28 Correct 5 ms 6524 KB Output is correct
29 Correct 6 ms 6464 KB Output is correct
30 Correct 8 ms 6484 KB Output is correct
31 Correct 5 ms 6356 KB Output is correct
32 Correct 5 ms 6336 KB Output is correct
33 Correct 6 ms 6640 KB Output is correct
34 Correct 6 ms 6672 KB Output is correct
35 Correct 6 ms 6680 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 5 ms 6324 KB Output is correct
38 Correct 5 ms 6324 KB Output is correct
39 Correct 5 ms 6356 KB Output is correct
40 Correct 168 ms 62432 KB Output is correct
41 Correct 203 ms 54608 KB Output is correct
42 Correct 159 ms 48896 KB Output is correct
43 Correct 146 ms 47856 KB Output is correct
44 Correct 153 ms 50308 KB Output is correct
45 Correct 198 ms 67136 KB Output is correct
46 Correct 230 ms 67108 KB Output is correct
47 Correct 213 ms 66864 KB Output is correct
48 Correct 211 ms 66460 KB Output is correct
49 Correct 220 ms 66416 KB Output is correct
50 Correct 259 ms 75004 KB Output is correct
51 Correct 269 ms 75560 KB Output is correct
52 Correct 294 ms 74624 KB Output is correct
53 Correct 258 ms 66588 KB Output is correct
54 Correct 246 ms 66432 KB Output is correct
55 Correct 237 ms 66580 KB Output is correct
56 Correct 155 ms 65940 KB Output is correct
57 Correct 146 ms 65848 KB Output is correct
58 Correct 153 ms 65908 KB Output is correct
59 Correct 149 ms 65848 KB Output is correct
60 Correct 176 ms 66048 KB Output is correct
61 Correct 172 ms 65972 KB Output is correct
62 Correct 175 ms 66020 KB Output is correct
63 Correct 153 ms 66392 KB Output is correct
64 Correct 145 ms 66388 KB Output is correct
65 Correct 179 ms 66412 KB Output is correct
66 Correct 155 ms 66468 KB Output is correct
67 Correct 2 ms 5076 KB Output is correct
68 Correct 6 ms 6708 KB Output is correct
69 Correct 6 ms 6612 KB Output is correct
70 Correct 6 ms 6656 KB Output is correct
71 Correct 304 ms 60952 KB Output is correct
72 Correct 271 ms 53336 KB Output is correct
73 Correct 368 ms 66112 KB Output is correct
74 Correct 597 ms 80084 KB Output is correct
75 Correct 563 ms 79968 KB Output is correct
76 Correct 572 ms 79992 KB Output is correct
77 Correct 449 ms 79568 KB Output is correct
78 Correct 458 ms 79500 KB Output is correct
79 Correct 455 ms 79524 KB Output is correct
80 Correct 240 ms 80060 KB Output is correct
81 Correct 225 ms 79844 KB Output is correct
82 Correct 297 ms 79976 KB Output is correct
83 Correct 321 ms 79964 KB Output is correct
84 Correct 245 ms 65204 KB Output is correct
85 Correct 221 ms 57284 KB Output is correct
86 Correct 173 ms 43424 KB Output is correct
87 Correct 312 ms 70744 KB Output is correct
88 Correct 319 ms 70716 KB Output is correct
89 Correct 318 ms 70792 KB Output is correct
90 Correct 318 ms 70732 KB Output is correct
91 Correct 322 ms 70776 KB Output is correct
92 Correct 646 ms 76588 KB Output is correct
93 Correct 638 ms 78684 KB Output is correct
94 Correct 484 ms 70936 KB Output is correct
95 Correct 477 ms 70388 KB Output is correct
96 Correct 471 ms 69856 KB Output is correct
97 Correct 481 ms 69896 KB Output is correct
98 Correct 242 ms 69244 KB Output is correct
99 Correct 224 ms 69224 KB Output is correct
100 Correct 221 ms 69248 KB Output is correct
101 Correct 220 ms 69188 KB Output is correct
102 Correct 292 ms 69384 KB Output is correct
103 Correct 293 ms 69404 KB Output is correct
104 Correct 305 ms 69372 KB Output is correct
105 Correct 223 ms 69796 KB Output is correct
106 Correct 209 ms 69760 KB Output is correct
107 Correct 216 ms 69652 KB Output is correct
108 Correct 221 ms 69756 KB Output is correct