oj.uz

Submission #917425

# Submission time Handle Problem Language Result Execution time Memory
917425 2024-01-28T07:27:16 Z hotboy2703 Two Currencies (JOI23_currencies) C++14
100 / 100
 2228 ms 52416 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define MASK(i) (1LL<<(i))
#define BIT(mask,i) (((mask) >> (i))&1LL)
const ll MAXN = 1e5;
const ll MAXK = 17;
vector <ll> g[MAXN + 100];
ll in[MAXN+100],out[MAXN+100];
ll timeDFS;
ll sp[MAXN+100][MAXK];
ll depth[MAXN+100];
pll edge[MAXN+100];
pll station[MAXN + 100];
ll pl[MAXN+100],pr[MAXN+100],pans[MAXN+100],ans[MAXN+100];
struct query{
    ll s,t,x,y,l;
};
query all[MAXN + 100];
ll n,m,q;
namespace seg{
    pll operator + (pll x,pll y){
        return {x.fi+y.fi,x.se+y.se};
    }
    pll operator - (pll x,pll y){
        return {x.fi-y.fi,x.se-y.se};
    }
    pll tree[MAXN*4+100];
    void init(){
        for (ll i = 1;i <= n*4+10;i++)tree[i] = {0,0};
    }
    void add(ll id,pll delta){
        tree[id] = tree[id]+delta;
    }
    void lz(ll id){
        add(id<<1,tree[id]);
        add(id<<1|1,tree[id]);
        tree[id] = {0,0};
    }
    void update(ll id,ll l,ll r,ll l1,ll r1,pll delta){
        if (l > r1 || l1 > r)return;
        if (l1 <= l && r <= r1){
            add(id,delta);
            return;
        }
        lz(id);
        ll mid = (l + r) >> 1;
        update(id<<1,l,mid,l1,r1,delta);
        update(id<<1|1,mid+1,r,l1,r1,delta);
    }
    pll get(ll id,ll l,ll r,ll i){
        if (l == r){
            return tree[id];
        }
        lz(id);
        ll mid = (l + r) >> 1;
        if (mid >= i)return get(id<<1,l,mid,i);
        else return get(id<<1|1,mid+1,r,i);
    }
    void update(ll u,ll silver){
        update(1,1,n,in[u],out[u],{-1,silver});
    }
    pll get(ll i){
        return get(1,1,n,in[i]);
    }
    void gold(ll u){
        update(1,1,n,in[u],out[u],{+1,0});
    }
    pll eval(query x){
        return get(x.s)+get(x.t)-get(x.l)-get(x.l);
    }
}

ll lca(ll u,ll v){
    if (depth[u] > depth[v])swap(v,u);
    for (ll j = MAXK-1;j >= 0;j --){
        if (depth[v] - MASK(j) >= depth[u]){
            v = sp[v][j];
        }
    }
    if (u==v)return u;
    for (ll j = MAXK-1;j >= 0;j --){
        if (sp[u][j] != sp[v][j]){
            u = sp[u][j];
            v = sp[v][j];
        }
    }
    return sp[u][0];
}

void dfs(ll u,ll p){
    in[u] = ++timeDFS;
    depth[u] = depth[p]+1;
    sp[u][0] = p;
    for (ll i = 1;i < MAXK;i ++){
        sp[u][i] = sp[sp[u][i-1]][i-1];
    }
    for (auto v:g[u]){
        if (v==p)continue;
        dfs(v,u);
    }
    out[u] = timeDFS;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    cin>>n>>m>>q;
    for (ll i = 1;i < n;i ++){
        ll u,v;
        cin>>u>>v;
        edge[i] = {u,v};
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1,1);
    for (ll i = 1;i <= m;i ++){
        cin>>station[i].se>>station[i].fi;
        ll u = edge[station[i].se].fi, v = edge[station[i].se].se;
        if (depth[u] < depth[v])station[i].se = v;
        else station[i].se = u;
//        cout<<station[i].fi<<' '<<station[i].se<<'\n';
    }
    sort(station+1,station+1+m);
    for (ll i = 1;i <= q;i ++){
        cin>>all[i].s>>all[i].t>>all[i].x>>all[i].y;
        all[i].l = lca(all[i].s,all[i].t);
    }
    for (ll i = 1;i <= q;i ++){
        pl[i] = 0;
        pr[i] = m;
        pans[i] = -1;
    }
    while (1){
        vector <pll> ask;
        for (ll i = 1;i <= q;i ++){
            if (pl[i] <= pr[i]){
                 ask.emplace_back((pl[i]+pr[i])/2,i);
            }
        }
        if (ask.empty())break;
        sort(ask.begin(),ask.end());
        ll ptr = 0;
        seg::init();
        for (ll i = 1;i <= m;i ++){
            seg::gold(station[i].se);
        }
        for (ll i = 0;i <= m;i ++){
            if (i)seg::update(station[i].se,station[i].fi);
            while (ptr<sz(ask) && ask[ptr].fi == i){
                ll id = ask[ptr].se;
                pll tmp = seg::eval(all[id]);
                if (all[id].y >= tmp.se){
                    pans[id] = i;
                    pl[id] = i+1;
                    ans[id] = tmp.fi;
                }
                else{
                    pr[id] = i-1;
                }
                ptr++;
            }
        }
    }
    for (ll i = 1;i <= q;i ++){
//        cout<<pans[i]<<' ';
        if (ans[i] > all[i].x){cout<<-1;}
        else cout<<all[i].x-ans[i];
        cout<<'\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16216 KB Output is correct
2 Correct 3 ms 16472 KB Output is correct
3 Correct 3 ms 16220 KB Output is correct
4 Correct 3 ms 16220 KB Output is correct
5 Correct 13 ms 16620 KB Output is correct
6 Correct 16 ms 18524 KB Output is correct
7 Correct 13 ms 18524 KB Output is correct
8 Correct 16 ms 18716 KB Output is correct
9 Correct 16 ms 18520 KB Output is correct
10 Correct 16 ms 18524 KB Output is correct
11 Correct 17 ms 18524 KB Output is correct
12 Correct 16 ms 18524 KB Output is correct
13 Correct 20 ms 18780 KB Output is correct
14 Correct 17 ms 18524 KB Output is correct
15 Correct 19 ms 18736 KB Output is correct
16 Correct 18 ms 18580 KB Output is correct
17 Correct 18 ms 18524 KB Output is correct
18 Correct 19 ms 18728 KB Output is correct
19 Correct 15 ms 18524 KB Output is correct
20 Correct 18 ms 18680 KB Output is correct
21 Correct 18 ms 18712 KB Output is correct
22 Correct 16 ms 18708 KB Output is correct
23 Correct 14 ms 18712 KB Output is correct
24 Correct 14 ms 18524 KB Output is correct
25 Correct 14 ms 18488 KB Output is correct
26 Correct 14 ms 18520 KB Output is correct
27 Correct 16 ms 18472 KB Output is correct
28 Correct 15 ms 18520 KB Output is correct
29 Correct 14 ms 18524 KB Output is correct
30 Correct 16 ms 18524 KB Output is correct
31 Correct 16 ms 18524 KB Output is correct
32 Correct 15 ms 18520 KB Output is correct
33 Correct 18 ms 18792 KB Output is correct
34 Correct 17 ms 18832 KB Output is correct
35 Correct 16 ms 18780 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16220 KB Output is correct
2 Correct 16 ms 18508 KB Output is correct
3 Correct 16 ms 18524 KB Output is correct
4 Correct 16 ms 18524 KB Output is correct
5 Correct 1107 ms 45212 KB Output is correct
6 Correct 1277 ms 42284 KB Output is correct
7 Correct 1236 ms 44512 KB Output is correct
8 Correct 949 ms 43524 KB Output is correct
9 Correct 908 ms 42340 KB Output is correct
10 Correct 1615 ms 47900 KB Output is correct
11 Correct 1711 ms 47672 KB Output is correct
12 Correct 1628 ms 47444 KB Output is correct
13 Correct 1542 ms 47944 KB Output is correct
14 Correct 1505 ms 47544 KB Output is correct
15 Correct 2068 ms 51976 KB Output is correct
16 Correct 2228 ms 52156 KB Output is correct
17 Correct 1812 ms 51652 KB Output is correct
18 Correct 1794 ms 47384 KB Output is correct
19 Correct 1789 ms 47444 KB Output is correct
20 Correct 1875 ms 47508 KB Output is correct
21 Correct 1593 ms 47080 KB Output is correct
22 Correct 1541 ms 47188 KB Output is correct
23 Correct 1573 ms 47176 KB Output is correct
24 Correct 1655 ms 47464 KB Output is correct
25 Correct 1389 ms 47848 KB Output is correct
26 Correct 1367 ms 48116 KB Output is correct
27 Correct 1481 ms 47928 KB Output is correct
28 Correct 1199 ms 47340 KB Output is correct
29 Correct 1235 ms 47516 KB Output is correct
30 Correct 1335 ms 47636 KB Output is correct
31 Correct 1319 ms 47596 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16216 KB Output is correct
2 Correct 17 ms 18780 KB Output is correct
3 Correct 17 ms 18776 KB Output is correct
4 Correct 17 ms 18580 KB Output is correct
5 Correct 1088 ms 48104 KB Output is correct
6 Correct 964 ms 48512 KB Output is correct
7 Correct 1474 ms 42096 KB Output is correct
8 Correct 1858 ms 52292 KB Output is correct
9 Correct 1817 ms 52076 KB Output is correct
10 Correct 1814 ms 52156 KB Output is correct
11 Correct 1477 ms 52144 KB Output is correct
12 Correct 1609 ms 52104 KB Output is correct
13 Correct 1568 ms 52132 KB Output is correct
14 Correct 1373 ms 52416 KB Output is correct
15 Correct 1354 ms 52272 KB Output is correct
16 Correct 1439 ms 52176 KB Output is correct
17 Correct 1539 ms 52164 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16216 KB Output is correct
2 Correct 3 ms 16472 KB Output is correct
3 Correct 3 ms 16220 KB Output is correct
4 Correct 3 ms 16220 KB Output is correct
5 Correct 13 ms 16620 KB Output is correct
6 Correct 16 ms 18524 KB Output is correct
7 Correct 13 ms 18524 KB Output is correct
8 Correct 16 ms 18716 KB Output is correct
9 Correct 16 ms 18520 KB Output is correct
10 Correct 16 ms 18524 KB Output is correct
11 Correct 17 ms 18524 KB Output is correct
12 Correct 16 ms 18524 KB Output is correct
13 Correct 20 ms 18780 KB Output is correct
14 Correct 17 ms 18524 KB Output is correct
15 Correct 19 ms 18736 KB Output is correct
16 Correct 18 ms 18580 KB Output is correct
17 Correct 18 ms 18524 KB Output is correct
18 Correct 19 ms 18728 KB Output is correct
19 Correct 15 ms 18524 KB Output is correct
20 Correct 18 ms 18680 KB Output is correct
21 Correct 18 ms 18712 KB Output is correct
22 Correct 16 ms 18708 KB Output is correct
23 Correct 14 ms 18712 KB Output is correct
24 Correct 14 ms 18524 KB Output is correct
25 Correct 14 ms 18488 KB Output is correct
26 Correct 14 ms 18520 KB Output is correct
27 Correct 16 ms 18472 KB Output is correct
28 Correct 15 ms 18520 KB Output is correct
29 Correct 14 ms 18524 KB Output is correct
30 Correct 16 ms 18524 KB Output is correct
31 Correct 16 ms 18524 KB Output is correct
32 Correct 15 ms 18520 KB Output is correct
33 Correct 18 ms 18792 KB Output is correct
34 Correct 17 ms 18832 KB Output is correct
35 Correct 16 ms 18780 KB Output is correct
36 Correct 3 ms 16220 KB Output is correct
37 Correct 16 ms 18508 KB Output is correct
38 Correct 16 ms 18524 KB Output is correct
39 Correct 16 ms 18524 KB Output is correct
40 Correct 1107 ms 45212 KB Output is correct
41 Correct 1277 ms 42284 KB Output is correct
42 Correct 1236 ms 44512 KB Output is correct
43 Correct 949 ms 43524 KB Output is correct
44 Correct 908 ms 42340 KB Output is correct
45 Correct 1615 ms 47900 KB Output is correct
46 Correct 1711 ms 47672 KB Output is correct
47 Correct 1628 ms 47444 KB Output is correct
48 Correct 1542 ms 47944 KB Output is correct
49 Correct 1505 ms 47544 KB Output is correct
50 Correct 2068 ms 51976 KB Output is correct
51 Correct 2228 ms 52156 KB Output is correct
52 Correct 1812 ms 51652 KB Output is correct
53 Correct 1794 ms 47384 KB Output is correct
54 Correct 1789 ms 47444 KB Output is correct
55 Correct 1875 ms 47508 KB Output is correct
56 Correct 1593 ms 47080 KB Output is correct
57 Correct 1541 ms 47188 KB Output is correct
58 Correct 1573 ms 47176 KB Output is correct
59 Correct 1655 ms 47464 KB Output is correct
60 Correct 1389 ms 47848 KB Output is correct
61 Correct 1367 ms 48116 KB Output is correct
62 Correct 1481 ms 47928 KB Output is correct
63 Correct 1199 ms 47340 KB Output is correct
64 Correct 1235 ms 47516 KB Output is correct
65 Correct 1335 ms 47636 KB Output is correct
66 Correct 1319 ms 47596 KB Output is correct
67 Correct 3 ms 16216 KB Output is correct
68 Correct 17 ms 18780 KB Output is correct
69 Correct 17 ms 18776 KB Output is correct
70 Correct 17 ms 18580 KB Output is correct
71 Correct 1088 ms 48104 KB Output is correct
72 Correct 964 ms 48512 KB Output is correct
73 Correct 1474 ms 42096 KB Output is correct
74 Correct 1858 ms 52292 KB Output is correct
75 Correct 1817 ms 52076 KB Output is correct
76 Correct 1814 ms 52156 KB Output is correct
77 Correct 1477 ms 52144 KB Output is correct
78 Correct 1609 ms 52104 KB Output is correct
79 Correct 1568 ms 52132 KB Output is correct
80 Correct 1373 ms 52416 KB Output is correct
81 Correct 1354 ms 52272 KB Output is correct
82 Correct 1439 ms 52176 KB Output is correct
83 Correct 1539 ms 52164 KB Output is correct
84 Correct 1254 ms 42792 KB Output is correct
85 Correct 1213 ms 38808 KB Output is correct
86 Correct 991 ms 38624 KB Output is correct
87 Correct 1841 ms 47600 KB Output is correct
88 Correct 1855 ms 47500 KB Output is correct
89 Correct 1728 ms 47580 KB Output is correct
90 Correct 1805 ms 47488 KB Output is correct
91 Correct 1720 ms 47480 KB Output is correct
92 Correct 2029 ms 50436 KB Output is correct
93 Correct 1861 ms 51452 KB Output is correct
94 Correct 1901 ms 47300 KB Output is correct
95 Correct 1986 ms 47432 KB Output is correct
96 Correct 1869 ms 47932 KB Output is correct
97 Correct 1973 ms 47404 KB Output is correct
98 Correct 1645 ms 47188 KB Output is correct
99 Correct 1653 ms 47080 KB Output is correct
100 Correct 1675 ms 47276 KB Output is correct
101 Correct 1741 ms 47256 KB Output is correct
102 Correct 1618 ms 47868 KB Output is correct
103 Correct 1386 ms 47832 KB Output is correct
104 Correct 1441 ms 47900 KB Output is correct
105 Correct 1353 ms 47448 KB Output is correct
106 Correct 1356 ms 47404 KB Output is correct
107 Correct 1500 ms 47516 KB Output is correct
108 Correct 1482 ms 47524 KB Output is correct