oj.uz

Submission #856815

# Submission time Handle Problem Language Result Execution time Memory
856815 2023-10-04T16:29:05 Z bkhanh Two Currencies (JOI23_currencies) C++14
100 / 100
 875 ms 45524 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fi first
#define se second
typedef pair <ll, ll> ii;
const ll N = 1e5 + 99;

struct st
{
    ll s, t, z, w;
};

st qs[N];
ll n, m, q, up[N][20], In[N], Out[N], h[N], cnt;
ll num[N], diff[N], dd[N], ans[N];
ii edg[N];
vector <ll> adj[N];
vector <ii> vt;

void dfs(ll u)
{
    In[u] = ++cnt;
    for (ll v : adj[u])
    {
        if (up[u][0] == v) continue;
        h[v] = h[u] + 1;
        up[v][0] = u;
        for (int i = 1; i <= 16; i++)
        {
            up[v][i] = up[up[v][i - 1]][i - 1];
        }
        dfs(v);
    }
    Out[u] = cnt;
}

void pre(ll u)
{
    for (ll v : adj[u])
    {
        if (up[u][0] == v) continue;
        dd[v] += dd[u];
        pre(v);
    }
}

ll lca(ll u, ll v)
{
    if (h[u] < h[v]) swap(u, v);
    ll k = h[u] - h[v];

    for (int i = 0; (1 << i) <= k; i++)
    {
        if (k >> i & 1)
        {
            u = up[u][i];
        }
    }

    if (u == v) return u;

    k = log2(h[u]);
    for (int i = k; i >= 0; i--)
    {
        if (up[u][i] != up[v][i])
        {
            u = up[u][i];
            v = up[v][i];
        }
    }
    return up[u][0];
}

void update(ll x, ll val)
{
    for (; x <= cnt; x += (x & -x))
    {
        diff[x] += val;
        if (val >= 0) num[x]++;
        else num[x]--;
    }
}

ll getval(ll x)
{
    ll res = 0;
    for (; x > 0; x &= (x - 1))
    {
        res += diff[x];
    }
    return res;
}

ll getnum(ll x)
{
    ll res = 0;
    for (; x > 0; x &= (x - 1))
    {
        res += num[x];
    }
    return res;
}

void solve(ll l, ll r, vector <ll> id)
{
    if (l > r || id.size() == 0) return;

    vector <ll> left, right;
    ll mid = (l + r) / 2;
    for (int i = l; i <= mid; i++)
    {
        auto [c, u] = vt[i - 1];
        update(In[u], c);
        update(Out[u] + 1, -c);
    }

    for (ll i : id)
    {
        ll path = lca(qs[i].s, qs[i].t);
        ll val = getval(In[qs[i].s]) + getval(In[qs[i].t]) - 2 * getval(In[path]);
        if (val <= qs[i].w)
        {
            right.push_back(i);
            ans[i] = max(ans[i], getnum(In[qs[i].s]) + getnum(In[qs[i].t]) - 2 * getnum(In[path]));
        }
        else left.push_back(i);
    }

    solve(mid + 1, r, right);

    for (int i = l; i <= mid; i++)
    {
        auto [c, u] = vt[i - 1];
        update(In[u], -c);
        update(Out[u] + 1,  c);
    }

    if (l != r) solve(l, mid, left);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    if(fopen("test.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }

    cin >> n >> m >> q;
    for (int i = 1; i < n; i++)
    {
        cin >> edg[i].fi >> edg[i].se;
        adj[edg[i].fi].push_back(edg[i].se);
        adj[edg[i].se].push_back(edg[i].fi);
    }

    dfs(1);

    for (int i = 1; i <= m; i++)
    {
        ll x, c;
        cin >> x >> c;
        ll res = edg[x].fi;
        if (h[edg[x].fi] < h[edg[x].se]) res = edg[x].se;
        dd[res]++;
        vt.push_back({c, res});
    }

    pre(1);
    sort(vt.begin(), vt.end());
    vector <ll> id;

    for (int i = 1; i <= q; i++)
    {
        cin >> qs[i].s >> qs[i].t >> qs[i].z >> qs[i].w;
        id.push_back(i);
    }

    solve(1, m, id);

    for (int i = 1; i <= q; i++)
    {
        ll path = lca(qs[i].s, qs[i].t);
        ll res = dd[qs[i].s] + dd[qs[i].t] - 2 * dd[path];
        if (res - ans[i] > qs[i].z)
        {
            cout << -1 << '\n';
        }
        else
        {
            cout << qs[i].z - (res - ans[i]) << '\n';
        }
    }
}

Compilation message

currencies.cpp: In function 'void solve(long long int, long long int, std::vector<long long int>)':
currencies.cpp:114:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  114 |         auto [c, u] = vt[i - 1];
      |              ^
currencies.cpp:135:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  135 |         auto [c, u] = vt[i - 1];
      |              ^
currencies.cpp: In function 'int main()':
currencies.cpp:151:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  151 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:152:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  152 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 5 ms 11100 KB Output is correct
6 Correct 6 ms 11092 KB Output is correct
7 Correct 6 ms 11100 KB Output is correct
8 Correct 7 ms 11100 KB Output is correct
9 Correct 7 ms 11100 KB Output is correct
10 Correct 7 ms 11100 KB Output is correct
11 Correct 7 ms 11096 KB Output is correct
12 Correct 7 ms 11100 KB Output is correct
13 Correct 9 ms 11100 KB Output is correct
14 Correct 7 ms 11100 KB Output is correct
15 Correct 8 ms 11044 KB Output is correct
16 Correct 8 ms 11100 KB Output is correct
17 Correct 8 ms 11100 KB Output is correct
18 Correct 8 ms 11100 KB Output is correct
19 Correct 5 ms 11100 KB Output is correct
20 Correct 5 ms 11100 KB Output is correct
21 Correct 6 ms 11100 KB Output is correct
22 Correct 6 ms 11100 KB Output is correct
23 Correct 6 ms 11008 KB Output is correct
24 Correct 6 ms 11100 KB Output is correct
25 Correct 6 ms 11100 KB Output is correct
26 Correct 5 ms 11100 KB Output is correct
27 Correct 5 ms 11100 KB Output is correct
28 Correct 5 ms 11100 KB Output is correct
29 Correct 6 ms 11612 KB Output is correct
30 Correct 6 ms 11100 KB Output is correct
31 Correct 6 ms 11100 KB Output is correct
32 Correct 7 ms 11176 KB Output is correct
33 Correct 7 ms 11096 KB Output is correct
34 Correct 7 ms 11100 KB Output is correct
35 Correct 6 ms 11100 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 6 ms 11100 KB Output is correct
3 Correct 6 ms 10984 KB Output is correct
4 Correct 7 ms 11144 KB Output is correct
5 Correct 430 ms 40740 KB Output is correct
6 Correct 466 ms 40856 KB Output is correct
7 Correct 421 ms 41928 KB Output is correct
8 Correct 345 ms 40264 KB Output is correct
9 Correct 359 ms 39520 KB Output is correct
10 Correct 529 ms 39356 KB Output is correct
11 Correct 541 ms 39360 KB Output is correct
12 Correct 526 ms 39712 KB Output is correct
13 Correct 522 ms 39536 KB Output is correct
14 Correct 508 ms 39104 KB Output is correct
15 Correct 706 ms 43756 KB Output is correct
16 Correct 723 ms 44388 KB Output is correct
17 Correct 686 ms 43452 KB Output is correct
18 Correct 738 ms 37900 KB Output is correct
19 Correct 793 ms 38300 KB Output is correct
20 Correct 759 ms 38012 KB Output is correct
21 Correct 403 ms 45444 KB Output is correct
22 Correct 384 ms 45380 KB Output is correct
23 Correct 393 ms 45524 KB Output is correct
24 Correct 374 ms 45380 KB Output is correct
25 Correct 486 ms 40136 KB Output is correct
26 Correct 464 ms 41660 KB Output is correct
27 Correct 504 ms 41164 KB Output is correct
28 Correct 301 ms 42300 KB Output is correct
29 Correct 267 ms 45056 KB Output is correct
30 Correct 371 ms 41572 KB Output is correct
31 Correct 353 ms 41416 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 7 ms 11200 KB Output is correct
3 Correct 7 ms 11176 KB Output is correct
4 Correct 7 ms 11240 KB Output is correct
5 Correct 466 ms 45216 KB Output is correct
6 Correct 530 ms 45496 KB Output is correct
7 Correct 415 ms 38844 KB Output is correct
8 Correct 641 ms 43964 KB Output is correct
9 Correct 606 ms 44060 KB Output is correct
10 Correct 632 ms 44548 KB Output is correct
11 Correct 454 ms 43948 KB Output is correct
12 Correct 496 ms 44248 KB Output is correct
13 Correct 444 ms 44228 KB Output is correct
14 Correct 242 ms 44348 KB Output is correct
15 Correct 223 ms 44356 KB Output is correct
16 Correct 318 ms 44256 KB Output is correct
17 Correct 290 ms 44000 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 5 ms 11100 KB Output is correct
6 Correct 6 ms 11092 KB Output is correct
7 Correct 6 ms 11100 KB Output is correct
8 Correct 7 ms 11100 KB Output is correct
9 Correct 7 ms 11100 KB Output is correct
10 Correct 7 ms 11100 KB Output is correct
11 Correct 7 ms 11096 KB Output is correct
12 Correct 7 ms 11100 KB Output is correct
13 Correct 9 ms 11100 KB Output is correct
14 Correct 7 ms 11100 KB Output is correct
15 Correct 8 ms 11044 KB Output is correct
16 Correct 8 ms 11100 KB Output is correct
17 Correct 8 ms 11100 KB Output is correct
18 Correct 8 ms 11100 KB Output is correct
19 Correct 5 ms 11100 KB Output is correct
20 Correct 5 ms 11100 KB Output is correct
21 Correct 6 ms 11100 KB Output is correct
22 Correct 6 ms 11100 KB Output is correct
23 Correct 6 ms 11008 KB Output is correct
24 Correct 6 ms 11100 KB Output is correct
25 Correct 6 ms 11100 KB Output is correct
26 Correct 5 ms 11100 KB Output is correct
27 Correct 5 ms 11100 KB Output is correct
28 Correct 5 ms 11100 KB Output is correct
29 Correct 6 ms 11612 KB Output is correct
30 Correct 6 ms 11100 KB Output is correct
31 Correct 6 ms 11100 KB Output is correct
32 Correct 7 ms 11176 KB Output is correct
33 Correct 7 ms 11096 KB Output is correct
34 Correct 7 ms 11100 KB Output is correct
35 Correct 6 ms 11100 KB Output is correct
36 Correct 2 ms 10844 KB Output is correct
37 Correct 6 ms 11100 KB Output is correct
38 Correct 6 ms 10984 KB Output is correct
39 Correct 7 ms 11144 KB Output is correct
40 Correct 430 ms 40740 KB Output is correct
41 Correct 466 ms 40856 KB Output is correct
42 Correct 421 ms 41928 KB Output is correct
43 Correct 345 ms 40264 KB Output is correct
44 Correct 359 ms 39520 KB Output is correct
45 Correct 529 ms 39356 KB Output is correct
46 Correct 541 ms 39360 KB Output is correct
47 Correct 526 ms 39712 KB Output is correct
48 Correct 522 ms 39536 KB Output is correct
49 Correct 508 ms 39104 KB Output is correct
50 Correct 706 ms 43756 KB Output is correct
51 Correct 723 ms 44388 KB Output is correct
52 Correct 686 ms 43452 KB Output is correct
53 Correct 738 ms 37900 KB Output is correct
54 Correct 793 ms 38300 KB Output is correct
55 Correct 759 ms 38012 KB Output is correct
56 Correct 403 ms 45444 KB Output is correct
57 Correct 384 ms 45380 KB Output is correct
58 Correct 393 ms 45524 KB Output is correct
59 Correct 374 ms 45380 KB Output is correct
60 Correct 486 ms 40136 KB Output is correct
61 Correct 464 ms 41660 KB Output is correct
62 Correct 504 ms 41164 KB Output is correct
63 Correct 301 ms 42300 KB Output is correct
64 Correct 267 ms 45056 KB Output is correct
65 Correct 371 ms 41572 KB Output is correct
66 Correct 353 ms 41416 KB Output is correct
67 Correct 2 ms 10844 KB Output is correct
68 Correct 7 ms 11200 KB Output is correct
69 Correct 7 ms 11176 KB Output is correct
70 Correct 7 ms 11240 KB Output is correct
71 Correct 466 ms 45216 KB Output is correct
72 Correct 530 ms 45496 KB Output is correct
73 Correct 415 ms 38844 KB Output is correct
74 Correct 641 ms 43964 KB Output is correct
75 Correct 606 ms 44060 KB Output is correct
76 Correct 632 ms 44548 KB Output is correct
77 Correct 454 ms 43948 KB Output is correct
78 Correct 496 ms 44248 KB Output is correct
79 Correct 444 ms 44228 KB Output is correct
80 Correct 242 ms 44348 KB Output is correct
81 Correct 223 ms 44356 KB Output is correct
82 Correct 318 ms 44256 KB Output is correct
83 Correct 290 ms 44000 KB Output is correct
84 Correct 415 ms 38112 KB Output is correct
85 Correct 378 ms 34156 KB Output is correct
86 Correct 357 ms 33704 KB Output is correct
87 Correct 532 ms 39140 KB Output is correct
88 Correct 560 ms 39272 KB Output is correct
89 Correct 554 ms 39376 KB Output is correct
90 Correct 555 ms 39084 KB Output is correct
91 Correct 556 ms 39120 KB Output is correct
92 Correct 875 ms 41560 KB Output is correct
93 Correct 770 ms 43204 KB Output is correct
94 Correct 798 ms 38108 KB Output is correct
95 Correct 808 ms 37960 KB Output is correct
96 Correct 815 ms 38128 KB Output is correct
97 Correct 828 ms 38248 KB Output is correct
98 Correct 398 ms 45384 KB Output is correct
99 Correct 394 ms 45120 KB Output is correct
100 Correct 425 ms 45252 KB Output is correct
101 Correct 419 ms 45380 KB Output is correct
102 Correct 485 ms 40064 KB Output is correct
103 Correct 504 ms 40336 KB Output is correct
104 Correct 466 ms 40408 KB Output is correct
105 Correct 299 ms 40668 KB Output is correct
106 Correct 274 ms 40912 KB Output is correct
107 Correct 352 ms 41664 KB Output is correct
108 Correct 334 ms 41256 KB Output is correct