oj.uz

Submission #787307

# Submission time Handle Problem Language Result Execution time Memory
787307 2023-07-19T04:28:13 Z winter0101 Two Currencies (JOI23_currencies) C++14
100 / 100
 719 ms 53652 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,f,g) for (int i=f;i<=g;i++)
#define for2(i,f,g) for (int i=f;i>=g;i--)
#define for3(i,f,g,h) for(int i=f;i<=g;i+=h)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=1e5+9;
int n,m,q;
struct edg1{
int u,v,w;
}cp[maxn];
struct edg{
int v,w;
};
vector<edg>a[maxn];
struct checkpoint{
int p;
long long c;
bool operator < (const checkpoint &pp){
return c<pp.c;
}
}b[maxn];
int in[maxn];
int out[maxn];
int dep[maxn];
int rm[maxn][19];
int dis[maxn];
int tme=0;
void dfs(int u,int par){
in[u]=++tme;
for (auto v:a[u]){
    if (v.v==par)continue;
    rm[v.v][0]=u;
    dis[v.v]=dis[u]+1;
    for1(i,1,18){
    rm[v.v][i]=rm[rm[v.v][i-1]][i-1];
    }
    dep[v.v]=dep[u]+v.w;
    //cerr<<u<<" "<<v.v<<" "<<v.w<<'\n';
    dfs(v.v,u);
}
out[u]=tme;
}
int lca(int u,int v){
if (dis[u]<dis[v])swap(u,v);
int k=dis[u]-dis[v];
for1(i,0,18){
if (k>>i&1)u=rm[u][i];
}
if (u==v)return u;
for2(i,18,0){
if (!rm[u][i]||!rm[v][i])continue;
if (rm[u][i]!=rm[v][i]){
    u=rm[u][i];
    v=rm[v][i];
}
}
return rm[u][0];
}
pli bit[maxn];
void add(int u,long long val){
for (;u<=n;u+=(u-(u&(u-1)))){
bit[u].fi+=val;
if (val>0)bit[u].se++;
else bit[u].se--;
}
}
pli get(int u){
pli sum;
for (;u>=1;u-=(u-(u&(u-1)))){
    sum.fi+=bit[u].fi;
    sum.se+=bit[u].se;
}
return sum;
}
int s[maxn];
int t[maxn];
long long x[maxn];
long long y[maxn];
int par[maxn];
struct cnp{
long long l,r,num,ans,cost;
cnp(){
l=1,r=1e9,num=0,ans=0,cost=0;
}
}d[maxn];
struct query{
long long mid;
int id;
bool operator < (const query &p){
return mid<p.mid;
}
};
vector<int>ver[maxn];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("usaco.INP","r",stdin);
    //freopen("usaco.OUT","w",stdout);
    cin>>n>>m>>q;
    map<int,int>nenso;
    vector<int>nen;
    nen.pb(0);
    for1(i,1,n-1){
    int u,v;
    cin>>u>>v;
    cp[i].u=u,cp[i].v=v;
    cp[i].w=0;
    }
    for1(i,1,m){
    cin>>b[i].p>>b[i].c;
    nen.pb(b[i].c);
    cp[b[i].p].w++;
    //cerr<<b[i].p<<'\n';
    }
    sort(all(nen));
    for1(i,1,sz(nen)-1){
    if (nen[i]>nen[i-1]){
        nenso[nen[i]]=nenso[nen[i-1]]+1;
    }
    }
    for1(i,1,m){
    ver[nenso[b[i].c]].pb(i);
    }
    //cout<<cp[2].u<<" "<<cp[2].v<<'\n';
    for1(i,1,n-1){
    a[cp[i].u].pb({cp[i].v,cp[i].w});
    a[cp[i].v].pb({cp[i].u,cp[i].w});
    }
    dfs(1,0);
    for1(i,1,n-1){
    if (in[cp[i].u]>in[cp[i].v])swap(cp[i].u,cp[i].v);
    }
    for1(i,1,q){
    cin>>s[i]>>t[i]>>x[i]>>y[i];
    par[i]=lca(s[i],t[i]);
    d[i].l=1;
    d[i].r=sz(nen)-1;
    }
    sort(b+1,b+1+m);
    while (true){
        vector<query>pr;
        for1(i,1,q){
        if (d[i].l<=d[i].r){
            pr.pb({(d[i].l+d[i].r)/2,i});
        }
        }
        if (pr.empty())break;
        sort(all(pr));
        int nw=0;
        for1(i,1,n)bit[i].fi=bit[i].se=0;
        for (auto v:pr){
            for1(i,nw+1,v.mid){
            int id=b[i].p;
            add(in[cp[id].v],b[i].c);
            add(out[cp[id].v]+1,-b[i].c);
            }
            nw=v.mid;
            pli t1=get(in[s[v.id]]);
            pli t2=get(in[t[v.id]]);
            pli t3=get(in[par[v.id]]);
            pli temp;
            temp.fi=t1.fi+t2.fi-2*t3.fi;
            temp.se=t1.se+t2.se-2*t3.se;
            //cout<<d[v.id].l<<" "<<d[v.id].r<<" "<<v.mid<<" "<<temp.fi<<" "<<temp.se<<'\n';
            if (temp.fi<=y[v.id]){
            d[v.id].l=v.mid+1;
            d[v.id].num=temp.se;
            d[v.id].ans=nen[v.mid];
            d[v.id].cost=temp.fi;
            }
            else {
            d[v.id].r=v.mid-1;
            }
        }
    }
    for1(i,1,q){
    long long num=dep[s[i]]+dep[t[i]]-2*dep[par[i]]-d[i].num;
    if (num>x[i])cout<<-1<<'\n';
    else cout<<x[i]-num<<'\n';
    }


}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 4 ms 8940 KB Output is correct
4 Correct 4 ms 8944 KB Output is correct
5 Correct 8 ms 9592 KB Output is correct
6 Correct 10 ms 9600 KB Output is correct
7 Correct 8 ms 9544 KB Output is correct
8 Correct 9 ms 9684 KB Output is correct
9 Correct 9 ms 9596 KB Output is correct
10 Correct 10 ms 9684 KB Output is correct
11 Correct 9 ms 9592 KB Output is correct
12 Correct 9 ms 9708 KB Output is correct
13 Correct 9 ms 9840 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9684 KB Output is correct
16 Correct 14 ms 9768 KB Output is correct
17 Correct 9 ms 9716 KB Output is correct
18 Correct 9 ms 9724 KB Output is correct
19 Correct 9 ms 9672 KB Output is correct
20 Correct 9 ms 9600 KB Output is correct
21 Correct 8 ms 9592 KB Output is correct
22 Correct 10 ms 9712 KB Output is correct
23 Correct 9 ms 9632 KB Output is correct
24 Correct 9 ms 9596 KB Output is correct
25 Correct 10 ms 9684 KB Output is correct
26 Correct 8 ms 9684 KB Output is correct
27 Correct 8 ms 9684 KB Output is correct
28 Correct 9 ms 9680 KB Output is correct
29 Correct 8 ms 9684 KB Output is correct
30 Correct 9 ms 9556 KB Output is correct
31 Correct 9 ms 9556 KB Output is correct
32 Correct 10 ms 9560 KB Output is correct
33 Correct 8 ms 9856 KB Output is correct
34 Correct 9 ms 9856 KB Output is correct
35 Correct 9 ms 9812 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8944 KB Output is correct
2 Correct 10 ms 9556 KB Output is correct
3 Correct 11 ms 9556 KB Output is correct
4 Correct 9 ms 9496 KB Output is correct
5 Correct 377 ms 34468 KB Output is correct
6 Correct 457 ms 32424 KB Output is correct
7 Correct 433 ms 33848 KB Output is correct
8 Correct 359 ms 32668 KB Output is correct
9 Correct 338 ms 31396 KB Output is correct
10 Correct 535 ms 38276 KB Output is correct
11 Correct 535 ms 38320 KB Output is correct
12 Correct 560 ms 38312 KB Output is correct
13 Correct 547 ms 38304 KB Output is correct
14 Correct 543 ms 38288 KB Output is correct
15 Correct 617 ms 45520 KB Output is correct
16 Correct 589 ms 45960 KB Output is correct
17 Correct 614 ms 45052 KB Output is correct
18 Correct 636 ms 38140 KB Output is correct
19 Correct 653 ms 38124 KB Output is correct
20 Correct 662 ms 38228 KB Output is correct
21 Correct 536 ms 37856 KB Output is correct
22 Correct 497 ms 38032 KB Output is correct
23 Correct 535 ms 38076 KB Output is correct
24 Correct 491 ms 38020 KB Output is correct
25 Correct 498 ms 38596 KB Output is correct
26 Correct 457 ms 38604 KB Output is correct
27 Correct 509 ms 38584 KB Output is correct
28 Correct 404 ms 38120 KB Output is correct
29 Correct 424 ms 38200 KB Output is correct
30 Correct 428 ms 38356 KB Output is correct
31 Correct 445 ms 38360 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 9 ms 9820 KB Output is correct
3 Correct 9 ms 9812 KB Output is correct
4 Correct 10 ms 9812 KB Output is correct
5 Correct 373 ms 45064 KB Output is correct
6 Correct 343 ms 44288 KB Output is correct
7 Correct 482 ms 41200 KB Output is correct
8 Correct 575 ms 53600 KB Output is correct
9 Correct 663 ms 53600 KB Output is correct
10 Correct 596 ms 53616 KB Output is correct
11 Correct 530 ms 53536 KB Output is correct
12 Correct 512 ms 53568 KB Output is correct
13 Correct 531 ms 53652 KB Output is correct
14 Correct 435 ms 53436 KB Output is correct
15 Correct 438 ms 53492 KB Output is correct
16 Correct 479 ms 53556 KB Output is correct
17 Correct 541 ms 53508 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 4 ms 8940 KB Output is correct
4 Correct 4 ms 8944 KB Output is correct
5 Correct 8 ms 9592 KB Output is correct
6 Correct 10 ms 9600 KB Output is correct
7 Correct 8 ms 9544 KB Output is correct
8 Correct 9 ms 9684 KB Output is correct
9 Correct 9 ms 9596 KB Output is correct
10 Correct 10 ms 9684 KB Output is correct
11 Correct 9 ms 9592 KB Output is correct
12 Correct 9 ms 9708 KB Output is correct
13 Correct 9 ms 9840 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9684 KB Output is correct
16 Correct 14 ms 9768 KB Output is correct
17 Correct 9 ms 9716 KB Output is correct
18 Correct 9 ms 9724 KB Output is correct
19 Correct 9 ms 9672 KB Output is correct
20 Correct 9 ms 9600 KB Output is correct
21 Correct 8 ms 9592 KB Output is correct
22 Correct 10 ms 9712 KB Output is correct
23 Correct 9 ms 9632 KB Output is correct
24 Correct 9 ms 9596 KB Output is correct
25 Correct 10 ms 9684 KB Output is correct
26 Correct 8 ms 9684 KB Output is correct
27 Correct 8 ms 9684 KB Output is correct
28 Correct 9 ms 9680 KB Output is correct
29 Correct 8 ms 9684 KB Output is correct
30 Correct 9 ms 9556 KB Output is correct
31 Correct 9 ms 9556 KB Output is correct
32 Correct 10 ms 9560 KB Output is correct
33 Correct 8 ms 9856 KB Output is correct
34 Correct 9 ms 9856 KB Output is correct
35 Correct 9 ms 9812 KB Output is correct
36 Correct 4 ms 8944 KB Output is correct
37 Correct 10 ms 9556 KB Output is correct
38 Correct 11 ms 9556 KB Output is correct
39 Correct 9 ms 9496 KB Output is correct
40 Correct 377 ms 34468 KB Output is correct
41 Correct 457 ms 32424 KB Output is correct
42 Correct 433 ms 33848 KB Output is correct
43 Correct 359 ms 32668 KB Output is correct
44 Correct 338 ms 31396 KB Output is correct
45 Correct 535 ms 38276 KB Output is correct
46 Correct 535 ms 38320 KB Output is correct
47 Correct 560 ms 38312 KB Output is correct
48 Correct 547 ms 38304 KB Output is correct
49 Correct 543 ms 38288 KB Output is correct
50 Correct 617 ms 45520 KB Output is correct
51 Correct 589 ms 45960 KB Output is correct
52 Correct 614 ms 45052 KB Output is correct
53 Correct 636 ms 38140 KB Output is correct
54 Correct 653 ms 38124 KB Output is correct
55 Correct 662 ms 38228 KB Output is correct
56 Correct 536 ms 37856 KB Output is correct
57 Correct 497 ms 38032 KB Output is correct
58 Correct 535 ms 38076 KB Output is correct
59 Correct 491 ms 38020 KB Output is correct
60 Correct 498 ms 38596 KB Output is correct
61 Correct 457 ms 38604 KB Output is correct
62 Correct 509 ms 38584 KB Output is correct
63 Correct 404 ms 38120 KB Output is correct
64 Correct 424 ms 38200 KB Output is correct
65 Correct 428 ms 38356 KB Output is correct
66 Correct 445 ms 38360 KB Output is correct
67 Correct 4 ms 8916 KB Output is correct
68 Correct 9 ms 9820 KB Output is correct
69 Correct 9 ms 9812 KB Output is correct
70 Correct 10 ms 9812 KB Output is correct
71 Correct 373 ms 45064 KB Output is correct
72 Correct 343 ms 44288 KB Output is correct
73 Correct 482 ms 41200 KB Output is correct
74 Correct 575 ms 53600 KB Output is correct
75 Correct 663 ms 53600 KB Output is correct
76 Correct 596 ms 53616 KB Output is correct
77 Correct 530 ms 53536 KB Output is correct
78 Correct 512 ms 53568 KB Output is correct
79 Correct 531 ms 53652 KB Output is correct
80 Correct 435 ms 53436 KB Output is correct
81 Correct 438 ms 53492 KB Output is correct
82 Correct 479 ms 53556 KB Output is correct
83 Correct 541 ms 53508 KB Output is correct
84 Correct 448 ms 39156 KB Output is correct
85 Correct 410 ms 35104 KB Output is correct
86 Correct 357 ms 32140 KB Output is correct
87 Correct 667 ms 45668 KB Output is correct
88 Correct 583 ms 45680 KB Output is correct
89 Correct 686 ms 45676 KB Output is correct
90 Correct 654 ms 45684 KB Output is correct
91 Correct 659 ms 45668 KB Output is correct
92 Correct 626 ms 50600 KB Output is correct
93 Correct 661 ms 52224 KB Output is correct
94 Correct 700 ms 45612 KB Output is correct
95 Correct 719 ms 45752 KB Output is correct
96 Correct 657 ms 45600 KB Output is correct
97 Correct 712 ms 45680 KB Output is correct
98 Correct 544 ms 45444 KB Output is correct
99 Correct 546 ms 45352 KB Output is correct
100 Correct 599 ms 45416 KB Output is correct
101 Correct 598 ms 45412 KB Output is correct
102 Correct 533 ms 46004 KB Output is correct
103 Correct 529 ms 45972 KB Output is correct
104 Correct 542 ms 45960 KB Output is correct
105 Correct 525 ms 45764 KB Output is correct
106 Correct 517 ms 45700 KB Output is correct
107 Correct 523 ms 45688 KB Output is correct
108 Correct 493 ms 45628 KB Output is correct