oj.uz

답안 #767871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767871 2023-06-27T08:45:32 Z Dan4Life Two Currencies (JOI23_currencies) C++17
100 / 100
 1073 ms 246472 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
#define pb push_back
#define sz(a) (int)a.size()
const int mxN = (int)2e5+10;
const int mxN2 = mxN*320;
const int INF = (int)1e9;
const int mxLg = 18;
using ar = array<ll,2>;
 
ar seg[mxN2];
vector<ar> edge;
int n, m, q, IND=1;
int jmp[mxLg][mxN];
int lev[mxN], chkpnt[mxN];
vector<int> v[mxN], adj[mxN];
int L[mxN2], R[mxN2], ro[mxN];
 
void ae(int a, int b){ adj[a].pb(b),adj[b].pb(a); }
 
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 : adj[s]){
        if(u==p) continue;
        if(!chkpnt[u]) ro[u]=ro[s];
        else ro[u] = upd(chkpnt[u],chkpnt[u],ro[s]);
        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; ro[1]=1;
    int p, c, tot=n+1, a, b;
    for(int i = 1; i < n; i++)
        cin >> a >> b, edge.pb({a,b});
    for(int i = 1; i <= m; i++)
        cin >> p >> c, v[p-1].pb(c);
    for(int i = 0; i < n-1; i++){
        auto [a,b] = edge[i];
        if(lev[a]>lev[b]) swap(a,b);
        if(sz(v[i])==0) { ae(a,b); continue; }
        ae(a,tot);
        for(int j = 0; j < sz(v[i]); j++){
            chkpnt[tot]=v[i][j];
            if(j==sz(v[i])-1) break;
            ae(tot,tot+1), tot++;
        }
        ae(b,tot), tot++;
    }
    dfs(1,0);
    for(int i = 1; i < mxLg; i++)
        for(int j = 1; j <= tot; 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";
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 4 ms 9812 KB Output is correct
3 Correct 5 ms 9872 KB Output is correct
4 Correct 5 ms 9812 KB Output is correct
5 Correct 10 ms 14784 KB Output is correct
6 Correct 10 ms 14752 KB Output is correct
7 Correct 9 ms 13652 KB Output is correct
8 Correct 11 ms 15132 KB Output is correct
9 Correct 12 ms 15176 KB Output is correct
10 Correct 12 ms 15156 KB Output is correct
11 Correct 14 ms 15140 KB Output is correct
12 Correct 12 ms 15060 KB Output is correct
13 Correct 13 ms 15384 KB Output is correct
14 Correct 14 ms 15332 KB Output is correct
15 Correct 13 ms 15244 KB Output is correct
16 Correct 13 ms 15240 KB Output is correct
17 Correct 12 ms 15136 KB Output is correct
18 Correct 18 ms 15136 KB Output is correct
19 Correct 15 ms 15060 KB Output is correct
20 Correct 14 ms 15096 KB Output is correct
21 Correct 11 ms 15164 KB Output is correct
22 Correct 17 ms 15156 KB Output is correct
23 Correct 12 ms 15212 KB Output is correct
24 Correct 11 ms 15212 KB Output is correct
25 Correct 11 ms 15228 KB Output is correct
26 Correct 10 ms 15060 KB Output is correct
27 Correct 10 ms 15060 KB Output is correct
28 Correct 11 ms 15060 KB Output is correct
29 Correct 15 ms 15060 KB Output is correct
30 Correct 9 ms 12708 KB Output is correct
31 Correct 9 ms 12788 KB Output is correct
32 Correct 9 ms 12756 KB Output is correct
33 Correct 13 ms 15412 KB Output is correct
34 Correct 12 ms 15408 KB Output is correct
35 Correct 12 ms 15316 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 9 ms 12792 KB Output is correct
3 Correct 9 ms 12708 KB Output is correct
4 Correct 9 ms 12756 KB Output is correct
5 Correct 255 ms 138136 KB Output is correct
6 Correct 314 ms 122176 KB Output is correct
7 Correct 268 ms 106024 KB Output is correct
8 Correct 234 ms 103128 KB Output is correct
9 Correct 221 ms 109272 KB Output is correct
10 Correct 329 ms 150220 KB Output is correct
11 Correct 345 ms 147092 KB Output is correct
12 Correct 352 ms 150152 KB Output is correct
13 Correct 345 ms 150300 KB Output is correct
14 Correct 399 ms 150180 KB Output is correct
15 Correct 568 ms 161284 KB Output is correct
16 Correct 526 ms 162120 KB Output is correct
17 Correct 527 ms 160712 KB Output is correct
18 Correct 443 ms 150064 KB Output is correct
19 Correct 446 ms 149900 KB Output is correct
20 Correct 429 ms 150048 KB Output is correct
21 Correct 280 ms 150388 KB Output is correct
22 Correct 295 ms 150316 KB Output is correct
23 Correct 271 ms 150352 KB Output is correct
24 Correct 268 ms 150372 KB Output is correct
25 Correct 282 ms 152928 KB Output is correct
26 Correct 293 ms 153044 KB Output is correct
27 Correct 265 ms 152944 KB Output is correct
28 Correct 213 ms 147088 KB Output is correct
29 Correct 222 ms 150128 KB Output is correct
30 Correct 247 ms 150180 KB Output is correct
31 Correct 239 ms 150248 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 12 ms 15316 KB Output is correct
3 Correct 15 ms 15320 KB Output is correct
4 Correct 13 ms 15300 KB Output is correct
5 Correct 519 ms 174328 KB Output is correct
6 Correct 526 ms 146032 KB Output is correct
7 Correct 713 ms 219272 KB Output is correct
8 Correct 967 ms 246240 KB Output is correct
9 Correct 966 ms 246472 KB Output is correct
10 Correct 965 ms 246460 KB Output is correct
11 Correct 769 ms 246016 KB Output is correct
12 Correct 808 ms 245968 KB Output is correct
13 Correct 827 ms 245920 KB Output is correct
14 Correct 472 ms 246404 KB Output is correct
15 Correct 419 ms 246404 KB Output is correct
16 Correct 566 ms 246412 KB Output is correct
17 Correct 543 ms 246372 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 4 ms 9812 KB Output is correct
3 Correct 5 ms 9872 KB Output is correct
4 Correct 5 ms 9812 KB Output is correct
5 Correct 10 ms 14784 KB Output is correct
6 Correct 10 ms 14752 KB Output is correct
7 Correct 9 ms 13652 KB Output is correct
8 Correct 11 ms 15132 KB Output is correct
9 Correct 12 ms 15176 KB Output is correct
10 Correct 12 ms 15156 KB Output is correct
11 Correct 14 ms 15140 KB Output is correct
12 Correct 12 ms 15060 KB Output is correct
13 Correct 13 ms 15384 KB Output is correct
14 Correct 14 ms 15332 KB Output is correct
15 Correct 13 ms 15244 KB Output is correct
16 Correct 13 ms 15240 KB Output is correct
17 Correct 12 ms 15136 KB Output is correct
18 Correct 18 ms 15136 KB Output is correct
19 Correct 15 ms 15060 KB Output is correct
20 Correct 14 ms 15096 KB Output is correct
21 Correct 11 ms 15164 KB Output is correct
22 Correct 17 ms 15156 KB Output is correct
23 Correct 12 ms 15212 KB Output is correct
24 Correct 11 ms 15212 KB Output is correct
25 Correct 11 ms 15228 KB Output is correct
26 Correct 10 ms 15060 KB Output is correct
27 Correct 10 ms 15060 KB Output is correct
28 Correct 11 ms 15060 KB Output is correct
29 Correct 15 ms 15060 KB Output is correct
30 Correct 9 ms 12708 KB Output is correct
31 Correct 9 ms 12788 KB Output is correct
32 Correct 9 ms 12756 KB Output is correct
33 Correct 13 ms 15412 KB Output is correct
34 Correct 12 ms 15408 KB Output is correct
35 Correct 12 ms 15316 KB Output is correct
36 Correct 5 ms 9812 KB Output is correct
37 Correct 9 ms 12792 KB Output is correct
38 Correct 9 ms 12708 KB Output is correct
39 Correct 9 ms 12756 KB Output is correct
40 Correct 255 ms 138136 KB Output is correct
41 Correct 314 ms 122176 KB Output is correct
42 Correct 268 ms 106024 KB Output is correct
43 Correct 234 ms 103128 KB Output is correct
44 Correct 221 ms 109272 KB Output is correct
45 Correct 329 ms 150220 KB Output is correct
46 Correct 345 ms 147092 KB Output is correct
47 Correct 352 ms 150152 KB Output is correct
48 Correct 345 ms 150300 KB Output is correct
49 Correct 399 ms 150180 KB Output is correct
50 Correct 568 ms 161284 KB Output is correct
51 Correct 526 ms 162120 KB Output is correct
52 Correct 527 ms 160712 KB Output is correct
53 Correct 443 ms 150064 KB Output is correct
54 Correct 446 ms 149900 KB Output is correct
55 Correct 429 ms 150048 KB Output is correct
56 Correct 280 ms 150388 KB Output is correct
57 Correct 295 ms 150316 KB Output is correct
58 Correct 271 ms 150352 KB Output is correct
59 Correct 268 ms 150372 KB Output is correct
60 Correct 282 ms 152928 KB Output is correct
61 Correct 293 ms 153044 KB Output is correct
62 Correct 265 ms 152944 KB Output is correct
63 Correct 213 ms 147088 KB Output is correct
64 Correct 222 ms 150128 KB Output is correct
65 Correct 247 ms 150180 KB Output is correct
66 Correct 239 ms 150248 KB Output is correct
67 Correct 5 ms 9812 KB Output is correct
68 Correct 12 ms 15316 KB Output is correct
69 Correct 15 ms 15320 KB Output is correct
70 Correct 13 ms 15300 KB Output is correct
71 Correct 519 ms 174328 KB Output is correct
72 Correct 526 ms 146032 KB Output is correct
73 Correct 713 ms 219272 KB Output is correct
74 Correct 967 ms 246240 KB Output is correct
75 Correct 966 ms 246472 KB Output is correct
76 Correct 965 ms 246460 KB Output is correct
77 Correct 769 ms 246016 KB Output is correct
78 Correct 808 ms 245968 KB Output is correct
79 Correct 827 ms 245920 KB Output is correct
80 Correct 472 ms 246404 KB Output is correct
81 Correct 419 ms 246404 KB Output is correct
82 Correct 566 ms 246412 KB Output is correct
83 Correct 543 ms 246372 KB Output is correct
84 Correct 423 ms 217904 KB Output is correct
85 Correct 425 ms 194880 KB Output is correct
86 Correct 336 ms 143692 KB Output is correct
87 Correct 573 ms 234296 KB Output is correct
88 Correct 592 ms 234240 KB Output is correct
89 Correct 571 ms 234280 KB Output is correct
90 Correct 576 ms 234432 KB Output is correct
91 Correct 645 ms 234436 KB Output is correct
92 Correct 1057 ms 242156 KB Output is correct
93 Correct 1073 ms 244864 KB Output is correct
94 Correct 842 ms 234672 KB Output is correct
95 Correct 817 ms 234700 KB Output is correct
96 Correct 824 ms 234600 KB Output is correct
97 Correct 845 ms 234596 KB Output is correct
98 Correct 477 ms 234900 KB Output is correct
99 Correct 482 ms 234972 KB Output is correct
100 Correct 455 ms 234884 KB Output is correct
101 Correct 472 ms 234892 KB Output is correct
102 Correct 561 ms 237572 KB Output is correct
103 Correct 576 ms 237544 KB Output is correct
104 Correct 604 ms 237596 KB Output is correct
105 Correct 365 ms 234788 KB Output is correct
106 Correct 356 ms 234808 KB Output is correct
107 Correct 378 ms 234736 KB Output is correct
108 Correct 399 ms 234928 KB Output is correct