oj.uz

Submission #866938

# Submission time Handle Problem Language Result Execution time Memory
866938 2023-10-27T12:31:38 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 4943 ms 724332 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);
            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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 15 ms 9396 KB Output is correct
6 Correct 17 ms 9308 KB Output is correct
7 Correct 13 ms 7004 KB Output is correct
8 Correct 19 ms 10076 KB Output is correct
9 Correct 19 ms 10072 KB Output is correct
10 Correct 19 ms 10076 KB Output is correct
11 Correct 19 ms 10116 KB Output is correct
12 Correct 20 ms 10072 KB Output is correct
13 Correct 15 ms 10344 KB Output is correct
14 Correct 16 ms 10336 KB Output is correct
15 Correct 17 ms 10180 KB Output is correct
16 Correct 18 ms 10088 KB Output is correct
17 Correct 18 ms 10088 KB Output is correct
18 Correct 24 ms 10240 KB Output is correct
19 Correct 20 ms 10088 KB Output is correct
20 Correct 21 ms 10224 KB Output is correct
21 Correct 15 ms 10152 KB Output is correct
22 Correct 16 ms 10084 KB Output is correct
23 Correct 18 ms 10064 KB Output is correct
24 Correct 18 ms 10080 KB Output is correct
25 Correct 18 ms 10072 KB Output is correct
26 Correct 15 ms 10076 KB Output is correct
27 Correct 15 ms 10108 KB Output is correct
28 Correct 17 ms 10076 KB Output is correct
29 Correct 14 ms 10208 KB Output is correct
30 Correct 21 ms 10208 KB Output is correct
31 Correct 19 ms 9996 KB Output is correct
32 Correct 22 ms 10076 KB Output is correct
33 Correct 14 ms 10332 KB Output is correct
34 Correct 14 ms 10320 KB Output is correct
35 Correct 15 ms 10332 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 19 ms 10076 KB Output is correct
3 Correct 18 ms 10080 KB Output is correct
4 Correct 19 ms 10268 KB Output is correct
5 Correct 2490 ms 634304 KB Output is correct
6 Correct 2914 ms 557848 KB Output is correct
7 Correct 2760 ms 463376 KB Output is correct
8 Correct 2107 ms 443000 KB Output is correct
9 Correct 2058 ms 478092 KB Output is correct
10 Correct 4251 ms 706400 KB Output is correct
11 Correct 3725 ms 706204 KB Output is correct
12 Correct 3997 ms 706268 KB Output is correct
13 Correct 4022 ms 706056 KB Output is correct
14 Correct 4009 ms 706408 KB Output is correct
15 Correct 2436 ms 717828 KB Output is correct
16 Correct 2321 ms 718372 KB Output is correct
17 Correct 2522 ms 717184 KB Output is correct
18 Correct 4351 ms 706448 KB Output is correct
19 Correct 4300 ms 701240 KB Output is correct
20 Correct 3918 ms 703788 KB Output is correct
21 Correct 1557 ms 706060 KB Output is correct
22 Correct 1549 ms 706736 KB Output is correct
23 Correct 1586 ms 704404 KB Output is correct
24 Correct 1521 ms 706344 KB Output is correct
25 Correct 2600 ms 712800 KB Output is correct
26 Correct 2835 ms 693928 KB Output is correct
27 Correct 2503 ms 693952 KB Output is correct
28 Correct 1783 ms 705332 KB Output is correct
29 Correct 1516 ms 705520 KB Output is correct
30 Correct 2450 ms 705536 KB Output is correct
31 Correct 2303 ms 705832 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 15 ms 10328 KB Output is correct
3 Correct 15 ms 10332 KB Output is correct
4 Correct 15 ms 10320 KB Output is correct
5 Correct 1395 ms 474892 KB Output is correct
6 Correct 1225 ms 382596 KB Output is correct
7 Correct 1947 ms 622088 KB Output is correct
8 Correct 2614 ms 718632 KB Output is correct
9 Correct 2569 ms 718324 KB Output is correct
10 Correct 2553 ms 718460 KB Output is correct
11 Correct 2108 ms 724320 KB Output is correct
12 Correct 2051 ms 724332 KB Output is correct
13 Correct 2064 ms 705452 KB Output is correct
14 Correct 1602 ms 717424 KB Output is correct
15 Correct 1493 ms 717124 KB Output is correct
16 Correct 1745 ms 717780 KB Output is correct
17 Correct 1677 ms 717516 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 15 ms 9396 KB Output is correct
6 Correct 17 ms 9308 KB Output is correct
7 Correct 13 ms 7004 KB Output is correct
8 Correct 19 ms 10076 KB Output is correct
9 Correct 19 ms 10072 KB Output is correct
10 Correct 19 ms 10076 KB Output is correct
11 Correct 19 ms 10116 KB Output is correct
12 Correct 20 ms 10072 KB Output is correct
13 Correct 15 ms 10344 KB Output is correct
14 Correct 16 ms 10336 KB Output is correct
15 Correct 17 ms 10180 KB Output is correct
16 Correct 18 ms 10088 KB Output is correct
17 Correct 18 ms 10088 KB Output is correct
18 Correct 24 ms 10240 KB Output is correct
19 Correct 20 ms 10088 KB Output is correct
20 Correct 21 ms 10224 KB Output is correct
21 Correct 15 ms 10152 KB Output is correct
22 Correct 16 ms 10084 KB Output is correct
23 Correct 18 ms 10064 KB Output is correct
24 Correct 18 ms 10080 KB Output is correct
25 Correct 18 ms 10072 KB Output is correct
26 Correct 15 ms 10076 KB Output is correct
27 Correct 15 ms 10108 KB Output is correct
28 Correct 17 ms 10076 KB Output is correct
29 Correct 14 ms 10208 KB Output is correct
30 Correct 21 ms 10208 KB Output is correct
31 Correct 19 ms 9996 KB Output is correct
32 Correct 22 ms 10076 KB Output is correct
33 Correct 14 ms 10332 KB Output is correct
34 Correct 14 ms 10320 KB Output is correct
35 Correct 15 ms 10332 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 19 ms 10076 KB Output is correct
38 Correct 18 ms 10080 KB Output is correct
39 Correct 19 ms 10268 KB Output is correct
40 Correct 2490 ms 634304 KB Output is correct
41 Correct 2914 ms 557848 KB Output is correct
42 Correct 2760 ms 463376 KB Output is correct
43 Correct 2107 ms 443000 KB Output is correct
44 Correct 2058 ms 478092 KB Output is correct
45 Correct 4251 ms 706400 KB Output is correct
46 Correct 3725 ms 706204 KB Output is correct
47 Correct 3997 ms 706268 KB Output is correct
48 Correct 4022 ms 706056 KB Output is correct
49 Correct 4009 ms 706408 KB Output is correct
50 Correct 2436 ms 717828 KB Output is correct
51 Correct 2321 ms 718372 KB Output is correct
52 Correct 2522 ms 717184 KB Output is correct
53 Correct 4351 ms 706448 KB Output is correct
54 Correct 4300 ms 701240 KB Output is correct
55 Correct 3918 ms 703788 KB Output is correct
56 Correct 1557 ms 706060 KB Output is correct
57 Correct 1549 ms 706736 KB Output is correct
58 Correct 1586 ms 704404 KB Output is correct
59 Correct 1521 ms 706344 KB Output is correct
60 Correct 2600 ms 712800 KB Output is correct
61 Correct 2835 ms 693928 KB Output is correct
62 Correct 2503 ms 693952 KB Output is correct
63 Correct 1783 ms 705332 KB Output is correct
64 Correct 1516 ms 705520 KB Output is correct
65 Correct 2450 ms 705536 KB Output is correct
66 Correct 2303 ms 705832 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 15 ms 10328 KB Output is correct
69 Correct 15 ms 10332 KB Output is correct
70 Correct 15 ms 10320 KB Output is correct
71 Correct 1395 ms 474892 KB Output is correct
72 Correct 1225 ms 382596 KB Output is correct
73 Correct 1947 ms 622088 KB Output is correct
74 Correct 2614 ms 718632 KB Output is correct
75 Correct 2569 ms 718324 KB Output is correct
76 Correct 2553 ms 718460 KB Output is correct
77 Correct 2108 ms 724320 KB Output is correct
78 Correct 2051 ms 724332 KB Output is correct
79 Correct 2064 ms 705452 KB Output is correct
80 Correct 1602 ms 717424 KB Output is correct
81 Correct 1493 ms 717124 KB Output is correct
82 Correct 1745 ms 717780 KB Output is correct
83 Correct 1677 ms 717516 KB Output is correct
84 Correct 2952 ms 645436 KB Output is correct
85 Correct 3009 ms 561936 KB Output is correct
86 Correct 2489 ms 393784 KB Output is correct
87 Correct 4419 ms 706356 KB Output is correct
88 Correct 4203 ms 706136 KB Output is correct
89 Correct 4454 ms 705928 KB Output is correct
90 Correct 4713 ms 705964 KB Output is correct
91 Correct 4526 ms 706144 KB Output is correct
92 Correct 2934 ms 714428 KB Output is correct
93 Correct 2740 ms 716608 KB Output is correct
94 Correct 4461 ms 705844 KB Output is correct
95 Correct 4717 ms 706748 KB Output is correct
96 Correct 4891 ms 706648 KB Output is correct
97 Correct 4943 ms 706252 KB Output is correct
98 Correct 2950 ms 706440 KB Output is correct
99 Correct 2777 ms 706212 KB Output is correct
100 Correct 2917 ms 706572 KB Output is correct
101 Correct 3001 ms 706184 KB Output is correct
102 Correct 3203 ms 712536 KB Output is correct
103 Correct 3856 ms 691308 KB Output is correct
104 Correct 3307 ms 693800 KB Output is correct
105 Correct 2202 ms 705600 KB Output is correct
106 Correct 2417 ms 705464 KB Output is correct
107 Correct 2808 ms 705292 KB Output is correct
108 Correct 2537 ms 705428 KB Output is correct