oj.uz

Submission #866933

# Submission time Handle Problem Language Result Execution time Memory
866933 2023-10-27T12:19:41 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 2759 ms 159836 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 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);
    }
    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(), in[t[p]], 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, F, 0>(N);
    for (int i = M; i >= 0; i--) {
        if (i < M) {
            auto [c, p] = ch[i];
            q.upd(q.cpy(), in[t[p]], 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 0 ms 344 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 7 ms 2396 KB Output is correct
6 Correct 10 ms 2332 KB Output is correct
7 Correct 8 ms 1884 KB Output is correct
8 Correct 11 ms 2928 KB Output is correct
9 Correct 11 ms 2652 KB Output is correct
10 Correct 12 ms 2508 KB Output is correct
11 Correct 11 ms 2652 KB Output is correct
12 Correct 11 ms 2672 KB Output is correct
13 Correct 7 ms 2652 KB Output is correct
14 Correct 7 ms 2812 KB Output is correct
15 Correct 9 ms 2652 KB Output is correct
16 Correct 9 ms 2640 KB Output is correct
17 Correct 9 ms 2716 KB Output is correct
18 Correct 9 ms 2648 KB Output is correct
19 Correct 7 ms 2652 KB Output is correct
20 Correct 8 ms 2652 KB Output is correct
21 Correct 7 ms 2652 KB Output is correct
22 Correct 7 ms 2652 KB Output is correct
23 Correct 10 ms 2680 KB Output is correct
24 Correct 10 ms 2652 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 10 ms 2652 KB Output is correct
27 Correct 7 ms 2652 KB Output is correct
28 Correct 9 ms 2652 KB Output is correct
29 Correct 6 ms 2432 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 11 ms 2652 KB Output is correct
32 Correct 12 ms 2544 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 2652 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 2668 KB Output is correct
3 Correct 13 ms 2652 KB Output is correct
4 Correct 11 ms 2652 KB Output is correct
5 Correct 1571 ms 132776 KB Output is correct
6 Correct 1943 ms 114780 KB Output is correct
7 Correct 1765 ms 100620 KB Output is correct
8 Correct 1361 ms 96632 KB Output is correct
9 Correct 1262 ms 102484 KB Output is correct
10 Correct 2500 ms 147108 KB Output is correct
11 Correct 2552 ms 146992 KB Output is correct
12 Correct 2627 ms 147148 KB Output is correct
13 Correct 2463 ms 147236 KB Output is correct
14 Correct 2467 ms 147144 KB Output is correct
15 Correct 1274 ms 157880 KB Output is correct
16 Correct 1254 ms 158604 KB Output is correct
17 Correct 1348 ms 157492 KB Output is correct
18 Correct 2378 ms 147424 KB Output is correct
19 Correct 2401 ms 147560 KB Output is correct
20 Correct 2407 ms 147368 KB Output is correct
21 Correct 851 ms 147772 KB Output is correct
22 Correct 839 ms 147908 KB Output is correct
23 Correct 853 ms 147780 KB Output is correct
24 Correct 904 ms 147880 KB Output is correct
25 Correct 1581 ms 148528 KB Output is correct
26 Correct 1718 ms 145548 KB Output is correct
27 Correct 1628 ms 145388 KB Output is correct
28 Correct 1095 ms 146468 KB Output is correct
29 Correct 916 ms 146472 KB Output is correct
30 Correct 1536 ms 146468 KB Output is correct
31 Correct 1411 ms 146480 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 2892 KB Output is correct
3 Correct 8 ms 2728 KB Output is correct
4 Correct 7 ms 2908 KB Output is correct
5 Correct 701 ms 112648 KB Output is correct
6 Correct 715 ms 95492 KB Output is correct
7 Correct 1014 ms 129520 KB Output is correct
8 Correct 1408 ms 159016 KB Output is correct
9 Correct 1435 ms 159024 KB Output is correct
10 Correct 1384 ms 158852 KB Output is correct
11 Correct 1061 ms 159836 KB Output is correct
12 Correct 1081 ms 159796 KB Output is correct
13 Correct 1096 ms 156624 KB Output is correct
14 Correct 658 ms 157788 KB Output is correct
15 Correct 577 ms 157480 KB Output is correct
16 Correct 771 ms 158200 KB Output is correct
17 Correct 754 ms 158080 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 7 ms 2396 KB Output is correct
6 Correct 10 ms 2332 KB Output is correct
7 Correct 8 ms 1884 KB Output is correct
8 Correct 11 ms 2928 KB Output is correct
9 Correct 11 ms 2652 KB Output is correct
10 Correct 12 ms 2508 KB Output is correct
11 Correct 11 ms 2652 KB Output is correct
12 Correct 11 ms 2672 KB Output is correct
13 Correct 7 ms 2652 KB Output is correct
14 Correct 7 ms 2812 KB Output is correct
15 Correct 9 ms 2652 KB Output is correct
16 Correct 9 ms 2640 KB Output is correct
17 Correct 9 ms 2716 KB Output is correct
18 Correct 9 ms 2648 KB Output is correct
19 Correct 7 ms 2652 KB Output is correct
20 Correct 8 ms 2652 KB Output is correct
21 Correct 7 ms 2652 KB Output is correct
22 Correct 7 ms 2652 KB Output is correct
23 Correct 10 ms 2680 KB Output is correct
24 Correct 10 ms 2652 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 10 ms 2652 KB Output is correct
27 Correct 7 ms 2652 KB Output is correct
28 Correct 9 ms 2652 KB Output is correct
29 Correct 6 ms 2432 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 11 ms 2652 KB Output is correct
32 Correct 12 ms 2544 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 2652 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 11 ms 2668 KB Output is correct
38 Correct 13 ms 2652 KB Output is correct
39 Correct 11 ms 2652 KB Output is correct
40 Correct 1571 ms 132776 KB Output is correct
41 Correct 1943 ms 114780 KB Output is correct
42 Correct 1765 ms 100620 KB Output is correct
43 Correct 1361 ms 96632 KB Output is correct
44 Correct 1262 ms 102484 KB Output is correct
45 Correct 2500 ms 147108 KB Output is correct
46 Correct 2552 ms 146992 KB Output is correct
47 Correct 2627 ms 147148 KB Output is correct
48 Correct 2463 ms 147236 KB Output is correct
49 Correct 2467 ms 147144 KB Output is correct
50 Correct 1274 ms 157880 KB Output is correct
51 Correct 1254 ms 158604 KB Output is correct
52 Correct 1348 ms 157492 KB Output is correct
53 Correct 2378 ms 147424 KB Output is correct
54 Correct 2401 ms 147560 KB Output is correct
55 Correct 2407 ms 147368 KB Output is correct
56 Correct 851 ms 147772 KB Output is correct
57 Correct 839 ms 147908 KB Output is correct
58 Correct 853 ms 147780 KB Output is correct
59 Correct 904 ms 147880 KB Output is correct
60 Correct 1581 ms 148528 KB Output is correct
61 Correct 1718 ms 145548 KB Output is correct
62 Correct 1628 ms 145388 KB Output is correct
63 Correct 1095 ms 146468 KB Output is correct
64 Correct 916 ms 146472 KB Output is correct
65 Correct 1536 ms 146468 KB Output is correct
66 Correct 1411 ms 146480 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 9 ms 2892 KB Output is correct
69 Correct 8 ms 2728 KB Output is correct
70 Correct 7 ms 2908 KB Output is correct
71 Correct 701 ms 112648 KB Output is correct
72 Correct 715 ms 95492 KB Output is correct
73 Correct 1014 ms 129520 KB Output is correct
74 Correct 1408 ms 159016 KB Output is correct
75 Correct 1435 ms 159024 KB Output is correct
76 Correct 1384 ms 158852 KB Output is correct
77 Correct 1061 ms 159836 KB Output is correct
78 Correct 1081 ms 159796 KB Output is correct
79 Correct 1096 ms 156624 KB Output is correct
80 Correct 658 ms 157788 KB Output is correct
81 Correct 577 ms 157480 KB Output is correct
82 Correct 771 ms 158200 KB Output is correct
83 Correct 754 ms 158080 KB Output is correct
84 Correct 1618 ms 132380 KB Output is correct
85 Correct 1654 ms 113124 KB Output is correct
86 Correct 1415 ms 82660 KB Output is correct
87 Correct 2650 ms 146996 KB Output is correct
88 Correct 2675 ms 147068 KB Output is correct
89 Correct 2759 ms 146964 KB Output is correct
90 Correct 2759 ms 147248 KB Output is correct
91 Correct 2664 ms 146988 KB Output is correct
92 Correct 1559 ms 154784 KB Output is correct
93 Correct 1524 ms 157060 KB Output is correct
94 Correct 2533 ms 147376 KB Output is correct
95 Correct 2568 ms 147440 KB Output is correct
96 Correct 2673 ms 147504 KB Output is correct
97 Correct 2658 ms 147500 KB Output is correct
98 Correct 1394 ms 147876 KB Output is correct
99 Correct 1428 ms 147772 KB Output is correct
100 Correct 1453 ms 147856 KB Output is correct
101 Correct 1401 ms 147876 KB Output is correct
102 Correct 1856 ms 148316 KB Output is correct
103 Correct 1960 ms 145396 KB Output is correct
104 Correct 1866 ms 145552 KB Output is correct
105 Correct 1102 ms 146476 KB Output is correct
106 Correct 1369 ms 146500 KB Output is correct
107 Correct 1428 ms 146344 KB Output is correct
108 Correct 1407 ms 146468 KB Output is correct