oj.uz

Submission #866935

# Submission time Handle Problem Language Result Execution time Memory
866935 2023-10-27T12:28:37 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 3613 ms 165856 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);
    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.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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 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 2372 KB Output is correct
6 Correct 10 ms 2396 KB Output is correct
7 Correct 9 ms 2000 KB Output is correct
8 Correct 11 ms 2652 KB Output is correct
9 Correct 11 ms 2652 KB Output is correct
10 Correct 11 ms 2652 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 8 ms 2960 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 9 ms 2904 KB Output is correct
16 Correct 9 ms 2824 KB Output is correct
17 Correct 9 ms 2768 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 8 ms 2648 KB Output is correct
20 Correct 9 ms 2712 KB Output is correct
21 Correct 8 ms 2760 KB Output is correct
22 Correct 11 ms 2652 KB Output is correct
23 Correct 11 ms 2652 KB Output is correct
24 Correct 11 ms 2772 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 8 ms 2652 KB Output is correct
27 Correct 8 ms 2648 KB Output is correct
28 Correct 10 ms 2652 KB Output is correct
29 Correct 6 ms 2696 KB Output is correct
30 Correct 12 ms 2652 KB Output is correct
31 Correct 11 ms 2652 KB Output is correct
32 Correct 11 ms 2652 KB Output is correct
33 Correct 7 ms 2908 KB Output is correct
34 Correct 8 ms 2784 KB Output is correct
35 Correct 8 ms 2904 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 11 ms 2672 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 12 ms 2744 KB Output is correct
5 Correct 1710 ms 137612 KB Output is correct
6 Correct 2082 ms 119732 KB Output is correct
7 Correct 1918 ms 105332 KB Output is correct
8 Correct 1520 ms 100656 KB Output is correct
9 Correct 1373 ms 106776 KB Output is correct
10 Correct 2684 ms 152472 KB Output is correct
11 Correct 2695 ms 152212 KB Output is correct
12 Correct 2654 ms 152508 KB Output is correct
13 Correct 2672 ms 152160 KB Output is correct
14 Correct 2657 ms 152156 KB Output is correct
15 Correct 1420 ms 163924 KB Output is correct
16 Correct 1410 ms 164656 KB Output is correct
17 Correct 1536 ms 163340 KB Output is correct
18 Correct 2617 ms 152840 KB Output is correct
19 Correct 2575 ms 152904 KB Output is correct
20 Correct 2607 ms 153012 KB Output is correct
21 Correct 947 ms 152364 KB Output is correct
22 Correct 945 ms 152504 KB Output is correct
23 Correct 994 ms 152496 KB Output is correct
24 Correct 1020 ms 152500 KB Output is correct
25 Correct 1971 ms 153976 KB Output is correct
26 Correct 2073 ms 151020 KB Output is correct
27 Correct 2001 ms 150952 KB Output is correct
28 Correct 1150 ms 151600 KB Output is correct
29 Correct 955 ms 151452 KB Output is correct
30 Correct 1607 ms 151696 KB Output is correct
31 Correct 1567 ms 151984 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 9 ms 2976 KB Output is correct
3 Correct 9 ms 2908 KB Output is correct
4 Correct 9 ms 2988 KB Output is correct
5 Correct 821 ms 116828 KB Output is correct
6 Correct 734 ms 99672 KB Output is correct
7 Correct 1194 ms 134504 KB Output is correct
8 Correct 1614 ms 164692 KB Output is correct
9 Correct 1655 ms 164704 KB Output is correct
10 Correct 1747 ms 164756 KB Output is correct
11 Correct 1309 ms 165856 KB Output is correct
12 Correct 1307 ms 165588 KB Output is correct
13 Correct 1220 ms 162456 KB Output is correct
14 Correct 890 ms 163400 KB Output is correct
15 Correct 740 ms 163216 KB Output is correct
16 Correct 918 ms 163984 KB Output is correct
17 Correct 912 ms 163440 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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2372 KB Output is correct
6 Correct 10 ms 2396 KB Output is correct
7 Correct 9 ms 2000 KB Output is correct
8 Correct 11 ms 2652 KB Output is correct
9 Correct 11 ms 2652 KB Output is correct
10 Correct 11 ms 2652 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 11 ms 2652 KB Output is correct
13 Correct 8 ms 2960 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 9 ms 2904 KB Output is correct
16 Correct 9 ms 2824 KB Output is correct
17 Correct 9 ms 2768 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 8 ms 2648 KB Output is correct
20 Correct 9 ms 2712 KB Output is correct
21 Correct 8 ms 2760 KB Output is correct
22 Correct 11 ms 2652 KB Output is correct
23 Correct 11 ms 2652 KB Output is correct
24 Correct 11 ms 2772 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 8 ms 2652 KB Output is correct
27 Correct 8 ms 2648 KB Output is correct
28 Correct 10 ms 2652 KB Output is correct
29 Correct 6 ms 2696 KB Output is correct
30 Correct 12 ms 2652 KB Output is correct
31 Correct 11 ms 2652 KB Output is correct
32 Correct 11 ms 2652 KB Output is correct
33 Correct 7 ms 2908 KB Output is correct
34 Correct 8 ms 2784 KB Output is correct
35 Correct 8 ms 2904 KB Output is correct
36 Correct 0 ms 464 KB Output is correct
37 Correct 11 ms 2672 KB Output is correct
38 Correct 11 ms 2652 KB Output is correct
39 Correct 12 ms 2744 KB Output is correct
40 Correct 1710 ms 137612 KB Output is correct
41 Correct 2082 ms 119732 KB Output is correct
42 Correct 1918 ms 105332 KB Output is correct
43 Correct 1520 ms 100656 KB Output is correct
44 Correct 1373 ms 106776 KB Output is correct
45 Correct 2684 ms 152472 KB Output is correct
46 Correct 2695 ms 152212 KB Output is correct
47 Correct 2654 ms 152508 KB Output is correct
48 Correct 2672 ms 152160 KB Output is correct
49 Correct 2657 ms 152156 KB Output is correct
50 Correct 1420 ms 163924 KB Output is correct
51 Correct 1410 ms 164656 KB Output is correct
52 Correct 1536 ms 163340 KB Output is correct
53 Correct 2617 ms 152840 KB Output is correct
54 Correct 2575 ms 152904 KB Output is correct
55 Correct 2607 ms 153012 KB Output is correct
56 Correct 947 ms 152364 KB Output is correct
57 Correct 945 ms 152504 KB Output is correct
58 Correct 994 ms 152496 KB Output is correct
59 Correct 1020 ms 152500 KB Output is correct
60 Correct 1971 ms 153976 KB Output is correct
61 Correct 2073 ms 151020 KB Output is correct
62 Correct 2001 ms 150952 KB Output is correct
63 Correct 1150 ms 151600 KB Output is correct
64 Correct 955 ms 151452 KB Output is correct
65 Correct 1607 ms 151696 KB Output is correct
66 Correct 1567 ms 151984 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 9 ms 2976 KB Output is correct
69 Correct 9 ms 2908 KB Output is correct
70 Correct 9 ms 2988 KB Output is correct
71 Correct 821 ms 116828 KB Output is correct
72 Correct 734 ms 99672 KB Output is correct
73 Correct 1194 ms 134504 KB Output is correct
74 Correct 1614 ms 164692 KB Output is correct
75 Correct 1655 ms 164704 KB Output is correct
76 Correct 1747 ms 164756 KB Output is correct
77 Correct 1309 ms 165856 KB Output is correct
78 Correct 1307 ms 165588 KB Output is correct
79 Correct 1220 ms 162456 KB Output is correct
80 Correct 890 ms 163400 KB Output is correct
81 Correct 740 ms 163216 KB Output is correct
82 Correct 918 ms 163984 KB Output is correct
83 Correct 912 ms 163440 KB Output is correct
84 Correct 2106 ms 137060 KB Output is correct
85 Correct 2212 ms 117196 KB Output is correct
86 Correct 1942 ms 86468 KB Output is correct
87 Correct 3463 ms 152476 KB Output is correct
88 Correct 3475 ms 152276 KB Output is correct
89 Correct 3478 ms 152212 KB Output is correct
90 Correct 3555 ms 152080 KB Output is correct
91 Correct 3505 ms 151452 KB Output is correct
92 Correct 2045 ms 160576 KB Output is correct
93 Correct 2016 ms 157276 KB Output is correct
94 Correct 3555 ms 148488 KB Output is correct
95 Correct 3613 ms 149772 KB Output is correct
96 Correct 3400 ms 148808 KB Output is correct
97 Correct 3414 ms 152840 KB Output is correct
98 Correct 1704 ms 152620 KB Output is correct
99 Correct 1835 ms 152496 KB Output is correct
100 Correct 1794 ms 152656 KB Output is correct
101 Correct 1746 ms 152500 KB Output is correct
102 Correct 2330 ms 153980 KB Output is correct
103 Correct 2463 ms 150748 KB Output is correct
104 Correct 2236 ms 150664 KB Output is correct
105 Correct 1254 ms 151700 KB Output is correct
106 Correct 1624 ms 151588 KB Output is correct
107 Correct 1669 ms 151476 KB Output is correct
108 Correct 1697 ms 151448 KB Output is correct