oj.uz

Submission #972690

# Submission time Handle Problem Language Result Execution time Memory
972690 2024-04-30T22:15:29 Z sofija6 Two Currencies (JOI23_currencies) C++14
100 / 100
 3165 ms 179108 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
#define logn 17
#define MAXV 20000010
using namespace std;
ll a[MAXN],b[MAXN],in[MAXN],out[MAXN],t=1,up[MAXN][logn],leftt[MAXV],rightt[MAXV],ind=1,root[MAXN];
pair<ll,ll> val[MAXV];
map<ll,ll> valc,revvalc;
vector<ll> G[MAXN];
void DFS_Init(ll i,ll p)
{
    in[i]=t++;
    up[i][0]=p;
    for (ll j=1;j<logn;j++)
        up[i][j]=up[up[i][j-1]][j-1];
    for (ll next : G[i])
    {
        if (next!=p)
            DFS_Init(next,i);
    }
    out[i]=t++;
}
bool Is_Ancestor(ll u,ll v)
{
    return in[u]<=in[v] && out[u]>=out[v];
}
ll LCA(ll u,ll v)
{
    if (Is_Ancestor(u,v))
        return u;
    if (Is_Ancestor(v,u))
        return v;
    for (ll i=logn-1;i>=0;i--)
    {
        if (!Is_Ancestor(up[u][i],v))
            u=up[u][i];
    }
    return up[u][0];
}
void Init(ll x,ll lx,ll rx)
{
    if (lx==rx)
        return;
    ll mid=(lx+rx)/2;
    leftt[x]=ind++;
    rightt[x]=ind++;
    Init(leftt[x],lx,mid);
    Init(rightt[x],mid+1,rx);
}
pair<ll,ll> Merge(pair<ll,ll> x,pair<ll,ll> y)
{
    return {x.first+y.first,x.second+y.second};
}
void Update(ll pos,pair<ll,ll> vall,ll x,ll px,ll lx,ll rx)
{
    if (lx==rx)
    {
        val[x]=Merge(val[x],vall);
        return;
    }
    ll mid=(lx+rx)/2;
    if (pos<=mid)
    {
        if (!leftt[x] || leftt[x]==leftt[px])
        {
            leftt[x]=ind++;
            val[leftt[x]]=val[leftt[px]];
        }
        if (!rightt[x])
            rightt[x]=rightt[px];
        Update(pos,vall,leftt[x],leftt[px],lx,mid);
    }
    else
    {
        if (!leftt[x])
            leftt[x]=leftt[px];
        if (!rightt[x] || rightt[x]==rightt[px])
        {
            rightt[x]=ind++;
            val[rightt[x]]=val[rightt[px]];
        }
        Update(pos,vall,rightt[x],rightt[px],mid+1,rx);
    }
    val[x]=Merge(val[leftt[x]],val[rightt[x]]);
}
pair<ll,ll> Calc(ll l,ll r,ll x,ll lx,ll rx)
{
    if (lx>r || rx<l)
        return {0,0};
    if (lx>=l && rx<=r)
        return val[x];
    ll mid=(lx+rx)/2;
    return Merge(Calc(l,r,leftt[x],lx,mid),Calc(l,r,rightt[x],mid+1,rx));
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,q,S,T,X,Y;
    cin >> n >> m >> q;
    for (ll i=1;i<n;i++)
    {
        cin >> a[i] >> b[i];
        G[a[i]].push_back(b[i]);
        G[b[i]].push_back(a[i]);
    }
    DFS_Init(1,1);
    for (ll i=1;i<n;i++)
    {
        if (in[a[i]]>in[b[i]])
            swap(a[i],b[i]);
    }
    vector<pair<ll,ll> > val;
    set<ll> s;
    for (ll i=1;i<=m;i++)
    {
        ll p,c;
        cin >> p >> c;
        val.push_back({c,p});
        s.insert(c);
    }
    sort(val.begin(),val.end());
    ll cur=1;
    for (auto i : s)
    {
        revvalc[cur]=i;
        valc[i]=cur++;
    }
    ll prev=0;
    root[0]=ind++;
    Init(root[0],1,t);
    for (auto i : val)
    {
        ll x=valc[i.first];
        if (i.first!=prev)
        {
            root[x]=ind++;
            prev=i.first;
        }
        Update(in[b[i.second]],{i.first,1},root[x],root[x-1],1,t);
        Update(out[b[i.second]],{-i.first,-1},root[x],root[x-1],1,t);
    }
    while (q--)
    {
        cin >> S >> T >> X >> Y;
        ll l=1,r=cur-1,mid,L=LCA(S,T),pos=0,sum=0,cnt=0;
        while (l<=r)
        {
            mid=(l+r)/2;
            pair<ll,ll> num=Merge(Calc(in[L]+1,in[S],root[mid],1,t),Calc(in[L]+1,in[T],root[mid],1,t));
            if (num.first<=Y)
            {
                pos=mid;
                sum=num.first;
                cnt=num.second;
                l=mid+1;
            }
            else
                r=mid-1;
        }
        if (pos<cur-1)
        {
            ll diff=Y-sum;
            sum+=revvalc[pos+1]*(diff/revvalc[pos+1]);
            cnt+=diff/revvalc[pos+1];
        }
        pair<ll,ll> x=Merge(Calc(in[L]+1,in[S],root[cur-1],1,t),Calc(in[L]+1,in[T],root[cur-1],1,t));
        cout << max(-1ll,X-x.second+cnt) << "\n";
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 2 ms 14936 KB Output is correct
5 Correct 10 ms 15452 KB Output is correct
6 Correct 11 ms 15452 KB Output is correct
7 Correct 9 ms 15192 KB Output is correct
8 Correct 12 ms 15452 KB Output is correct
9 Correct 12 ms 15564 KB Output is correct
10 Correct 13 ms 15452 KB Output is correct
11 Correct 12 ms 15456 KB Output is correct
12 Correct 13 ms 15448 KB Output is correct
13 Correct 12 ms 15636 KB Output is correct
14 Correct 13 ms 15452 KB Output is correct
15 Correct 14 ms 15448 KB Output is correct
16 Correct 12 ms 15452 KB Output is correct
17 Correct 12 ms 15452 KB Output is correct
18 Correct 12 ms 15448 KB Output is correct
19 Correct 12 ms 15452 KB Output is correct
20 Correct 12 ms 15456 KB Output is correct
21 Correct 12 ms 15452 KB Output is correct
22 Correct 16 ms 15452 KB Output is correct
23 Correct 11 ms 15456 KB Output is correct
24 Correct 11 ms 15356 KB Output is correct
25 Correct 12 ms 15452 KB Output is correct
26 Correct 11 ms 15564 KB Output is correct
27 Correct 10 ms 15452 KB Output is correct
28 Correct 11 ms 15448 KB Output is correct
29 Correct 8 ms 15452 KB Output is correct
30 Correct 6 ms 15260 KB Output is correct
31 Correct 6 ms 15196 KB Output is correct
32 Correct 7 ms 15196 KB Output is correct
33 Correct 11 ms 15648 KB Output is correct
34 Correct 11 ms 15456 KB Output is correct
35 Correct 11 ms 15452 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 6 ms 15244 KB Output is correct
3 Correct 6 ms 15196 KB Output is correct
4 Correct 7 ms 15252 KB Output is correct
5 Correct 251 ms 52204 KB Output is correct
6 Correct 250 ms 41660 KB Output is correct
7 Correct 259 ms 46944 KB Output is correct
8 Correct 233 ms 48732 KB Output is correct
9 Correct 216 ms 48752 KB Output is correct
10 Correct 346 ms 53268 KB Output is correct
11 Correct 319 ms 53188 KB Output is correct
12 Correct 355 ms 53116 KB Output is correct
13 Correct 316 ms 53180 KB Output is correct
14 Correct 359 ms 53460 KB Output is correct
15 Correct 307 ms 57792 KB Output is correct
16 Correct 302 ms 58164 KB Output is correct
17 Correct 304 ms 57536 KB Output is correct
18 Correct 369 ms 53328 KB Output is correct
19 Correct 340 ms 53152 KB Output is correct
20 Correct 424 ms 53248 KB Output is correct
21 Correct 293 ms 52548 KB Output is correct
22 Correct 287 ms 53268 KB Output is correct
23 Correct 274 ms 52800 KB Output is correct
24 Correct 262 ms 52656 KB Output is correct
25 Correct 277 ms 50308 KB Output is correct
26 Correct 265 ms 50212 KB Output is correct
27 Correct 270 ms 50528 KB Output is correct
28 Correct 230 ms 52928 KB Output is correct
29 Correct 252 ms 53024 KB Output is correct
30 Correct 254 ms 53220 KB Output is correct
31 Correct 250 ms 53364 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 10 ms 15452 KB Output is correct
3 Correct 11 ms 15652 KB Output is correct
4 Correct 11 ms 15452 KB Output is correct
5 Correct 1174 ms 131272 KB Output is correct
6 Correct 1102 ms 114384 KB Output is correct
7 Correct 1724 ms 154632 KB Output is correct
8 Correct 2470 ms 178548 KB Output is correct
9 Correct 2342 ms 178720 KB Output is correct
10 Correct 2455 ms 178692 KB Output is correct
11 Correct 1784 ms 178472 KB Output is correct
12 Correct 1821 ms 178868 KB Output is correct
13 Correct 1805 ms 178676 KB Output is correct
14 Correct 1167 ms 178864 KB Output is correct
15 Correct 1060 ms 178484 KB Output is correct
16 Correct 1426 ms 178948 KB Output is correct
17 Correct 1438 ms 179108 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 2 ms 14936 KB Output is correct
5 Correct 10 ms 15452 KB Output is correct
6 Correct 11 ms 15452 KB Output is correct
7 Correct 9 ms 15192 KB Output is correct
8 Correct 12 ms 15452 KB Output is correct
9 Correct 12 ms 15564 KB Output is correct
10 Correct 13 ms 15452 KB Output is correct
11 Correct 12 ms 15456 KB Output is correct
12 Correct 13 ms 15448 KB Output is correct
13 Correct 12 ms 15636 KB Output is correct
14 Correct 13 ms 15452 KB Output is correct
15 Correct 14 ms 15448 KB Output is correct
16 Correct 12 ms 15452 KB Output is correct
17 Correct 12 ms 15452 KB Output is correct
18 Correct 12 ms 15448 KB Output is correct
19 Correct 12 ms 15452 KB Output is correct
20 Correct 12 ms 15456 KB Output is correct
21 Correct 12 ms 15452 KB Output is correct
22 Correct 16 ms 15452 KB Output is correct
23 Correct 11 ms 15456 KB Output is correct
24 Correct 11 ms 15356 KB Output is correct
25 Correct 12 ms 15452 KB Output is correct
26 Correct 11 ms 15564 KB Output is correct
27 Correct 10 ms 15452 KB Output is correct
28 Correct 11 ms 15448 KB Output is correct
29 Correct 8 ms 15452 KB Output is correct
30 Correct 6 ms 15260 KB Output is correct
31 Correct 6 ms 15196 KB Output is correct
32 Correct 7 ms 15196 KB Output is correct
33 Correct 11 ms 15648 KB Output is correct
34 Correct 11 ms 15456 KB Output is correct
35 Correct 11 ms 15452 KB Output is correct
36 Correct 3 ms 14940 KB Output is correct
37 Correct 6 ms 15244 KB Output is correct
38 Correct 6 ms 15196 KB Output is correct
39 Correct 7 ms 15252 KB Output is correct
40 Correct 251 ms 52204 KB Output is correct
41 Correct 250 ms 41660 KB Output is correct
42 Correct 259 ms 46944 KB Output is correct
43 Correct 233 ms 48732 KB Output is correct
44 Correct 216 ms 48752 KB Output is correct
45 Correct 346 ms 53268 KB Output is correct
46 Correct 319 ms 53188 KB Output is correct
47 Correct 355 ms 53116 KB Output is correct
48 Correct 316 ms 53180 KB Output is correct
49 Correct 359 ms 53460 KB Output is correct
50 Correct 307 ms 57792 KB Output is correct
51 Correct 302 ms 58164 KB Output is correct
52 Correct 304 ms 57536 KB Output is correct
53 Correct 369 ms 53328 KB Output is correct
54 Correct 340 ms 53152 KB Output is correct
55 Correct 424 ms 53248 KB Output is correct
56 Correct 293 ms 52548 KB Output is correct
57 Correct 287 ms 53268 KB Output is correct
58 Correct 274 ms 52800 KB Output is correct
59 Correct 262 ms 52656 KB Output is correct
60 Correct 277 ms 50308 KB Output is correct
61 Correct 265 ms 50212 KB Output is correct
62 Correct 270 ms 50528 KB Output is correct
63 Correct 230 ms 52928 KB Output is correct
64 Correct 252 ms 53024 KB Output is correct
65 Correct 254 ms 53220 KB Output is correct
66 Correct 250 ms 53364 KB Output is correct
67 Correct 2 ms 14936 KB Output is correct
68 Correct 10 ms 15452 KB Output is correct
69 Correct 11 ms 15652 KB Output is correct
70 Correct 11 ms 15452 KB Output is correct
71 Correct 1174 ms 131272 KB Output is correct
72 Correct 1102 ms 114384 KB Output is correct
73 Correct 1724 ms 154632 KB Output is correct
74 Correct 2470 ms 178548 KB Output is correct
75 Correct 2342 ms 178720 KB Output is correct
76 Correct 2455 ms 178692 KB Output is correct
77 Correct 1784 ms 178472 KB Output is correct
78 Correct 1821 ms 178868 KB Output is correct
79 Correct 1805 ms 178676 KB Output is correct
80 Correct 1167 ms 178864 KB Output is correct
81 Correct 1060 ms 178484 KB Output is correct
82 Correct 1426 ms 178948 KB Output is correct
83 Correct 1438 ms 179108 KB Output is correct
84 Correct 1489 ms 122312 KB Output is correct
85 Correct 1624 ms 105016 KB Output is correct
86 Correct 1395 ms 83216 KB Output is correct
87 Correct 2628 ms 131232 KB Output is correct
88 Correct 2613 ms 131076 KB Output is correct
89 Correct 2596 ms 131140 KB Output is correct
90 Correct 2714 ms 131388 KB Output is correct
91 Correct 2701 ms 131540 KB Output is correct
92 Correct 2745 ms 172916 KB Output is correct
93 Correct 2608 ms 176284 KB Output is correct
94 Correct 3165 ms 149344 KB Output is correct
95 Correct 3090 ms 148808 KB Output is correct
96 Correct 3005 ms 148844 KB Output is correct
97 Correct 3019 ms 148944 KB Output is correct
98 Correct 2409 ms 124500 KB Output is correct
99 Correct 2411 ms 124056 KB Output is correct
100 Correct 2434 ms 124340 KB Output is correct
101 Correct 2398 ms 124432 KB Output is correct
102 Correct 1979 ms 136632 KB Output is correct
103 Correct 1992 ms 129832 KB Output is correct
104 Correct 2043 ms 132180 KB Output is correct
105 Correct 971 ms 130996 KB Output is correct
106 Correct 1084 ms 131200 KB Output is correct
107 Correct 1132 ms 131172 KB Output is correct
108 Correct 1277 ms 130936 KB Output is correct