oj.uz

Submission #767859

# Submission time Handle Problem Language Result Execution time Memory
767859 2023-06-27T08:34:58 Z Dan4Life Two Currencies (JOI23_currencies) C++17
100 / 100
 954 ms 220208 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
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*320;
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(int 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], (ll)x/l);
        return ar({num*l,num});
    }
    int mid = (l+r)/2; ar ans = {0,0};
    int 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);
}

int32_t 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++){
        int 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(long long int, long long int)':
currencies.cpp:64:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   64 |         if(u==p) continue; ro[u] = ro[s];
      |         ^~
currencies.cpp:64:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   64 |         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 2 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5108 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 7 ms 9532 KB Output is correct
7 Correct 7 ms 8532 KB Output is correct
8 Correct 8 ms 9912 KB Output is correct
9 Correct 8 ms 10020 KB Output is correct
10 Correct 8 ms 10004 KB Output is correct
11 Correct 8 ms 9940 KB Output is correct
12 Correct 8 ms 9912 KB Output is correct
13 Correct 8 ms 10068 KB Output is correct
14 Correct 9 ms 10068 KB Output is correct
15 Correct 10 ms 10044 KB Output is correct
16 Correct 9 ms 9940 KB Output is correct
17 Correct 9 ms 10100 KB Output is correct
18 Correct 8 ms 10068 KB Output is correct
19 Correct 7 ms 9924 KB Output is correct
20 Correct 7 ms 9940 KB Output is correct
21 Correct 8 ms 9940 KB Output is correct
22 Correct 10 ms 9940 KB Output is correct
23 Correct 8 ms 9940 KB Output is correct
24 Correct 8 ms 9940 KB Output is correct
25 Correct 7 ms 9920 KB Output is correct
26 Correct 8 ms 9940 KB Output is correct
27 Correct 7 ms 9940 KB Output is correct
28 Correct 7 ms 9940 KB Output is correct
29 Correct 7 ms 9940 KB Output is correct
30 Correct 6 ms 7636 KB Output is correct
31 Correct 5 ms 7616 KB Output is correct
32 Correct 6 ms 7508 KB Output is correct
33 Correct 8 ms 10068 KB Output is correct
34 Correct 8 ms 10052 KB Output is correct
35 Correct 8 ms 10068 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 6 ms 7608 KB Output is correct
3 Correct 5 ms 7636 KB Output is correct
4 Correct 5 ms 7636 KB Output is correct
5 Correct 239 ms 118708 KB Output is correct
6 Correct 222 ms 105120 KB Output is correct
7 Correct 221 ms 91852 KB Output is correct
8 Correct 217 ms 88772 KB Output is correct
9 Correct 191 ms 94000 KB Output is correct
10 Correct 277 ms 129572 KB Output is correct
11 Correct 278 ms 126564 KB Output is correct
12 Correct 319 ms 129632 KB Output is correct
13 Correct 286 ms 129612 KB Output is correct
14 Correct 281 ms 129720 KB Output is correct
15 Correct 410 ms 135956 KB Output is correct
16 Correct 425 ms 136356 KB Output is correct
17 Correct 429 ms 135628 KB Output is correct
18 Correct 341 ms 129928 KB Output is correct
19 Correct 338 ms 129948 KB Output is correct
20 Correct 366 ms 130084 KB Output is correct
21 Correct 184 ms 128548 KB Output is correct
22 Correct 180 ms 128644 KB Output is correct
23 Correct 188 ms 128740 KB Output is correct
24 Correct 183 ms 128652 KB Output is correct
25 Correct 227 ms 129616 KB Output is correct
26 Correct 234 ms 129620 KB Output is correct
27 Correct 216 ms 129600 KB Output is correct
28 Correct 173 ms 126280 KB Output is correct
29 Correct 176 ms 129440 KB Output is correct
30 Correct 192 ms 129696 KB Output is correct
31 Correct 189 ms 129736 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 8 ms 9936 KB Output is correct
3 Correct 8 ms 10096 KB Output is correct
4 Correct 8 ms 10104 KB Output is correct
5 Correct 470 ms 155820 KB Output is correct
6 Correct 451 ms 130868 KB Output is correct
7 Correct 642 ms 194692 KB Output is correct
8 Correct 818 ms 220208 KB Output is correct
9 Correct 822 ms 220140 KB Output is correct
10 Correct 827 ms 220096 KB Output is correct
11 Correct 719 ms 219616 KB Output is correct
12 Correct 741 ms 219652 KB Output is correct
13 Correct 732 ms 219688 KB Output is correct
14 Correct 412 ms 219964 KB Output is correct
15 Correct 393 ms 220080 KB Output is correct
16 Correct 507 ms 220092 KB Output is correct
17 Correct 515 ms 220080 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 2 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5108 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 7 ms 9532 KB Output is correct
7 Correct 7 ms 8532 KB Output is correct
8 Correct 8 ms 9912 KB Output is correct
9 Correct 8 ms 10020 KB Output is correct
10 Correct 8 ms 10004 KB Output is correct
11 Correct 8 ms 9940 KB Output is correct
12 Correct 8 ms 9912 KB Output is correct
13 Correct 8 ms 10068 KB Output is correct
14 Correct 9 ms 10068 KB Output is correct
15 Correct 10 ms 10044 KB Output is correct
16 Correct 9 ms 9940 KB Output is correct
17 Correct 9 ms 10100 KB Output is correct
18 Correct 8 ms 10068 KB Output is correct
19 Correct 7 ms 9924 KB Output is correct
20 Correct 7 ms 9940 KB Output is correct
21 Correct 8 ms 9940 KB Output is correct
22 Correct 10 ms 9940 KB Output is correct
23 Correct 8 ms 9940 KB Output is correct
24 Correct 8 ms 9940 KB Output is correct
25 Correct 7 ms 9920 KB Output is correct
26 Correct 8 ms 9940 KB Output is correct
27 Correct 7 ms 9940 KB Output is correct
28 Correct 7 ms 9940 KB Output is correct
29 Correct 7 ms 9940 KB Output is correct
30 Correct 6 ms 7636 KB Output is correct
31 Correct 5 ms 7616 KB Output is correct
32 Correct 6 ms 7508 KB Output is correct
33 Correct 8 ms 10068 KB Output is correct
34 Correct 8 ms 10052 KB Output is correct
35 Correct 8 ms 10068 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 6 ms 7608 KB Output is correct
38 Correct 5 ms 7636 KB Output is correct
39 Correct 5 ms 7636 KB Output is correct
40 Correct 239 ms 118708 KB Output is correct
41 Correct 222 ms 105120 KB Output is correct
42 Correct 221 ms 91852 KB Output is correct
43 Correct 217 ms 88772 KB Output is correct
44 Correct 191 ms 94000 KB Output is correct
45 Correct 277 ms 129572 KB Output is correct
46 Correct 278 ms 126564 KB Output is correct
47 Correct 319 ms 129632 KB Output is correct
48 Correct 286 ms 129612 KB Output is correct
49 Correct 281 ms 129720 KB Output is correct
50 Correct 410 ms 135956 KB Output is correct
51 Correct 425 ms 136356 KB Output is correct
52 Correct 429 ms 135628 KB Output is correct
53 Correct 341 ms 129928 KB Output is correct
54 Correct 338 ms 129948 KB Output is correct
55 Correct 366 ms 130084 KB Output is correct
56 Correct 184 ms 128548 KB Output is correct
57 Correct 180 ms 128644 KB Output is correct
58 Correct 188 ms 128740 KB Output is correct
59 Correct 183 ms 128652 KB Output is correct
60 Correct 227 ms 129616 KB Output is correct
61 Correct 234 ms 129620 KB Output is correct
62 Correct 216 ms 129600 KB Output is correct
63 Correct 173 ms 126280 KB Output is correct
64 Correct 176 ms 129440 KB Output is correct
65 Correct 192 ms 129696 KB Output is correct
66 Correct 189 ms 129736 KB Output is correct
67 Correct 2 ms 5076 KB Output is correct
68 Correct 8 ms 9936 KB Output is correct
69 Correct 8 ms 10096 KB Output is correct
70 Correct 8 ms 10104 KB Output is correct
71 Correct 470 ms 155820 KB Output is correct
72 Correct 451 ms 130868 KB Output is correct
73 Correct 642 ms 194692 KB Output is correct
74 Correct 818 ms 220208 KB Output is correct
75 Correct 822 ms 220140 KB Output is correct
76 Correct 827 ms 220096 KB Output is correct
77 Correct 719 ms 219616 KB Output is correct
78 Correct 741 ms 219652 KB Output is correct
79 Correct 732 ms 219688 KB Output is correct
80 Correct 412 ms 219964 KB Output is correct
81 Correct 393 ms 220080 KB Output is correct
82 Correct 507 ms 220092 KB Output is correct
83 Correct 515 ms 220080 KB Output is correct
84 Correct 352 ms 197620 KB Output is correct
85 Correct 324 ms 176440 KB Output is correct
86 Correct 319 ms 129908 KB Output is correct
87 Correct 490 ms 213480 KB Output is correct
88 Correct 473 ms 213408 KB Output is correct
89 Correct 475 ms 213412 KB Output is correct
90 Correct 475 ms 213400 KB Output is correct
91 Correct 489 ms 213328 KB Output is correct
92 Correct 880 ms 217948 KB Output is correct
93 Correct 954 ms 219344 KB Output is correct
94 Correct 702 ms 213840 KB Output is correct
95 Correct 700 ms 213884 KB Output is correct
96 Correct 693 ms 213992 KB Output is correct
97 Correct 683 ms 213820 KB Output is correct
98 Correct 345 ms 212540 KB Output is correct
99 Correct 347 ms 212424 KB Output is correct
100 Correct 351 ms 212504 KB Output is correct
101 Correct 352 ms 212516 KB Output is correct
102 Correct 472 ms 213352 KB Output is correct
103 Correct 512 ms 213316 KB Output is correct
104 Correct 468 ms 213272 KB Output is correct
105 Correct 294 ms 213476 KB Output is correct
106 Correct 287 ms 213544 KB Output is correct
107 Correct 342 ms 213392 KB Output is correct
108 Correct 308 ms 213544 KB Output is correct