oj.uz

Submission #866930

# Submission time Handle Problem Language Result Execution time Memory
866930 2023-10-27T12:08:43 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 2836 ms 165296 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class S, S (*f)(S, S), S e>
struct PST {
    struct T {
        T *l, *r; S s;
        T() : s() {l = r = nullptr;}
        T(const S &v) : s(v) {l = r = nullptr;}
        T(T *t) : l(t->l), r(t->r), s(t->s) {}
        T(T *a, T *b) : l(a), r(b), s() {
            if (l) s = f(s, l->s);
            if (r) s = f(s, r->s);
        }
    };
    int n;
    vector<T*> rts;
    PST(int m) : PST(vector<S>(m, e)) {
    }
    PST(const vector<S> &a) : n(a.size()) {
        function<T*(int, int)> bld = [&](int l, int r) {
            if (l + 1 == r) {
                return new T(a[l]);
            }
            int m = (l + r) / 2;
            return new T(bld(l, m), bld(m, r));
        };
        rts.push_back(bld(0, n));
    }
    T* set(T *i, int l, int r, int p, const S &v) {
        if (l + 1 == r) {
            return new T(v);
        }
        int m = (l + r) / 2;
        if (p < m) {
            return new T(set(i->l, l, m, p, v), i->r);
        } else {
            return new T(i->l, set(i->r, m, r, p, v));
        }
    }
    S qry(T *i, int l, int r, int L, int R) {
        if (R <= l || r <= L) {
            return e;
        }
        if (L <= l && r <= R) {
            return i->s;
        }
        int m = (l + r) / 2;
        return f(qry(i->l, l, m, L, R), qry(i->r, m, r, L, R));
    }
    int cpy() {
        return cpy(rts.size() - 1);
    }
    int cpy(int k) {
        rts.push_back(new T(rts[k]));
        return rts.size() - 1;
    }
    void set(int k, int i, const S &v) {
        rts[k] = set(rts[k], 0, n, i, v);
    }
    S qry(int k, int l, int r) {
        return qry(rts[k], 0, n, l, r);
    }
};
ll func(ll x, ll y) {
    return x + y;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M, Q;
    cin >> N >> M >> Q;
    vector<pair<int, int>> edges(N - 1);
    vector<vector<int>> adj(N);
    for (int i = 0; i < N - 1; i++) {
        int x, y;
        cin >> x >> y;
        x--, y--;
        edges[i] = {x, y};
        adj[x].push_back(i);
        adj[y].push_back(i);
    }
    vector<pair<int, int>> ch(M);
    for (int i = 0; i < M; i++) {
        int p, c;
        cin >> p >> c;
        ch[i] = {c, p - 1};
    }
    sort(ch.begin(), ch.end());
    vector<int> t(N - 1);
    {
        auto dfs = [&](auto dfs, int x, int p) -> void {
            for (int z : adj[x]) {
                auto [u, v] = edges[z];
                int y = x ^ u ^ v;
                if (y != p) {
                    t[z] = y;
                    dfs(dfs, y, x);
                }
            }
        };
        dfs(dfs, 0, -1);
    }
    for (int i = 0; i < N; i++) {
        for (int &j : adj[i]) {
            auto [x, y] = edges[j];
            j = i ^ x ^ y;
        }
    }
    vector<int> dep(N), par(N, -1), sz(N);
    auto init = [&](auto init, int x) -> void {
        if (par[x] != -1) {
            adj[x].erase(find(adj[x].begin(), adj[x].end(), par[x]));
        }
        sz[x] = 1;
        for (int &y : adj[x]) {
            par[y] = x;
            dep[y] = dep[x] + 1;
            init(init, y);
            sz[x] += sz[y];
            if (sz[y] > sz[adj[x][0]]) {
                swap(y, adj[x][0]);
            }
        }
    };
    init(init, 0);
    vector<int> top(N), in(N);
    int timer = 0;
    auto dfs = [&](auto dfs, int x) -> void {
        in[x] = timer++;
        for (int y : adj[x]) {
            top[y] = adj[x][0] == y ? top[x] : y;
            dfs(dfs, y);
        }
    };
    dfs(dfs, 0);
    PST<ll, func, 0> q(N);
    for (int i = 0; i < M; i++) {
        auto [c, p] = ch[i];
        q.cpy();
        q.set(i + 1, in[t[p]], q.qry(i + 1, in[t[p]], in[t[p]] + 1) + c);
    }
    auto get = [&](int x, int y, int z) {
        ll s = 0;
        while (top[x] != top[y]) {
            if (dep[top[x]] < dep[top[y]]) {
                swap(x, y);
            }
            s += q.qry(z, in[top[x]], in[x] + 1);
            x = par[top[x]];
        }
        if (dep[x] < dep[y]) {
            swap(x, y);
        }
        s += q.qry(z, in[y] + 1, in[x] + 1);
        return s;
    };
    vector<int> S(Q), T(Q), X(Q), a(Q);
    vector<ll> Y(Q);
    for (int i = 0; i < Q; i++) {
        cin >> S[i] >> T[i] >> X[i] >> Y[i];
        S[i]--, T[i]--;
        int lo = 0, hi = M;
        while (lo < hi) {
            int mi = (lo + hi + 1) / 2;
            if (get(S[i], T[i], mi) <= Y[i]) {
                lo = mi;
            } else {
                hi = mi - 1;
            }
        }
        a[i] = lo;
    }
    vector<ll> ans(Q);
    vector<vector<int>> f(M + 1);
    for (int i = 0; i < Q; i++) {
        f[a[i]].push_back(i);
    }
    q = PST<ll, func, 0>(N);
    for (int i = M; i >= 0; i--) {
        if (i < M) {
            auto [c, p] = ch[i];
            int k = q.cpy();
            q.set(k, in[t[p]], q.qry(k, in[t[p]], in[t[p]] + 1) + 1);
        }
        for (int j : f[i]) {
            ans[j] = max(-1LL, X[j] - get(S[j], T[j], q.rts.size() - 1));
        }
    }
    for (int i = 0; i < Q; i++) {
        cout << ans[i] << "\n";
    }
    return 6/22;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2380 KB Output is correct
6 Correct 11 ms 2588 KB Output is correct
7 Correct 9 ms 1884 KB Output is correct
8 Correct 12 ms 2760 KB Output is correct
9 Correct 13 ms 2652 KB Output is correct
10 Correct 12 ms 2504 KB Output is correct
11 Correct 12 ms 2648 KB Output is correct
12 Correct 12 ms 2652 KB Output is correct
13 Correct 8 ms 2908 KB Output is correct
14 Correct 10 ms 2720 KB Output is correct
15 Correct 9 ms 2648 KB Output is correct
16 Correct 10 ms 2652 KB Output is correct
17 Correct 10 ms 2716 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 9 ms 2652 KB Output is correct
20 Correct 8 ms 2756 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 10 ms 2772 KB Output is correct
23 Correct 11 ms 2776 KB Output is correct
24 Correct 11 ms 2652 KB Output is correct
25 Correct 13 ms 2768 KB Output is correct
26 Correct 10 ms 2648 KB Output is correct
27 Correct 8 ms 2652 KB Output is correct
28 Correct 11 ms 2760 KB Output is correct
29 Correct 6 ms 2652 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 12 ms 2652 KB Output is correct
32 Correct 12 ms 2652 KB Output is correct
33 Correct 7 ms 2976 KB Output is correct
34 Correct 8 ms 2976 KB Output is correct
35 Correct 7 ms 2908 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 11 ms 2648 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 11 ms 2580 KB Output is correct
5 Correct 1571 ms 137336 KB Output is correct
6 Correct 2053 ms 119620 KB Output is correct
7 Correct 1856 ms 105184 KB Output is correct
8 Correct 1454 ms 100364 KB Output is correct
9 Correct 1300 ms 106396 KB Output is correct
10 Correct 2618 ms 152184 KB Output is correct
11 Correct 2602 ms 152176 KB Output is correct
12 Correct 2579 ms 152200 KB Output is correct
13 Correct 2545 ms 152128 KB Output is correct
14 Correct 2611 ms 152112 KB Output is correct
15 Correct 1354 ms 163492 KB Output is correct
16 Correct 1275 ms 164208 KB Output is correct
17 Correct 1347 ms 163120 KB Output is correct
18 Correct 2423 ms 152860 KB Output is correct
19 Correct 2495 ms 152832 KB Output is correct
20 Correct 2390 ms 152816 KB Output is correct
21 Correct 893 ms 152092 KB Output is correct
22 Correct 869 ms 152480 KB Output is correct
23 Correct 899 ms 152504 KB Output is correct
24 Correct 891 ms 152376 KB Output is correct
25 Correct 1650 ms 154000 KB Output is correct
26 Correct 1727 ms 150776 KB Output is correct
27 Correct 1774 ms 150804 KB Output is correct
28 Correct 1123 ms 151476 KB Output is correct
29 Correct 955 ms 151392 KB Output is correct
30 Correct 1579 ms 151660 KB Output is correct
31 Correct 1445 ms 151856 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 2976 KB Output is correct
3 Correct 7 ms 2908 KB Output is correct
4 Correct 8 ms 2764 KB Output is correct
5 Correct 735 ms 116996 KB Output is correct
6 Correct 647 ms 99716 KB Output is correct
7 Correct 1050 ms 134348 KB Output is correct
8 Correct 1469 ms 164344 KB Output is correct
9 Correct 1454 ms 164348 KB Output is correct
10 Correct 1452 ms 164568 KB Output is correct
11 Correct 1106 ms 165296 KB Output is correct
12 Correct 1111 ms 165276 KB Output is correct
13 Correct 1106 ms 162072 KB Output is correct
14 Correct 769 ms 163356 KB Output is correct
15 Correct 637 ms 162920 KB Output is correct
16 Correct 831 ms 163564 KB Output is correct
17 Correct 840 ms 163408 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2380 KB Output is correct
6 Correct 11 ms 2588 KB Output is correct
7 Correct 9 ms 1884 KB Output is correct
8 Correct 12 ms 2760 KB Output is correct
9 Correct 13 ms 2652 KB Output is correct
10 Correct 12 ms 2504 KB Output is correct
11 Correct 12 ms 2648 KB Output is correct
12 Correct 12 ms 2652 KB Output is correct
13 Correct 8 ms 2908 KB Output is correct
14 Correct 10 ms 2720 KB Output is correct
15 Correct 9 ms 2648 KB Output is correct
16 Correct 10 ms 2652 KB Output is correct
17 Correct 10 ms 2716 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 9 ms 2652 KB Output is correct
20 Correct 8 ms 2756 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 10 ms 2772 KB Output is correct
23 Correct 11 ms 2776 KB Output is correct
24 Correct 11 ms 2652 KB Output is correct
25 Correct 13 ms 2768 KB Output is correct
26 Correct 10 ms 2648 KB Output is correct
27 Correct 8 ms 2652 KB Output is correct
28 Correct 11 ms 2760 KB Output is correct
29 Correct 6 ms 2652 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 12 ms 2652 KB Output is correct
32 Correct 12 ms 2652 KB Output is correct
33 Correct 7 ms 2976 KB Output is correct
34 Correct 8 ms 2976 KB Output is correct
35 Correct 7 ms 2908 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 11 ms 2648 KB Output is correct
38 Correct 11 ms 2652 KB Output is correct
39 Correct 11 ms 2580 KB Output is correct
40 Correct 1571 ms 137336 KB Output is correct
41 Correct 2053 ms 119620 KB Output is correct
42 Correct 1856 ms 105184 KB Output is correct
43 Correct 1454 ms 100364 KB Output is correct
44 Correct 1300 ms 106396 KB Output is correct
45 Correct 2618 ms 152184 KB Output is correct
46 Correct 2602 ms 152176 KB Output is correct
47 Correct 2579 ms 152200 KB Output is correct
48 Correct 2545 ms 152128 KB Output is correct
49 Correct 2611 ms 152112 KB Output is correct
50 Correct 1354 ms 163492 KB Output is correct
51 Correct 1275 ms 164208 KB Output is correct
52 Correct 1347 ms 163120 KB Output is correct
53 Correct 2423 ms 152860 KB Output is correct
54 Correct 2495 ms 152832 KB Output is correct
55 Correct 2390 ms 152816 KB Output is correct
56 Correct 893 ms 152092 KB Output is correct
57 Correct 869 ms 152480 KB Output is correct
58 Correct 899 ms 152504 KB Output is correct
59 Correct 891 ms 152376 KB Output is correct
60 Correct 1650 ms 154000 KB Output is correct
61 Correct 1727 ms 150776 KB Output is correct
62 Correct 1774 ms 150804 KB Output is correct
63 Correct 1123 ms 151476 KB Output is correct
64 Correct 955 ms 151392 KB Output is correct
65 Correct 1579 ms 151660 KB Output is correct
66 Correct 1445 ms 151856 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 7 ms 2976 KB Output is correct
69 Correct 7 ms 2908 KB Output is correct
70 Correct 8 ms 2764 KB Output is correct
71 Correct 735 ms 116996 KB Output is correct
72 Correct 647 ms 99716 KB Output is correct
73 Correct 1050 ms 134348 KB Output is correct
74 Correct 1469 ms 164344 KB Output is correct
75 Correct 1454 ms 164348 KB Output is correct
76 Correct 1452 ms 164568 KB Output is correct
77 Correct 1106 ms 165296 KB Output is correct
78 Correct 1111 ms 165276 KB Output is correct
79 Correct 1106 ms 162072 KB Output is correct
80 Correct 769 ms 163356 KB Output is correct
81 Correct 637 ms 162920 KB Output is correct
82 Correct 831 ms 163564 KB Output is correct
83 Correct 840 ms 163408 KB Output is correct
84 Correct 1631 ms 136524 KB Output is correct
85 Correct 1715 ms 117068 KB Output is correct
86 Correct 1453 ms 86040 KB Output is correct
87 Correct 2753 ms 152032 KB Output is correct
88 Correct 2762 ms 152000 KB Output is correct
89 Correct 2836 ms 151788 KB Output is correct
90 Correct 2808 ms 152076 KB Output is correct
91 Correct 2747 ms 151928 KB Output is correct
92 Correct 1579 ms 160048 KB Output is correct
93 Correct 1508 ms 163064 KB Output is correct
94 Correct 2640 ms 153088 KB Output is correct
95 Correct 2626 ms 152860 KB Output is correct
96 Correct 2665 ms 152992 KB Output is correct
97 Correct 2679 ms 152880 KB Output is correct
98 Correct 1487 ms 152548 KB Output is correct
99 Correct 1445 ms 152252 KB Output is correct
100 Correct 1449 ms 152388 KB Output is correct
101 Correct 1450 ms 152472 KB Output is correct
102 Correct 1879 ms 153936 KB Output is correct
103 Correct 1933 ms 150776 KB Output is correct
104 Correct 1860 ms 150632 KB Output is correct
105 Correct 1124 ms 151704 KB Output is correct
106 Correct 1372 ms 151924 KB Output is correct
107 Correct 1448 ms 151344 KB Output is correct
108 Correct 1430 ms 151396 KB Output is correct