oj.uz

Submission #866812

# Submission time Handle Problem Language Result Execution time Memory
866812 2023-10-27T07:39:28 Z imarn Two Currencies (JOI23_currencies) C++14
100 / 100
 639 ms 144560 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define vi vector<ll>
using namespace std;
const int N=1e5+5;
struct node{
    ll cnt,tt;
    node *l,*r;
    node (ll x=0,ll y=0) : cnt(x),tt(y),l(NULL),r(NULL){};
    node (node* le,node*re) : cnt(le->cnt+re->cnt),tt(le->tt+re->tt),l(le),r(re){};
};
vector<pair<int,vi>>g[N];
pii road[N];
vi w[N];
vi we;int M;
node *root[N];
int pr[N][20]{0};
int dep[N]{0};
node* build(int l,int r){
    if(l==r)return new node();
    int m=(l+r)>>1;
    return new node(build(l,m),build(m+1,r));
}
node* upd(node*t,int l,int r,int pos,ll val){
    if(l==r){
        return new node(t->cnt+1,t->tt+val);
    }int m=(l+r)>>1;
    if(m>=pos)return new node(upd(t->l,l,m,pos,val),t->r);
    else return new node(t->l,upd(t->r,m+1,r,pos,val));
}
void dfs(int u,int p,int l){
    pr[u][0]=p;
    dep[u]=l;
    for(auto v:g[u]){
        if(v.f==p)continue;
        root[v.f]=root[u];
        for(auto it : v.s)root[v.f]=upd(root[v.f],1,M,lower_bound(all(we),it)-we.begin()+1,it);
        dfs(v.f,u,l+1);
    }
}
int lc(int a,int b){
    if(dep[a]>dep[b])swap(a,b);
    for(int i=19;i>=0;i--)if(dep[b]-(1<<i)>=dep[a])b=pr[b][i];
    if(a==b)return a;
    for(int i=19;i>=0;i--)if(pr[a][i]!=pr[b][i])a=pr[a][i],b=pr[b][i];
    return pr[a][0];
}
int qr(node*tl,node*tr,node*ta,int l,int r,ll k){
    if(l==r){
        return min(k,tl->tt+tr->tt-2*ta->tt)/we[l-1];
    }
    int m=(l+r)>>1;
    ll lcnt=tl->l->tt+tr->l->tt-2*ta->l->tt;//cout<<lcnt<<" "<<tl->cnt+tr->cnt-2*ta->cnt<<"\n";
    if(lcnt>k)return qr(tl->l,tr->l,ta->l,l,m,k);
    else return tl->l->cnt+tr->l->cnt-2*ta->l->cnt+qr(tl->r,tr->r,ta->r,m+1,r,k-lcnt);
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m,q;cin>>n>>m>>q;M=m;
    for(int i=1;i<=n-1;i++)cin>>road[i].f>>road[i].s;
    for(int i=0;i<m;i++){
        int p;ll c;cin>>p>>c;
        we.pb(c);w[p].pb(c);
    }sort(we.begin(),we.end());
    for(int i=1;i<=n-1;i++){
        g[road[i].f].pb({road[i].s,w[i]});
        g[road[i].s].pb({road[i].f,w[i]});
    }
    root[1]=build(1,m);
    dfs(1,1,0);
    for(int j=1;j<20;j++)for(int i=1;i<=n;i++)pr[i][j]=pr[pr[i][j-1]][j-1];
    while(q--){
        int u,v;ll x,y;cin>>u>>v>>x>>y;
        int lca=lc(u,v);
        int all = root[u]->cnt+root[v]->cnt-2*root[lca]->cnt;
        int cur = qr(root[u],root[v],root[lca],1,m,y);
        cout<<(x+cur-all>=0?x+cur-all:-1)<<"\n";
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 7 ms 12376 KB Output is correct
7 Correct 5 ms 11692 KB Output is correct
8 Correct 6 ms 12280 KB Output is correct
9 Correct 6 ms 12380 KB Output is correct
10 Correct 6 ms 12380 KB Output is correct
11 Correct 6 ms 12380 KB Output is correct
12 Correct 6 ms 12380 KB Output is correct
13 Correct 6 ms 12636 KB Output is correct
14 Correct 7 ms 12380 KB Output is correct
15 Correct 6 ms 12492 KB Output is correct
16 Correct 6 ms 12380 KB Output is correct
17 Correct 6 ms 12376 KB Output is correct
18 Correct 6 ms 12380 KB Output is correct
19 Correct 6 ms 12124 KB Output is correct
20 Correct 6 ms 12380 KB Output is correct
21 Correct 6 ms 12132 KB Output is correct
22 Correct 6 ms 12124 KB Output is correct
23 Correct 6 ms 12124 KB Output is correct
24 Correct 6 ms 12380 KB Output is correct
25 Correct 6 ms 12124 KB Output is correct
26 Correct 5 ms 12264 KB Output is correct
27 Correct 6 ms 12380 KB Output is correct
28 Correct 5 ms 12204 KB Output is correct
29 Correct 5 ms 12376 KB Output is correct
30 Correct 5 ms 12380 KB Output is correct
31 Correct 7 ms 12380 KB Output is correct
32 Correct 5 ms 12376 KB Output is correct
33 Correct 6 ms 12632 KB Output is correct
34 Correct 6 ms 12636 KB Output is correct
35 Correct 6 ms 12464 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 5 ms 12124 KB Output is correct
3 Correct 6 ms 12124 KB Output is correct
4 Correct 5 ms 12124 KB Output is correct
5 Correct 222 ms 114444 KB Output is correct
6 Correct 242 ms 103608 KB Output is correct
7 Correct 210 ms 89300 KB Output is correct
8 Correct 175 ms 83208 KB Output is correct
9 Correct 177 ms 91332 KB Output is correct
10 Correct 270 ms 124560 KB Output is correct
11 Correct 263 ms 124596 KB Output is correct
12 Correct 293 ms 124552 KB Output is correct
13 Correct 268 ms 124556 KB Output is correct
14 Correct 269 ms 124752 KB Output is correct
15 Correct 328 ms 139332 KB Output is correct
16 Correct 328 ms 140200 KB Output is correct
17 Correct 332 ms 138764 KB Output is correct
18 Correct 335 ms 124992 KB Output is correct
19 Correct 304 ms 124888 KB Output is correct
20 Correct 309 ms 124864 KB Output is correct
21 Correct 232 ms 123852 KB Output is correct
22 Correct 238 ms 123664 KB Output is correct
23 Correct 245 ms 123716 KB Output is correct
24 Correct 245 ms 124488 KB Output is correct
25 Correct 240 ms 123588 KB Output is correct
26 Correct 254 ms 123588 KB Output is correct
27 Correct 268 ms 123456 KB Output is correct
28 Correct 232 ms 124780 KB Output is correct
29 Correct 215 ms 124612 KB Output is correct
30 Correct 214 ms 124664 KB Output is correct
31 Correct 228 ms 124612 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 6 ms 12604 KB Output is correct
3 Correct 6 ms 12544 KB Output is correct
4 Correct 8 ms 12636 KB Output is correct
5 Correct 313 ms 104632 KB Output is correct
6 Correct 276 ms 90316 KB Output is correct
7 Correct 465 ms 124356 KB Output is correct
8 Correct 527 ms 144328 KB Output is correct
9 Correct 535 ms 144560 KB Output is correct
10 Correct 524 ms 144516 KB Output is correct
11 Correct 459 ms 142720 KB Output is correct
12 Correct 513 ms 142768 KB Output is correct
13 Correct 467 ms 143040 KB Output is correct
14 Correct 305 ms 144236 KB Output is correct
15 Correct 333 ms 144308 KB Output is correct
16 Correct 353 ms 144484 KB Output is correct
17 Correct 340 ms 144220 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 7 ms 12376 KB Output is correct
7 Correct 5 ms 11692 KB Output is correct
8 Correct 6 ms 12280 KB Output is correct
9 Correct 6 ms 12380 KB Output is correct
10 Correct 6 ms 12380 KB Output is correct
11 Correct 6 ms 12380 KB Output is correct
12 Correct 6 ms 12380 KB Output is correct
13 Correct 6 ms 12636 KB Output is correct
14 Correct 7 ms 12380 KB Output is correct
15 Correct 6 ms 12492 KB Output is correct
16 Correct 6 ms 12380 KB Output is correct
17 Correct 6 ms 12376 KB Output is correct
18 Correct 6 ms 12380 KB Output is correct
19 Correct 6 ms 12124 KB Output is correct
20 Correct 6 ms 12380 KB Output is correct
21 Correct 6 ms 12132 KB Output is correct
22 Correct 6 ms 12124 KB Output is correct
23 Correct 6 ms 12124 KB Output is correct
24 Correct 6 ms 12380 KB Output is correct
25 Correct 6 ms 12124 KB Output is correct
26 Correct 5 ms 12264 KB Output is correct
27 Correct 6 ms 12380 KB Output is correct
28 Correct 5 ms 12204 KB Output is correct
29 Correct 5 ms 12376 KB Output is correct
30 Correct 5 ms 12380 KB Output is correct
31 Correct 7 ms 12380 KB Output is correct
32 Correct 5 ms 12376 KB Output is correct
33 Correct 6 ms 12632 KB Output is correct
34 Correct 6 ms 12636 KB Output is correct
35 Correct 6 ms 12464 KB Output is correct
36 Correct 2 ms 10584 KB Output is correct
37 Correct 5 ms 12124 KB Output is correct
38 Correct 6 ms 12124 KB Output is correct
39 Correct 5 ms 12124 KB Output is correct
40 Correct 222 ms 114444 KB Output is correct
41 Correct 242 ms 103608 KB Output is correct
42 Correct 210 ms 89300 KB Output is correct
43 Correct 175 ms 83208 KB Output is correct
44 Correct 177 ms 91332 KB Output is correct
45 Correct 270 ms 124560 KB Output is correct
46 Correct 263 ms 124596 KB Output is correct
47 Correct 293 ms 124552 KB Output is correct
48 Correct 268 ms 124556 KB Output is correct
49 Correct 269 ms 124752 KB Output is correct
50 Correct 328 ms 139332 KB Output is correct
51 Correct 328 ms 140200 KB Output is correct
52 Correct 332 ms 138764 KB Output is correct
53 Correct 335 ms 124992 KB Output is correct
54 Correct 304 ms 124888 KB Output is correct
55 Correct 309 ms 124864 KB Output is correct
56 Correct 232 ms 123852 KB Output is correct
57 Correct 238 ms 123664 KB Output is correct
58 Correct 245 ms 123716 KB Output is correct
59 Correct 245 ms 124488 KB Output is correct
60 Correct 240 ms 123588 KB Output is correct
61 Correct 254 ms 123588 KB Output is correct
62 Correct 268 ms 123456 KB Output is correct
63 Correct 232 ms 124780 KB Output is correct
64 Correct 215 ms 124612 KB Output is correct
65 Correct 214 ms 124664 KB Output is correct
66 Correct 228 ms 124612 KB Output is correct
67 Correct 2 ms 10588 KB Output is correct
68 Correct 6 ms 12604 KB Output is correct
69 Correct 6 ms 12544 KB Output is correct
70 Correct 8 ms 12636 KB Output is correct
71 Correct 313 ms 104632 KB Output is correct
72 Correct 276 ms 90316 KB Output is correct
73 Correct 465 ms 124356 KB Output is correct
74 Correct 527 ms 144328 KB Output is correct
75 Correct 535 ms 144560 KB Output is correct
76 Correct 524 ms 144516 KB Output is correct
77 Correct 459 ms 142720 KB Output is correct
78 Correct 513 ms 142768 KB Output is correct
79 Correct 467 ms 143040 KB Output is correct
80 Correct 305 ms 144236 KB Output is correct
81 Correct 333 ms 144308 KB Output is correct
82 Correct 353 ms 144484 KB Output is correct
83 Correct 340 ms 144220 KB Output is correct
84 Correct 329 ms 118724 KB Output is correct
85 Correct 261 ms 106564 KB Output is correct
86 Correct 227 ms 79372 KB Output is correct
87 Correct 386 ms 128332 KB Output is correct
88 Correct 357 ms 128452 KB Output is correct
89 Correct 381 ms 128360 KB Output is correct
90 Correct 374 ms 128200 KB Output is correct
91 Correct 367 ms 128472 KB Output is correct
92 Correct 639 ms 138904 KB Output is correct
93 Correct 618 ms 142252 KB Output is correct
94 Correct 501 ms 129140 KB Output is correct
95 Correct 520 ms 129260 KB Output is correct
96 Correct 507 ms 128876 KB Output is correct
97 Correct 494 ms 128968 KB Output is correct
98 Correct 319 ms 126900 KB Output is correct
99 Correct 348 ms 127680 KB Output is correct
100 Correct 327 ms 127936 KB Output is correct
101 Correct 320 ms 127292 KB Output is correct
102 Correct 378 ms 127640 KB Output is correct
103 Correct 341 ms 127756 KB Output is correct
104 Correct 371 ms 127484 KB Output is correct
105 Correct 288 ms 128392 KB Output is correct
106 Correct 267 ms 128456 KB Output is correct
107 Correct 304 ms 128196 KB Output is correct
108 Correct 272 ms 128196 KB Output is correct