oj.uz

Submission #854046

# Submission time Handle Problem Language Result Execution time Memory
854046 2023-09-26T01:38:18 Z 12345678 Two Currencies (JOI23_currencies) C++17
100 / 100
 641 ms 143552 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5, kx=17;
ll n, m, q, u, v, p, c, lvl[nx], pa[nx][kx], sp, tp, x, y;
vector<pair<ll, ll>> d[nx], t, s[nx];
bool vs[nx];

void dfs(int u, int p)
{
    pa[u][0]=p; lvl[u]=lvl[p]+1;
    for (int i=1; i<kx; i++) pa[u][i]=pa[pa[u][i-1]][i-1];
    for (auto [v, idx]:d[u]) if (v!=p) dfs(v, u);
}

int lca(int u, int v)
{
    if (lvl[u]>lvl[v]) swap(u, v);
    for (int i=kx-1; i>=0; i--) if (lvl[u]<=lvl[pa[v][i]]) v=pa[v][i];
    if (u==v) return u;
    for (int i=kx-1; i>=0; i--) if (pa[u][i]!=pa[v][i]) u=pa[u][i], v=pa[v][i];
    return pa[u][0];
}

struct persist
{
    struct node
    {
        ll sm, f;
        node *l, *r;
        node(): sm(0), f(0), l(0), r(0){}
    };
    typedef node* pnode;
    pnode rt[nx];
    void build(int l, int r, pnode &t)
    {
        t=new node();
        if (l==r) return;
        int md=(l+r)/2;
        build(l, md, t->l);
        build(md+1, r, t->r);
        t->f=t->l->f+t->r->f;
        t->sm=t->l->sm+t->r->sm;
    }
    void update(int l, int r, pnode &t, pnode k, int idx, ll val)
    {
        t=new node(*k);
        if (l==r) return t->f=1, t->sm=val, void();
        int md=(l+r)/2;
        if (idx<=md) update(l, md, t->l, k->l, idx, val);
        else update(md+1, r, t->r, k->r, idx, val);
        t->f=t->l->f+t->r->f;
        t->sm=t->l->sm+t->r->sm;
    }
    ll query(int l, int r, pnode s, pnode t, pnode lc, ll am)
    {
        //printf("%d %d %d\n", l, r, am);
        if (l==r) return (s->sm+t->sm-2*lc->sm<=am)?(s->f+t->f-2*lc->f):0;
        int md=(l+r)/2;
        ll usel=s->l->sm+t->l->sm-2*(lc->l->sm);
        if (usel<=am) return s->l->f+t->l->f-2*lc->l->f+query(md+1, r, s->r, t->r, lc->r, am-usel);
        return query(l, md, s->l, t->l, lc->l, am);
    }
} st;

void dfs2(int u, int p)
{
    for (auto [v, idx]:d[u])
    {
        if (v==p) continue;
        st.rt[v]=st.rt[u];
        for (auto [vl, idx2]:s[idx]) st.update(1, m, st.rt[v], st.rt[v], idx2, vl);
        dfs2(v, u);
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>q;
    for (int i=1; i<=n-1; i++) cin>>u>>v, d[u].push_back({v, i}), d[v].push_back({u, i});
    for (int i=1; i<=m; i++) cin>>p>>c, t.push_back({c, p});
    sort(t.begin(), t.end());
    for (int i=0; i<m; i++) s[t[i].second].push_back({t[i].first, i+1});
    dfs(1, 1);
    st.build(1, m, st.rt[1]);
    dfs2(1, 1);
    while (q--)
    {
        cin>>sp>>tp>>x>>y;
        int lc=lca(sp, tp);
        //printf("%d %d %d\n", st.rt[sp], st.rt[tp], st.rt[lc]);
        ll gu=st.query(1, m, st.rt[sp], st.rt[tp], st.rt[lc], y);
        ll tc=st.rt[sp]->f+st.rt[tp]->f-2*st.rt[lc]->f;
        if (tc-gu>x) cout<<-1<<'\n';
        else cout<<x-(tc-gu)<<'\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 4 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 4 ms 7768 KB Output is correct
8 Correct 5 ms 8024 KB Output is correct
9 Correct 5 ms 8116 KB Output is correct
10 Correct 5 ms 8028 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8028 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 8348 KB Output is correct
15 Correct 5 ms 8280 KB Output is correct
16 Correct 5 ms 8172 KB Output is correct
17 Correct 5 ms 8284 KB Output is correct
18 Correct 5 ms 8284 KB Output is correct
19 Correct 5 ms 8028 KB Output is correct
20 Correct 4 ms 8028 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8168 KB Output is correct
23 Correct 5 ms 8180 KB Output is correct
24 Correct 5 ms 8028 KB Output is correct
25 Correct 5 ms 8028 KB Output is correct
26 Correct 5 ms 8156 KB Output is correct
27 Correct 4 ms 8028 KB Output is correct
28 Correct 5 ms 8024 KB Output is correct
29 Correct 4 ms 8028 KB Output is correct
30 Correct 5 ms 8028 KB Output is correct
31 Correct 5 ms 8252 KB Output is correct
32 Correct 5 ms 8084 KB Output is correct
33 Correct 5 ms 8540 KB Output is correct
34 Correct 5 ms 8540 KB Output is correct
35 Correct 5 ms 8540 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 5 ms 8088 KB Output is correct
3 Correct 4 ms 8124 KB Output is correct
4 Correct 5 ms 8024 KB Output is correct
5 Correct 276 ms 116232 KB Output is correct
6 Correct 260 ms 102800 KB Output is correct
7 Correct 236 ms 88252 KB Output is correct
8 Correct 205 ms 86724 KB Output is correct
9 Correct 204 ms 92028 KB Output is correct
10 Correct 335 ms 127424 KB Output is correct
11 Correct 343 ms 127176 KB Output is correct
12 Correct 328 ms 127384 KB Output is correct
13 Correct 326 ms 127164 KB Output is correct
14 Correct 336 ms 127424 KB Output is correct
15 Correct 551 ms 142268 KB Output is correct
16 Correct 549 ms 143284 KB Output is correct
17 Correct 554 ms 141736 KB Output is correct
18 Correct 449 ms 127932 KB Output is correct
19 Correct 468 ms 127784 KB Output is correct
20 Correct 470 ms 128188 KB Output is correct
21 Correct 246 ms 126256 KB Output is correct
22 Correct 249 ms 126272 KB Output is correct
23 Correct 258 ms 126792 KB Output is correct
24 Correct 255 ms 126272 KB Output is correct
25 Correct 306 ms 127424 KB Output is correct
26 Correct 292 ms 127172 KB Output is correct
27 Correct 319 ms 127172 KB Output is correct
28 Correct 230 ms 127052 KB Output is correct
29 Correct 228 ms 127172 KB Output is correct
30 Correct 246 ms 127452 KB Output is correct
31 Correct 254 ms 127244 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 5 ms 8340 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 5 ms 8536 KB Output is correct
5 Correct 299 ms 104652 KB Output is correct
6 Correct 284 ms 90568 KB Output is correct
7 Correct 377 ms 120928 KB Output is correct
8 Correct 500 ms 143552 KB Output is correct
9 Correct 494 ms 143408 KB Output is correct
10 Correct 498 ms 143388 KB Output is correct
11 Correct 401 ms 142784 KB Output is correct
12 Correct 401 ms 142780 KB Output is correct
13 Correct 398 ms 142928 KB Output is correct
14 Correct 253 ms 143272 KB Output is correct
15 Correct 258 ms 143116 KB Output is correct
16 Correct 305 ms 143280 KB Output is correct
17 Correct 295 ms 143292 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 4 ms 8028 KB Output is correct
6 Correct 4 ms 8028 KB Output is correct
7 Correct 4 ms 7768 KB Output is correct
8 Correct 5 ms 8024 KB Output is correct
9 Correct 5 ms 8116 KB Output is correct
10 Correct 5 ms 8028 KB Output is correct
11 Correct 5 ms 8028 KB Output is correct
12 Correct 5 ms 8028 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 8348 KB Output is correct
15 Correct 5 ms 8280 KB Output is correct
16 Correct 5 ms 8172 KB Output is correct
17 Correct 5 ms 8284 KB Output is correct
18 Correct 5 ms 8284 KB Output is correct
19 Correct 5 ms 8028 KB Output is correct
20 Correct 4 ms 8028 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8168 KB Output is correct
23 Correct 5 ms 8180 KB Output is correct
24 Correct 5 ms 8028 KB Output is correct
25 Correct 5 ms 8028 KB Output is correct
26 Correct 5 ms 8156 KB Output is correct
27 Correct 4 ms 8028 KB Output is correct
28 Correct 5 ms 8024 KB Output is correct
29 Correct 4 ms 8028 KB Output is correct
30 Correct 5 ms 8028 KB Output is correct
31 Correct 5 ms 8252 KB Output is correct
32 Correct 5 ms 8084 KB Output is correct
33 Correct 5 ms 8540 KB Output is correct
34 Correct 5 ms 8540 KB Output is correct
35 Correct 5 ms 8540 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 5 ms 8088 KB Output is correct
38 Correct 4 ms 8124 KB Output is correct
39 Correct 5 ms 8024 KB Output is correct
40 Correct 276 ms 116232 KB Output is correct
41 Correct 260 ms 102800 KB Output is correct
42 Correct 236 ms 88252 KB Output is correct
43 Correct 205 ms 86724 KB Output is correct
44 Correct 204 ms 92028 KB Output is correct
45 Correct 335 ms 127424 KB Output is correct
46 Correct 343 ms 127176 KB Output is correct
47 Correct 328 ms 127384 KB Output is correct
48 Correct 326 ms 127164 KB Output is correct
49 Correct 336 ms 127424 KB Output is correct
50 Correct 551 ms 142268 KB Output is correct
51 Correct 549 ms 143284 KB Output is correct
52 Correct 554 ms 141736 KB Output is correct
53 Correct 449 ms 127932 KB Output is correct
54 Correct 468 ms 127784 KB Output is correct
55 Correct 470 ms 128188 KB Output is correct
56 Correct 246 ms 126256 KB Output is correct
57 Correct 249 ms 126272 KB Output is correct
58 Correct 258 ms 126792 KB Output is correct
59 Correct 255 ms 126272 KB Output is correct
60 Correct 306 ms 127424 KB Output is correct
61 Correct 292 ms 127172 KB Output is correct
62 Correct 319 ms 127172 KB Output is correct
63 Correct 230 ms 127052 KB Output is correct
64 Correct 228 ms 127172 KB Output is correct
65 Correct 246 ms 127452 KB Output is correct
66 Correct 254 ms 127244 KB Output is correct
67 Correct 1 ms 6492 KB Output is correct
68 Correct 5 ms 8340 KB Output is correct
69 Correct 5 ms 8540 KB Output is correct
70 Correct 5 ms 8536 KB Output is correct
71 Correct 299 ms 104652 KB Output is correct
72 Correct 284 ms 90568 KB Output is correct
73 Correct 377 ms 120928 KB Output is correct
74 Correct 500 ms 143552 KB Output is correct
75 Correct 494 ms 143408 KB Output is correct
76 Correct 498 ms 143388 KB Output is correct
77 Correct 401 ms 142784 KB Output is correct
78 Correct 401 ms 142780 KB Output is correct
79 Correct 398 ms 142928 KB Output is correct
80 Correct 253 ms 143272 KB Output is correct
81 Correct 258 ms 143116 KB Output is correct
82 Correct 305 ms 143280 KB Output is correct
83 Correct 295 ms 143292 KB Output is correct
84 Correct 256 ms 118424 KB Output is correct
85 Correct 233 ms 103612 KB Output is correct
86 Correct 194 ms 76736 KB Output is correct
87 Correct 335 ms 127172 KB Output is correct
88 Correct 339 ms 127524 KB Output is correct
89 Correct 345 ms 127224 KB Output is correct
90 Correct 361 ms 127172 KB Output is correct
91 Correct 360 ms 127236 KB Output is correct
92 Correct 598 ms 137920 KB Output is correct
93 Correct 641 ms 140724 KB Output is correct
94 Correct 519 ms 127920 KB Output is correct
95 Correct 513 ms 128228 KB Output is correct
96 Correct 496 ms 127764 KB Output is correct
97 Correct 519 ms 127932 KB Output is correct
98 Correct 298 ms 126320 KB Output is correct
99 Correct 314 ms 126200 KB Output is correct
100 Correct 300 ms 126268 KB Output is correct
101 Correct 294 ms 126268 KB Output is correct
102 Correct 337 ms 127080 KB Output is correct
103 Correct 338 ms 127204 KB Output is correct
104 Correct 327 ms 127184 KB Output is correct
105 Correct 259 ms 127196 KB Output is correct
106 Correct 253 ms 127176 KB Output is correct
107 Correct 273 ms 127172 KB Output is correct
108 Correct 273 ms 127180 KB Output is correct