oj.uz

Submission #790320

# Submission time Handle Problem Language Result Execution time Memory
790320 2023-07-22T14:39:43 Z Johann Two Currencies (JOI23_currencies) C++14
100 / 100
 2770 ms 229504 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
pii operator+(const pii &a, const pii &b) { return {a.first + b.first, a.second + b.second}; }
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

int N, M, Q;
vi A, B;
vector<vector<ll>> C;
vpii D; // what to delete
vvpii adj;
vi in, out;
vvi vorg;
vi ein, eout; // edges to corresponding in and outs
vi R;         // binary search those roots

struct segtree
{
    int size;
    vpii arr;
    vi L, R;
    vi roots;
    int newNode()
    {
        arr.push_back({0, 0}), L.push_back(-1), R.push_back(-1);
        return sz(arr) - 1;
    }
    void init(int _size)
    {
        size = 1;
        while (size < _size)
            size *= 2;
        arr.assign(2 * size, {0, 0});
        L.assign(2 * size, -1), R.assign(2 * size, -1);
        roots.push_back(1);
        for (int i = 1; i < size; ++i)
            L[i] = 2 * i, R[i] = 2 * i + 1;
    }
    int add(int i, pii v)
    {
        int idx = newNode();
        add(i, v, idx, roots.back(), 0, size);
        roots.push_back(idx);
        return idx;
    }
    void add(int i, pii v, int newX, int oldX, int lx, int rx)
    {
        L[newX] = L[oldX], R[newX] = R[oldX], arr[newX] = arr[oldX];
        if (rx - lx == 1)
        {
            arr[newX] = arr[oldX] + v;
            return;
        }
        int m = (lx + rx) / 2;
        int idx = newNode();
        if (i < m)
        {
            L[newX] = idx;
            add(i, v, L[newX], L[oldX], lx, m);
        }
        else
        {
            R[newX] = idx;
            add(i, v, R[newX], R[oldX], m, rx);
        }
        arr[newX] = arr[L[newX]] + arr[R[newX]];
    }
    pii summe(int l, int r, int x)
    {
        return summe(l, r, x, 0, size);
    }
    pii summe(int l, int r, int x, int lx, int rx)
    {
        if (l <= lx && rx <= r)
            return arr[x];
        if (r <= lx || rx <= l)
            return {0, 0};
        int m = (lx + rx) / 2;
        pii a = summe(l, r, L[x], lx, m);
        pii b = summe(l, r, R[x], m, rx);
        return a + b;
        // return {a.first + b.first, a.second + b.second};
    }
};
segtree seg;

void dfs(int v, int p, int e, int &idx)
{
    vorg[v][0] = p;
    for (int i = 1; i < sz(vorg[v]); ++i)
        vorg[v][i] = vorg[vorg[v][i - 1]][i - 1];

    in[v] = idx;
    if (e != -1)
        ein[e] = idx;
    ++idx;

    for (pii ed : adj[v])
    {
        if (ed.first == p)
            continue;
        dfs(ed.first, v, ed.second, idx);
    }

    out[v] = idx;
    if (e != -1)
        eout[e] = idx;
    ++idx;
}

bool isVorg(int a, int b)
{
    return in[a] <= in[b] && out[b] <= out[a];
}

int lca(int a, int b)
{
    if (isVorg(a, b))
        return a;
    if (isVorg(b, a))
        return b;

    int tmp;
    for (int i = sz(vorg[0]) - 1; i >= 0; --i)
    {
        tmp = vorg[a][i];
        if (!isVorg(tmp, b))
            a = tmp;
    }
    return vorg[a][0];
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M >> Q;

    adj.resize(N);
    A.resize(N - 1), B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i)
    {
        cin >> A[i] >> B[i];
        --A[i], --B[i];
        adj[A[i]].push_back({B[i], i});
        adj[B[i]].push_back({A[i], i});
    }

    in.resize(N), out.resize(N);
    ein.resize(N - 1), eout.resize(N - 1);
    vorg.assign(N, vi(ceil(log2(N)) + 1));
    int idx = 0;
    dfs(0, 0, -1, idx);

    C.resize(N - 1);
    for (int i = 0, p, c; i < M; ++i)
    {
        cin >> p >> c;
        --p;
        C[p].push_back(c);
        D.push_back({c, p});
    }

    seg.init(2 * N);
    for (int i = 0; i < N - 1; ++i)
    {
        if (!C[i].empty())
        {
            seg.add(ein[i], {0, accumulate(all(C[i]), 0LL)});
            seg.add(eout[i], {0, -accumulate(all(C[i]), 0LL)});
        }
    }

    sort(all(D));
    reverse(all(D));
    R.push_back(seg.roots.back());
    for (pii d : D)
    {
        seg.add(ein[d.second], {1, -d.first});
        R.push_back(seg.add(eout[d.second], {-1, d.first}));
    }

    while (Q--)
    {
        int s, t;
        ll x, y;
        cin >> s >> t >> x >> y;
        --s, --t;
        int lc = lca(s, t);

        int l = 0, r = sz(R), m;
        while (l < r)
        {
            m = (l + r) / 2;
            pii ans = seg.summe(in[lc] + 1, in[s] + 1, R[m]) + seg.summe(in[lc] + 1, in[t] + 1, R[m]);
            if (ans.second > y)
                l = m + 1;
            else
                r = m;
        }
        if (l == sz(R))
            cout << "-1\n";
        else
        {
            pii ans = seg.summe(in[lc] + 1, in[s] + 1, R[l]) + seg.summe(in[lc] + 1, in[t] + 1, R[l]);
            if (ans.second <= y && ans.first <= x)
                cout << x - ans.first << "\n";
            else
                cout << "-1\n";
        }
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 3528 KB Output is correct
6 Correct 10 ms 3660 KB Output is correct
7 Correct 9 ms 3536 KB Output is correct
8 Correct 15 ms 3776 KB Output is correct
9 Correct 11 ms 3780 KB Output is correct
10 Correct 11 ms 3780 KB Output is correct
11 Correct 11 ms 3780 KB Output is correct
12 Correct 11 ms 3716 KB Output is correct
13 Correct 10 ms 3904 KB Output is correct
14 Correct 11 ms 3908 KB Output is correct
15 Correct 11 ms 3780 KB Output is correct
16 Correct 11 ms 3780 KB Output is correct
17 Correct 11 ms 3756 KB Output is correct
18 Correct 11 ms 3780 KB Output is correct
19 Correct 11 ms 3776 KB Output is correct
20 Correct 11 ms 3780 KB Output is correct
21 Correct 11 ms 3780 KB Output is correct
22 Correct 14 ms 3748 KB Output is correct
23 Correct 10 ms 3784 KB Output is correct
24 Correct 13 ms 3784 KB Output is correct
25 Correct 11 ms 3712 KB Output is correct
26 Correct 10 ms 3824 KB Output is correct
27 Correct 13 ms 3780 KB Output is correct
28 Correct 14 ms 3704 KB Output is correct
29 Correct 9 ms 3780 KB Output is correct
30 Correct 11 ms 3768 KB Output is correct
31 Correct 11 ms 3824 KB Output is correct
32 Correct 11 ms 3780 KB Output is correct
33 Correct 11 ms 3908 KB Output is correct
34 Correct 10 ms 3972 KB Output is correct
35 Correct 10 ms 3908 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 3704 KB Output is correct
3 Correct 12 ms 3780 KB Output is correct
4 Correct 12 ms 3772 KB Output is correct
5 Correct 1365 ms 217856 KB Output is correct
6 Correct 1767 ms 209124 KB Output is correct
7 Correct 1608 ms 212244 KB Output is correct
8 Correct 1245 ms 213228 KB Output is correct
9 Correct 1188 ms 213328 KB Output is correct
10 Correct 2161 ms 221168 KB Output is correct
11 Correct 2138 ms 221140 KB Output is correct
12 Correct 2227 ms 221216 KB Output is correct
13 Correct 2029 ms 221132 KB Output is correct
14 Correct 2124 ms 221040 KB Output is correct
15 Correct 2000 ms 228992 KB Output is correct
16 Correct 1980 ms 229296 KB Output is correct
17 Correct 2001 ms 228472 KB Output is correct
18 Correct 2359 ms 221512 KB Output is correct
19 Correct 2324 ms 221420 KB Output is correct
20 Correct 2496 ms 221696 KB Output is correct
21 Correct 1246 ms 220204 KB Output is correct
22 Correct 1286 ms 220508 KB Output is correct
23 Correct 1376 ms 220484 KB Output is correct
24 Correct 1366 ms 220412 KB Output is correct
25 Correct 1361 ms 217792 KB Output is correct
26 Correct 1370 ms 217780 KB Output is correct
27 Correct 1336 ms 217780 KB Output is correct
28 Correct 1032 ms 221108 KB Output is correct
29 Correct 1078 ms 220972 KB Output is correct
30 Correct 1198 ms 221132 KB Output is correct
31 Correct 1320 ms 221152 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 13 ms 3908 KB Output is correct
3 Correct 10 ms 3908 KB Output is correct
4 Correct 10 ms 3908 KB Output is correct
5 Correct 1074 ms 222552 KB Output is correct
6 Correct 1026 ms 152708 KB Output is correct
7 Correct 1528 ms 208428 KB Output is correct
8 Correct 1928 ms 229300 KB Output is correct
9 Correct 1982 ms 229504 KB Output is correct
10 Correct 1955 ms 229268 KB Output is correct
11 Correct 1472 ms 225244 KB Output is correct
12 Correct 1450 ms 225172 KB Output is correct
13 Correct 1523 ms 225208 KB Output is correct
14 Correct 1123 ms 229140 KB Output is correct
15 Correct 1117 ms 229240 KB Output is correct
16 Correct 1265 ms 229352 KB Output is correct
17 Correct 1278 ms 229276 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 3528 KB Output is correct
6 Correct 10 ms 3660 KB Output is correct
7 Correct 9 ms 3536 KB Output is correct
8 Correct 15 ms 3776 KB Output is correct
9 Correct 11 ms 3780 KB Output is correct
10 Correct 11 ms 3780 KB Output is correct
11 Correct 11 ms 3780 KB Output is correct
12 Correct 11 ms 3716 KB Output is correct
13 Correct 10 ms 3904 KB Output is correct
14 Correct 11 ms 3908 KB Output is correct
15 Correct 11 ms 3780 KB Output is correct
16 Correct 11 ms 3780 KB Output is correct
17 Correct 11 ms 3756 KB Output is correct
18 Correct 11 ms 3780 KB Output is correct
19 Correct 11 ms 3776 KB Output is correct
20 Correct 11 ms 3780 KB Output is correct
21 Correct 11 ms 3780 KB Output is correct
22 Correct 14 ms 3748 KB Output is correct
23 Correct 10 ms 3784 KB Output is correct
24 Correct 13 ms 3784 KB Output is correct
25 Correct 11 ms 3712 KB Output is correct
26 Correct 10 ms 3824 KB Output is correct
27 Correct 13 ms 3780 KB Output is correct
28 Correct 14 ms 3704 KB Output is correct
29 Correct 9 ms 3780 KB Output is correct
30 Correct 11 ms 3768 KB Output is correct
31 Correct 11 ms 3824 KB Output is correct
32 Correct 11 ms 3780 KB Output is correct
33 Correct 11 ms 3908 KB Output is correct
34 Correct 10 ms 3972 KB Output is correct
35 Correct 10 ms 3908 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 11 ms 3704 KB Output is correct
38 Correct 12 ms 3780 KB Output is correct
39 Correct 12 ms 3772 KB Output is correct
40 Correct 1365 ms 217856 KB Output is correct
41 Correct 1767 ms 209124 KB Output is correct
42 Correct 1608 ms 212244 KB Output is correct
43 Correct 1245 ms 213228 KB Output is correct
44 Correct 1188 ms 213328 KB Output is correct
45 Correct 2161 ms 221168 KB Output is correct
46 Correct 2138 ms 221140 KB Output is correct
47 Correct 2227 ms 221216 KB Output is correct
48 Correct 2029 ms 221132 KB Output is correct
49 Correct 2124 ms 221040 KB Output is correct
50 Correct 2000 ms 228992 KB Output is correct
51 Correct 1980 ms 229296 KB Output is correct
52 Correct 2001 ms 228472 KB Output is correct
53 Correct 2359 ms 221512 KB Output is correct
54 Correct 2324 ms 221420 KB Output is correct
55 Correct 2496 ms 221696 KB Output is correct
56 Correct 1246 ms 220204 KB Output is correct
57 Correct 1286 ms 220508 KB Output is correct
58 Correct 1376 ms 220484 KB Output is correct
59 Correct 1366 ms 220412 KB Output is correct
60 Correct 1361 ms 217792 KB Output is correct
61 Correct 1370 ms 217780 KB Output is correct
62 Correct 1336 ms 217780 KB Output is correct
63 Correct 1032 ms 221108 KB Output is correct
64 Correct 1078 ms 220972 KB Output is correct
65 Correct 1198 ms 221132 KB Output is correct
66 Correct 1320 ms 221152 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 13 ms 3908 KB Output is correct
69 Correct 10 ms 3908 KB Output is correct
70 Correct 10 ms 3908 KB Output is correct
71 Correct 1074 ms 222552 KB Output is correct
72 Correct 1026 ms 152708 KB Output is correct
73 Correct 1528 ms 208428 KB Output is correct
74 Correct 1928 ms 229300 KB Output is correct
75 Correct 1982 ms 229504 KB Output is correct
76 Correct 1955 ms 229268 KB Output is correct
77 Correct 1472 ms 225244 KB Output is correct
78 Correct 1450 ms 225172 KB Output is correct
79 Correct 1523 ms 225208 KB Output is correct
80 Correct 1123 ms 229140 KB Output is correct
81 Correct 1117 ms 229240 KB Output is correct
82 Correct 1265 ms 229352 KB Output is correct
83 Correct 1278 ms 229276 KB Output is correct
84 Correct 1433 ms 213852 KB Output is correct
85 Correct 1569 ms 203960 KB Output is correct
86 Correct 1266 ms 118444 KB Output is correct
87 Correct 2365 ms 220980 KB Output is correct
88 Correct 2357 ms 221196 KB Output is correct
89 Correct 2403 ms 221112 KB Output is correct
90 Correct 2359 ms 221116 KB Output is correct
91 Correct 2306 ms 220844 KB Output is correct
92 Correct 2373 ms 226552 KB Output is correct
93 Correct 2281 ms 228200 KB Output is correct
94 Correct 2770 ms 221376 KB Output is correct
95 Correct 2661 ms 221572 KB Output is correct
96 Correct 2607 ms 221496 KB Output is correct
97 Correct 2699 ms 221404 KB Output is correct
98 Correct 2249 ms 220384 KB Output is correct
99 Correct 2184 ms 220136 KB Output is correct
100 Correct 2251 ms 220412 KB Output is correct
101 Correct 2254 ms 220340 KB Output is correct
102 Correct 1746 ms 217900 KB Output is correct
103 Correct 1758 ms 217796 KB Output is correct
104 Correct 1714 ms 217812 KB Output is correct
105 Correct 1177 ms 221028 KB Output is correct
106 Correct 1140 ms 221236 KB Output is correct
107 Correct 1188 ms 220908 KB Output is correct
108 Correct 1270 ms 221064 KB Output is correct