oj.uz

Submission #868434

# Submission time Handle Problem Language Result Execution time Memory
868434 2023-10-31T13:22:23 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 3212 ms 162108 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));
        }
    }
    T* upd(T *i, int l, int r, int p, const S &v) {
        if (l + 1 == r) {
            return new T(f(i->s, v));
        }
        int m = (l + r) / 2;
        if (p < m) {
            return new T(upd(i->l, l, m, p, v), i->r);
        } else {
            return new T(i->l, upd(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 lst() {
        return 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);
    }
    void upd(int k, int i, const S &v) {
        rts[k] = upd(rts[k], 0, n, i, v);
    }
    S qry(int k, int l, int r) {
        return qry(rts[k], 0, n, l, r);
    }
};
ll F(ll x, ll y) {
    return x + y;
}
struct HLD {
    int n, timer;
    vector<int> sz, dep, par, top, pos;
    vector<vector<int>> adj;
    HLD(int n) : n(n) {
        sz.resize(n);
        dep.resize(n);
        top.resize(n);
        pos.resize(n);
        adj.resize(n);
        par.resize(n);
    }
    void add_edge(int x, int y) {
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    void init(int x) {
        sz[x] = 1;
        for (int &y : adj[x]) {
            dep[y] = dep[x] + 1;
            adj[y].erase(find(adj[y].begin(), adj[y].end(), par[y] = x));
            init(y);
            sz[x] += sz[y];
            if (sz[y] > sz[adj[x][0]]) {
                swap(y, adj[x][0]);
            }
        }
    }
    void dfs(int x) {
        pos[x] = timer++;
        for (int y : adj[x]) {
            top[y] = y == adj[x][0] ? top[x] : y;
            dfs(y);
        }
    }
    void build() {
        par[0] = -1; init(0);
        timer = 0; dfs(0);
    }
    int lca(int x, int y) {
        for (; top[x] != top[y]; x = par[top[x]]) {
            if (dep[top[x]] < dep[top[y]]) {
                swap(x, y);
            }
        }
        return dep[x] < dep[y] ? x : y;
    }
    template <class T>
    void path(int x, int y, bool e, T f) {
        for (; top[x] != top[y]; x = par[top[x]]) {
            if (dep[top[x]] < dep[top[y]]) {
                swap(x, y);
            }
            f(pos[top[x]], pos[x] + 1);
        }
        if (dep[x] > dep[y]) {
            swap(x, y);
        }
        f(pos[x] + e, pos[y] + 1);
    }
};
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);
    }
    HLD hld(N);
    for (int i = 0; i < N; i++) {
        for (int &j : adj[i]) {
            auto [x, y] = edges[j];
            j = i ^ x ^ y;
            if (j < i) {
                hld.add_edge(i, j);
            }
        }
    }
    hld.build();
    PST<ll, F, 0> q(N);
    for (int i = 0; i < M; i++) {
        auto [c, p] = ch[i];
        q.upd(q.cpy(q.lst()), hld.pos[t[p]], c);
    }
    auto get = [&](int x, int y, int z) -> ll {
        ll s = 0;
        hld.path(x, y, 1, [&](int l, int r) {
            s += q.qry(z, l, r);
        });
        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, F, 0>(N);
    for (int i = M; i >= 0; i--) {
        if (i < M) {
            auto [c, p] = ch[i];
            q.upd(q.cpy(q.lst()), hld.pos[t[p]], 1);
        }
        for (int j : f[i]) {
            ans[j] = max(-1LL, X[j] - get(S[j], T[j], q.lst()));
        }
    }
    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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2528 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 9 ms 1884 KB Output is correct
8 Correct 14 ms 2788 KB Output is correct
9 Correct 12 ms 2648 KB Output is correct
10 Correct 12 ms 2652 KB Output is correct
11 Correct 12 ms 2784 KB Output is correct
12 Correct 12 ms 2652 KB Output is correct
13 Correct 7 ms 2908 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 11 ms 2652 KB Output is correct
16 Correct 10 ms 2652 KB Output is correct
17 Correct 10 ms 2652 KB Output is correct
18 Correct 12 ms 2820 KB Output is correct
19 Correct 11 ms 2784 KB Output is correct
20 Correct 8 ms 2648 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 8 ms 2652 KB Output is correct
23 Correct 11 ms 2652 KB Output is correct
24 Correct 11 ms 2652 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 9 ms 2652 KB Output is correct
27 Correct 10 ms 2680 KB Output is correct
28 Correct 14 ms 2648 KB Output is correct
29 Correct 9 ms 2532 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 12 ms 2904 KB Output is correct
32 Correct 12 ms 2784 KB Output is correct
33 Correct 8 ms 2908 KB Output is correct
34 Correct 7 ms 2908 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 1 ms 344 KB Output is correct
2 Correct 11 ms 2628 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 12 ms 2648 KB Output is correct
5 Correct 1923 ms 138348 KB Output is correct
6 Correct 2533 ms 118720 KB Output is correct
7 Correct 2332 ms 105172 KB Output is correct
8 Correct 1729 ms 101460 KB Output is correct
9 Correct 1664 ms 107468 KB Output is correct
10 Correct 3212 ms 152604 KB Output is correct
11 Correct 3147 ms 153124 KB Output is correct
12 Correct 3168 ms 152748 KB Output is correct
13 Correct 3191 ms 152568 KB Output is correct
14 Correct 3103 ms 152712 KB Output is correct
15 Correct 1675 ms 160548 KB Output is correct
16 Correct 1554 ms 161028 KB Output is correct
17 Correct 1505 ms 160188 KB Output is correct
18 Correct 2796 ms 153192 KB Output is correct
19 Correct 2857 ms 152944 KB Output is correct
20 Correct 2562 ms 152772 KB Output is correct
21 Correct 1114 ms 153836 KB Output is correct
22 Correct 865 ms 153648 KB Output is correct
23 Correct 1182 ms 153660 KB Output is correct
24 Correct 912 ms 153640 KB Output is correct
25 Correct 1702 ms 154088 KB Output is correct
26 Correct 1808 ms 150928 KB Output is correct
27 Correct 1694 ms 154256 KB Output is correct
28 Correct 1095 ms 152056 KB Output is correct
29 Correct 939 ms 152060 KB Output is correct
30 Correct 1639 ms 152056 KB Output is correct
31 Correct 1713 ms 152056 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 2932 KB Output is correct
3 Correct 7 ms 2908 KB Output is correct
4 Correct 7 ms 2908 KB Output is correct
5 Correct 769 ms 114964 KB Output is correct
6 Correct 712 ms 97520 KB Output is correct
7 Correct 1074 ms 130784 KB Output is correct
8 Correct 1528 ms 161324 KB Output is correct
9 Correct 1501 ms 161244 KB Output is correct
10 Correct 1530 ms 161196 KB Output is correct
11 Correct 1237 ms 162108 KB Output is correct
12 Correct 1154 ms 161996 KB Output is correct
13 Correct 1130 ms 159036 KB Output is correct
14 Correct 757 ms 160512 KB Output is correct
15 Correct 633 ms 160044 KB Output is correct
16 Correct 926 ms 160512 KB Output is correct
17 Correct 844 ms 160560 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2528 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 9 ms 1884 KB Output is correct
8 Correct 14 ms 2788 KB Output is correct
9 Correct 12 ms 2648 KB Output is correct
10 Correct 12 ms 2652 KB Output is correct
11 Correct 12 ms 2784 KB Output is correct
12 Correct 12 ms 2652 KB Output is correct
13 Correct 7 ms 2908 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 11 ms 2652 KB Output is correct
16 Correct 10 ms 2652 KB Output is correct
17 Correct 10 ms 2652 KB Output is correct
18 Correct 12 ms 2820 KB Output is correct
19 Correct 11 ms 2784 KB Output is correct
20 Correct 8 ms 2648 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 8 ms 2652 KB Output is correct
23 Correct 11 ms 2652 KB Output is correct
24 Correct 11 ms 2652 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 9 ms 2652 KB Output is correct
27 Correct 10 ms 2680 KB Output is correct
28 Correct 14 ms 2648 KB Output is correct
29 Correct 9 ms 2532 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 12 ms 2904 KB Output is correct
32 Correct 12 ms 2784 KB Output is correct
33 Correct 8 ms 2908 KB Output is correct
34 Correct 7 ms 2908 KB Output is correct
35 Correct 7 ms 2908 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 11 ms 2628 KB Output is correct
38 Correct 11 ms 2652 KB Output is correct
39 Correct 12 ms 2648 KB Output is correct
40 Correct 1923 ms 138348 KB Output is correct
41 Correct 2533 ms 118720 KB Output is correct
42 Correct 2332 ms 105172 KB Output is correct
43 Correct 1729 ms 101460 KB Output is correct
44 Correct 1664 ms 107468 KB Output is correct
45 Correct 3212 ms 152604 KB Output is correct
46 Correct 3147 ms 153124 KB Output is correct
47 Correct 3168 ms 152748 KB Output is correct
48 Correct 3191 ms 152568 KB Output is correct
49 Correct 3103 ms 152712 KB Output is correct
50 Correct 1675 ms 160548 KB Output is correct
51 Correct 1554 ms 161028 KB Output is correct
52 Correct 1505 ms 160188 KB Output is correct
53 Correct 2796 ms 153192 KB Output is correct
54 Correct 2857 ms 152944 KB Output is correct
55 Correct 2562 ms 152772 KB Output is correct
56 Correct 1114 ms 153836 KB Output is correct
57 Correct 865 ms 153648 KB Output is correct
58 Correct 1182 ms 153660 KB Output is correct
59 Correct 912 ms 153640 KB Output is correct
60 Correct 1702 ms 154088 KB Output is correct
61 Correct 1808 ms 150928 KB Output is correct
62 Correct 1694 ms 154256 KB Output is correct
63 Correct 1095 ms 152056 KB Output is correct
64 Correct 939 ms 152060 KB Output is correct
65 Correct 1639 ms 152056 KB Output is correct
66 Correct 1713 ms 152056 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 7 ms 2932 KB Output is correct
69 Correct 7 ms 2908 KB Output is correct
70 Correct 7 ms 2908 KB Output is correct
71 Correct 769 ms 114964 KB Output is correct
72 Correct 712 ms 97520 KB Output is correct
73 Correct 1074 ms 130784 KB Output is correct
74 Correct 1528 ms 161324 KB Output is correct
75 Correct 1501 ms 161244 KB Output is correct
76 Correct 1530 ms 161196 KB Output is correct
77 Correct 1237 ms 162108 KB Output is correct
78 Correct 1154 ms 161996 KB Output is correct
79 Correct 1130 ms 159036 KB Output is correct
80 Correct 757 ms 160512 KB Output is correct
81 Correct 633 ms 160044 KB Output is correct
82 Correct 926 ms 160512 KB Output is correct
83 Correct 844 ms 160560 KB Output is correct
84 Correct 1792 ms 136948 KB Output is correct
85 Correct 1850 ms 115840 KB Output is correct
86 Correct 1557 ms 85740 KB Output is correct
87 Correct 2995 ms 152576 KB Output is correct
88 Correct 2973 ms 152820 KB Output is correct
89 Correct 2993 ms 152676 KB Output is correct
90 Correct 3041 ms 152568 KB Output is correct
91 Correct 3112 ms 152596 KB Output is correct
92 Correct 1779 ms 158236 KB Output is correct
93 Correct 1693 ms 159932 KB Output is correct
94 Correct 2869 ms 152776 KB Output is correct
95 Correct 2908 ms 152800 KB Output is correct
96 Correct 2860 ms 152796 KB Output is correct
97 Correct 2987 ms 152764 KB Output is correct
98 Correct 1638 ms 153660 KB Output is correct
99 Correct 1578 ms 153648 KB Output is correct
100 Correct 1652 ms 153640 KB Output is correct
101 Correct 1552 ms 153740 KB Output is correct
102 Correct 2097 ms 150924 KB Output is correct
103 Correct 2104 ms 154084 KB Output is correct
104 Correct 2101 ms 150980 KB Output is correct
105 Correct 1190 ms 152076 KB Output is correct
106 Correct 1469 ms 152176 KB Output is correct
107 Correct 1626 ms 152112 KB Output is correct
108 Correct 1520 ms 152048 KB Output is correct