oj.uz

답안 #767896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767896 2023-06-27T09:11:57 Z Dan4Life Two Currencies (JOI23_currencies) C++17
100 / 100
 846 ms 165544 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ar = array<ll,2>;
#define pb push_back
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));
}
 
ll query(ll x, int p1, int p2, int p3, int l=1, int r=INF){
    if(l==r) return min(seg[p1][1]+seg[p2][1]-2*seg[p3][1], x/l);
    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,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))) << "\n";
    }
}

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 6 ms 8440 KB Output is correct
6 Correct 7 ms 8404 KB Output is correct
7 Correct 6 ms 7708 KB Output is correct
8 Correct 7 ms 8660 KB Output is correct
9 Correct 7 ms 8756 KB Output is correct
10 Correct 8 ms 8660 KB Output is correct
11 Correct 8 ms 8660 KB Output is correct
12 Correct 8 ms 8660 KB Output is correct
13 Correct 8 ms 8916 KB Output is correct
14 Correct 12 ms 8888 KB Output is correct
15 Correct 8 ms 8756 KB Output is correct
16 Correct 8 ms 8788 KB Output is correct
17 Correct 8 ms 8788 KB Output is correct
18 Correct 8 ms 8788 KB Output is correct
19 Correct 7 ms 8660 KB Output is correct
20 Correct 7 ms 8628 KB Output is correct
21 Correct 7 ms 8660 KB Output is correct
22 Correct 7 ms 8660 KB Output is correct
23 Correct 11 ms 8680 KB Output is correct
24 Correct 8 ms 8660 KB Output is correct
25 Correct 7 ms 8660 KB Output is correct
26 Correct 7 ms 8764 KB Output is correct
27 Correct 7 ms 8768 KB Output is correct
28 Correct 7 ms 8704 KB Output is correct
29 Correct 7 ms 8636 KB Output is correct
30 Correct 6 ms 6868 KB Output is correct
31 Correct 7 ms 6860 KB Output is correct
32 Correct 6 ms 6968 KB Output is correct
33 Correct 9 ms 8844 KB Output is correct
34 Correct 8 ms 8920 KB Output is correct
35 Correct 8 ms 8888 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 6 ms 6852 KB Output is correct
3 Correct 7 ms 6868 KB Output is correct
4 Correct 6 ms 6868 KB Output is correct
5 Correct 237 ms 85480 KB Output is correct
6 Correct 223 ms 75852 KB Output is correct
7 Correct 203 ms 65540 KB Output is correct
8 Correct 166 ms 63696 KB Output is correct
9 Correct 169 ms 67580 KB Output is correct
10 Correct 257 ms 93132 KB Output is correct
11 Correct 265 ms 90748 KB Output is correct
12 Correct 253 ms 93108 KB Output is correct
13 Correct 261 ms 93388 KB Output is correct
14 Correct 247 ms 93112 KB Output is correct
15 Correct 356 ms 101752 KB Output is correct
16 Correct 369 ms 102272 KB Output is correct
17 Correct 411 ms 101356 KB Output is correct
18 Correct 292 ms 93248 KB Output is correct
19 Correct 315 ms 93152 KB Output is correct
20 Correct 309 ms 93244 KB Output is correct
21 Correct 174 ms 92636 KB Output is correct
22 Correct 182 ms 92668 KB Output is correct
23 Correct 208 ms 92604 KB Output is correct
24 Correct 204 ms 92592 KB Output is correct
25 Correct 216 ms 92728 KB Output is correct
26 Correct 216 ms 92636 KB Output is correct
27 Correct 199 ms 92696 KB Output is correct
28 Correct 195 ms 90720 KB Output is correct
29 Correct 170 ms 93080 KB Output is correct
30 Correct 188 ms 93104 KB Output is correct
31 Correct 181 ms 93156 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 8 ms 8916 KB Output is correct
3 Correct 10 ms 8820 KB Output is correct
4 Correct 8 ms 8900 KB Output is correct
5 Correct 415 ms 117904 KB Output is correct
6 Correct 408 ms 99284 KB Output is correct
7 Correct 537 ms 145600 KB Output is correct
8 Correct 762 ms 165408 KB Output is correct
9 Correct 788 ms 165460 KB Output is correct
10 Correct 785 ms 165544 KB Output is correct
11 Correct 628 ms 164984 KB Output is correct
12 Correct 651 ms 164912 KB Output is correct
13 Correct 650 ms 164936 KB Output is correct
14 Correct 382 ms 165328 KB Output is correct
15 Correct 341 ms 165380 KB Output is correct
16 Correct 446 ms 165432 KB Output is correct
17 Correct 431 ms 165340 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 6 ms 8440 KB Output is correct
6 Correct 7 ms 8404 KB Output is correct
7 Correct 6 ms 7708 KB Output is correct
8 Correct 7 ms 8660 KB Output is correct
9 Correct 7 ms 8756 KB Output is correct
10 Correct 8 ms 8660 KB Output is correct
11 Correct 8 ms 8660 KB Output is correct
12 Correct 8 ms 8660 KB Output is correct
13 Correct 8 ms 8916 KB Output is correct
14 Correct 12 ms 8888 KB Output is correct
15 Correct 8 ms 8756 KB Output is correct
16 Correct 8 ms 8788 KB Output is correct
17 Correct 8 ms 8788 KB Output is correct
18 Correct 8 ms 8788 KB Output is correct
19 Correct 7 ms 8660 KB Output is correct
20 Correct 7 ms 8628 KB Output is correct
21 Correct 7 ms 8660 KB Output is correct
22 Correct 7 ms 8660 KB Output is correct
23 Correct 11 ms 8680 KB Output is correct
24 Correct 8 ms 8660 KB Output is correct
25 Correct 7 ms 8660 KB Output is correct
26 Correct 7 ms 8764 KB Output is correct
27 Correct 7 ms 8768 KB Output is correct
28 Correct 7 ms 8704 KB Output is correct
29 Correct 7 ms 8636 KB Output is correct
30 Correct 6 ms 6868 KB Output is correct
31 Correct 7 ms 6860 KB Output is correct
32 Correct 6 ms 6968 KB Output is correct
33 Correct 9 ms 8844 KB Output is correct
34 Correct 8 ms 8920 KB Output is correct
35 Correct 8 ms 8888 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 6 ms 6852 KB Output is correct
38 Correct 7 ms 6868 KB Output is correct
39 Correct 6 ms 6868 KB Output is correct
40 Correct 237 ms 85480 KB Output is correct
41 Correct 223 ms 75852 KB Output is correct
42 Correct 203 ms 65540 KB Output is correct
43 Correct 166 ms 63696 KB Output is correct
44 Correct 169 ms 67580 KB Output is correct
45 Correct 257 ms 93132 KB Output is correct
46 Correct 265 ms 90748 KB Output is correct
47 Correct 253 ms 93108 KB Output is correct
48 Correct 261 ms 93388 KB Output is correct
49 Correct 247 ms 93112 KB Output is correct
50 Correct 356 ms 101752 KB Output is correct
51 Correct 369 ms 102272 KB Output is correct
52 Correct 411 ms 101356 KB Output is correct
53 Correct 292 ms 93248 KB Output is correct
54 Correct 315 ms 93152 KB Output is correct
55 Correct 309 ms 93244 KB Output is correct
56 Correct 174 ms 92636 KB Output is correct
57 Correct 182 ms 92668 KB Output is correct
58 Correct 208 ms 92604 KB Output is correct
59 Correct 204 ms 92592 KB Output is correct
60 Correct 216 ms 92728 KB Output is correct
61 Correct 216 ms 92636 KB Output is correct
62 Correct 199 ms 92696 KB Output is correct
63 Correct 195 ms 90720 KB Output is correct
64 Correct 170 ms 93080 KB Output is correct
65 Correct 188 ms 93104 KB Output is correct
66 Correct 181 ms 93156 KB Output is correct
67 Correct 3 ms 5076 KB Output is correct
68 Correct 8 ms 8916 KB Output is correct
69 Correct 10 ms 8820 KB Output is correct
70 Correct 8 ms 8900 KB Output is correct
71 Correct 415 ms 117904 KB Output is correct
72 Correct 408 ms 99284 KB Output is correct
73 Correct 537 ms 145600 KB Output is correct
74 Correct 762 ms 165408 KB Output is correct
75 Correct 788 ms 165460 KB Output is correct
76 Correct 785 ms 165544 KB Output is correct
77 Correct 628 ms 164984 KB Output is correct
78 Correct 651 ms 164912 KB Output is correct
79 Correct 650 ms 164936 KB Output is correct
80 Correct 382 ms 165328 KB Output is correct
81 Correct 341 ms 165380 KB Output is correct
82 Correct 446 ms 165432 KB Output is correct
83 Correct 431 ms 165340 KB Output is correct
84 Correct 317 ms 145400 KB Output is correct
85 Correct 311 ms 130280 KB Output is correct
86 Correct 249 ms 95616 KB Output is correct
87 Correct 489 ms 156344 KB Output is correct
88 Correct 427 ms 156316 KB Output is correct
89 Correct 475 ms 156204 KB Output is correct
90 Correct 435 ms 156228 KB Output is correct
91 Correct 434 ms 156236 KB Output is correct
92 Correct 846 ms 162028 KB Output is correct
93 Correct 814 ms 163848 KB Output is correct
94 Correct 634 ms 156108 KB Output is correct
95 Correct 650 ms 156100 KB Output is correct
96 Correct 653 ms 156080 KB Output is correct
97 Correct 638 ms 156248 KB Output is correct
98 Correct 343 ms 155556 KB Output is correct
99 Correct 314 ms 155480 KB Output is correct
100 Correct 326 ms 155652 KB Output is correct
101 Correct 339 ms 155580 KB Output is correct
102 Correct 439 ms 155560 KB Output is correct
103 Correct 412 ms 155580 KB Output is correct
104 Correct 434 ms 155592 KB Output is correct
105 Correct 294 ms 155980 KB Output is correct
106 Correct 282 ms 156300 KB Output is correct
107 Correct 301 ms 155984 KB Output is correct
108 Correct 322 ms 156104 KB Output is correct