oj.uz

Submission #866939

# Submission time Handle Problem Language Result Execution time Memory
866939 2023-10-27T12:32:26 Z t6twotwo Two Currencies (JOI23_currencies) C++17
68 / 100
 5000 ms 774384 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, S (*&g)(S a, S b), const S &v) {
        if (l + 1 == r) {
            return new T(g(i->s, v));
        }
        int m = (l + r) / 2;
        if (p < m) {
            return new T(upd(i->l, l, m, p, g, v), i->r);
        } else {
            return new T(i->l, upd(i->r, m, r, p, g, 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, S (*g)(S a, S b), const S &v) {
        rts[k] = upd(rts[k], 0, n, i, g, v);
    }
    void upd(int k, int i, const S &v) {
        upd(k, i, f, 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;
}
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, F, 0> q(N);
    for (int i = 0; i < M; i++) {
        auto [c, p] = ch[i];
        q.upd(q.cpy(q.lst()), in[t[p]], c);
        for (int j = 0; j < 10; j++) {
            q.upd(q.lst(), in[t[p]], 0);
        }
    }
    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, F, 0>(N);
    assert(q.lst() == 0);
    for (int i = M; i >= 0; i--) {
        if (i < M) {
            auto [c, p] = ch[i];
            q.upd(q.cpy(q.lst()), in[t[p]], 1);
            q.upd(q.lst(), in[t[p]], 0);
            for (int j = 0; j < 10; j++) {
                // q.upd(q.lst(), in[t[p]], 0);
            }
        }
        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 356 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 17 ms 10072 KB Output is correct
6 Correct 25 ms 10076 KB Output is correct
7 Correct 15 ms 7516 KB Output is correct
8 Correct 29 ms 10844 KB Output is correct
9 Correct 21 ms 10836 KB Output is correct
10 Correct 28 ms 10844 KB Output is correct
11 Correct 27 ms 10848 KB Output is correct
12 Correct 28 ms 10848 KB Output is correct
13 Correct 16 ms 11108 KB Output is correct
14 Correct 24 ms 11112 KB Output is correct
15 Correct 18 ms 10876 KB Output is correct
16 Correct 26 ms 10852 KB Output is correct
17 Correct 27 ms 10832 KB Output is correct
18 Correct 26 ms 10860 KB Output is correct
19 Correct 16 ms 10844 KB Output is correct
20 Correct 16 ms 10844 KB Output is correct
21 Correct 22 ms 10844 KB Output is correct
22 Correct 16 ms 10844 KB Output is correct
23 Correct 19 ms 10832 KB Output is correct
24 Correct 19 ms 10844 KB Output is correct
25 Correct 29 ms 10864 KB Output is correct
26 Correct 24 ms 10840 KB Output is correct
27 Correct 22 ms 10840 KB Output is correct
28 Correct 27 ms 10844 KB Output is correct
29 Correct 18 ms 10844 KB Output is correct
30 Correct 28 ms 10844 KB Output is correct
31 Correct 26 ms 10776 KB Output is correct
32 Correct 19 ms 10920 KB Output is correct
33 Correct 22 ms 11016 KB Output is correct
34 Correct 14 ms 11104 KB Output is correct
35 Correct 20 ms 11120 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 28 ms 10780 KB Output is correct
3 Correct 30 ms 11000 KB Output is correct
4 Correct 23 ms 10840 KB Output is correct
5 Correct 2697 ms 679536 KB Output is correct
6 Correct 3406 ms 601544 KB Output is correct
7 Correct 2949 ms 498748 KB Output is correct
8 Correct 2187 ms 477376 KB Output is correct
9 Correct 2265 ms 515156 KB Output is correct
10 Correct 4073 ms 761436 KB Output is correct
11 Correct 4029 ms 761512 KB Output is correct
12 Correct 3923 ms 761580 KB Output is correct
13 Correct 4122 ms 761404 KB Output is correct
14 Correct 4297 ms 761632 KB Output is correct
15 Correct 2550 ms 773052 KB Output is correct
16 Correct 2441 ms 773772 KB Output is correct
17 Correct 2544 ms 772596 KB Output is correct
18 Correct 4161 ms 762280 KB Output is correct
19 Correct 4172 ms 762160 KB Output is correct
20 Correct 3974 ms 759608 KB Output is correct
21 Correct 1595 ms 757200 KB Output is correct
22 Correct 1569 ms 757204 KB Output is correct
23 Correct 1677 ms 757252 KB Output is correct
24 Correct 1626 ms 757424 KB Output is correct
25 Correct 2703 ms 763092 KB Output is correct
26 Correct 2782 ms 742572 KB Output is correct
27 Correct 2691 ms 742736 KB Output is correct
28 Correct 1828 ms 755880 KB Output is correct
29 Correct 1659 ms 755748 KB Output is correct
30 Correct 2482 ms 755980 KB Output is correct
31 Correct 2341 ms 756064 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 16 ms 11100 KB Output is correct
3 Correct 16 ms 11100 KB Output is correct
4 Correct 15 ms 10956 KB Output is correct
5 Correct 1402 ms 506444 KB Output is correct
6 Correct 1272 ms 406676 KB Output is correct
7 Correct 2037 ms 665780 KB Output is correct
8 Correct 2614 ms 768180 KB Output is correct
9 Correct 2631 ms 768028 KB Output is correct
10 Correct 2648 ms 768292 KB Output is correct
11 Correct 2179 ms 774324 KB Output is correct
12 Correct 2151 ms 774384 KB Output is correct
13 Correct 2178 ms 754148 KB Output is correct
14 Correct 1713 ms 767024 KB Output is correct
15 Correct 1549 ms 766784 KB Output is correct
16 Correct 1965 ms 767356 KB Output is correct
17 Correct 1934 ms 767248 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 17 ms 10072 KB Output is correct
6 Correct 25 ms 10076 KB Output is correct
7 Correct 15 ms 7516 KB Output is correct
8 Correct 29 ms 10844 KB Output is correct
9 Correct 21 ms 10836 KB Output is correct
10 Correct 28 ms 10844 KB Output is correct
11 Correct 27 ms 10848 KB Output is correct
12 Correct 28 ms 10848 KB Output is correct
13 Correct 16 ms 11108 KB Output is correct
14 Correct 24 ms 11112 KB Output is correct
15 Correct 18 ms 10876 KB Output is correct
16 Correct 26 ms 10852 KB Output is correct
17 Correct 27 ms 10832 KB Output is correct
18 Correct 26 ms 10860 KB Output is correct
19 Correct 16 ms 10844 KB Output is correct
20 Correct 16 ms 10844 KB Output is correct
21 Correct 22 ms 10844 KB Output is correct
22 Correct 16 ms 10844 KB Output is correct
23 Correct 19 ms 10832 KB Output is correct
24 Correct 19 ms 10844 KB Output is correct
25 Correct 29 ms 10864 KB Output is correct
26 Correct 24 ms 10840 KB Output is correct
27 Correct 22 ms 10840 KB Output is correct
28 Correct 27 ms 10844 KB Output is correct
29 Correct 18 ms 10844 KB Output is correct
30 Correct 28 ms 10844 KB Output is correct
31 Correct 26 ms 10776 KB Output is correct
32 Correct 19 ms 10920 KB Output is correct
33 Correct 22 ms 11016 KB Output is correct
34 Correct 14 ms 11104 KB Output is correct
35 Correct 20 ms 11120 KB Output is correct
36 Correct 1 ms 352 KB Output is correct
37 Correct 28 ms 10780 KB Output is correct
38 Correct 30 ms 11000 KB Output is correct
39 Correct 23 ms 10840 KB Output is correct
40 Correct 2697 ms 679536 KB Output is correct
41 Correct 3406 ms 601544 KB Output is correct
42 Correct 2949 ms 498748 KB Output is correct
43 Correct 2187 ms 477376 KB Output is correct
44 Correct 2265 ms 515156 KB Output is correct
45 Correct 4073 ms 761436 KB Output is correct
46 Correct 4029 ms 761512 KB Output is correct
47 Correct 3923 ms 761580 KB Output is correct
48 Correct 4122 ms 761404 KB Output is correct
49 Correct 4297 ms 761632 KB Output is correct
50 Correct 2550 ms 773052 KB Output is correct
51 Correct 2441 ms 773772 KB Output is correct
52 Correct 2544 ms 772596 KB Output is correct
53 Correct 4161 ms 762280 KB Output is correct
54 Correct 4172 ms 762160 KB Output is correct
55 Correct 3974 ms 759608 KB Output is correct
56 Correct 1595 ms 757200 KB Output is correct
57 Correct 1569 ms 757204 KB Output is correct
58 Correct 1677 ms 757252 KB Output is correct
59 Correct 1626 ms 757424 KB Output is correct
60 Correct 2703 ms 763092 KB Output is correct
61 Correct 2782 ms 742572 KB Output is correct
62 Correct 2691 ms 742736 KB Output is correct
63 Correct 1828 ms 755880 KB Output is correct
64 Correct 1659 ms 755748 KB Output is correct
65 Correct 2482 ms 755980 KB Output is correct
66 Correct 2341 ms 756064 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 16 ms 11100 KB Output is correct
69 Correct 16 ms 11100 KB Output is correct
70 Correct 15 ms 10956 KB Output is correct
71 Correct 1402 ms 506444 KB Output is correct
72 Correct 1272 ms 406676 KB Output is correct
73 Correct 2037 ms 665780 KB Output is correct
74 Correct 2614 ms 768180 KB Output is correct
75 Correct 2631 ms 768028 KB Output is correct
76 Correct 2648 ms 768292 KB Output is correct
77 Correct 2179 ms 774324 KB Output is correct
78 Correct 2151 ms 774384 KB Output is correct
79 Correct 2178 ms 754148 KB Output is correct
80 Correct 1713 ms 767024 KB Output is correct
81 Correct 1549 ms 766784 KB Output is correct
82 Correct 1965 ms 767356 KB Output is correct
83 Correct 1934 ms 767248 KB Output is correct
84 Correct 3104 ms 692424 KB Output is correct
85 Correct 3412 ms 605964 KB Output is correct
86 Correct 2777 ms 423728 KB Output is correct
87 Correct 4821 ms 760548 KB Output is correct
88 Correct 4941 ms 760952 KB Output is correct
89 Execution timed out 5051 ms 757756 KB Time limit exceeded
90 Halted 0 ms 0 KB -