oj.uz

Submission #866936

# Submission time Handle Problem Language Result Execution time Memory
866936 2023-10-27T12:29:19 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 4720 ms 724496 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 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 15 ms 9272 KB Output is correct
6 Correct 27 ms 9180 KB Output is correct
7 Correct 19 ms 6960 KB Output is correct
8 Correct 19 ms 10076 KB Output is correct
9 Correct 19 ms 10076 KB Output is correct
10 Correct 28 ms 10176 KB Output is correct
11 Correct 20 ms 10076 KB Output is correct
12 Correct 19 ms 10076 KB Output is correct
13 Correct 15 ms 10328 KB Output is correct
14 Correct 21 ms 10544 KB Output is correct
15 Correct 20 ms 10072 KB Output is correct
16 Correct 23 ms 10076 KB Output is correct
17 Correct 19 ms 10076 KB Output is correct
18 Correct 16 ms 10232 KB Output is correct
19 Correct 16 ms 10076 KB Output is correct
20 Correct 16 ms 10024 KB Output is correct
21 Correct 15 ms 10076 KB Output is correct
22 Correct 16 ms 10076 KB Output is correct
23 Correct 18 ms 10076 KB Output is correct
24 Correct 19 ms 10076 KB Output is correct
25 Correct 19 ms 10072 KB Output is correct
26 Correct 15 ms 10076 KB Output is correct
27 Correct 17 ms 10076 KB Output is correct
28 Correct 17 ms 10076 KB Output is correct
29 Correct 14 ms 9996 KB Output is correct
30 Correct 19 ms 10076 KB Output is correct
31 Correct 19 ms 10176 KB Output is correct
32 Correct 26 ms 10320 KB Output is correct
33 Correct 15 ms 10332 KB Output is correct
34 Correct 15 ms 10332 KB Output is correct
35 Correct 14 ms 10332 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 19 ms 10076 KB Output is correct
3 Correct 19 ms 10076 KB Output is correct
4 Correct 19 ms 10164 KB Output is correct
5 Correct 2621 ms 629720 KB Output is correct
6 Correct 2925 ms 553108 KB Output is correct
7 Correct 2648 ms 458580 KB Output is correct
8 Correct 2142 ms 439244 KB Output is correct
9 Correct 2183 ms 474112 KB Output is correct
10 Correct 3966 ms 700908 KB Output is correct
11 Correct 4140 ms 700900 KB Output is correct
12 Correct 4174 ms 700912 KB Output is correct
13 Correct 4091 ms 700780 KB Output is correct
14 Correct 4102 ms 703712 KB Output is correct
15 Correct 2393 ms 715220 KB Output is correct
16 Correct 2318 ms 715484 KB Output is correct
17 Correct 2528 ms 714384 KB Output is correct
18 Correct 4083 ms 704240 KB Output is correct
19 Correct 4273 ms 703736 KB Output is correct
20 Correct 4369 ms 706696 KB Output is correct
21 Correct 1649 ms 701880 KB Output is correct
22 Correct 1580 ms 706400 KB Output is correct
23 Correct 1680 ms 703900 KB Output is correct
24 Correct 1656 ms 703140 KB Output is correct
25 Correct 2904 ms 712976 KB Output is correct
26 Correct 2888 ms 690992 KB Output is correct
27 Correct 2532 ms 693876 KB Output is correct
28 Correct 1828 ms 705368 KB Output is correct
29 Correct 1553 ms 705308 KB Output is correct
30 Correct 2446 ms 705716 KB Output is correct
31 Correct 2342 ms 705576 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 14 ms 10332 KB Output is correct
3 Correct 15 ms 10332 KB Output is correct
4 Correct 15 ms 10340 KB Output is correct
5 Correct 1486 ms 474940 KB Output is correct
6 Correct 1261 ms 382464 KB Output is correct
7 Correct 1955 ms 621816 KB Output is correct
8 Correct 2486 ms 718460 KB Output is correct
9 Correct 2500 ms 718308 KB Output is correct
10 Correct 2472 ms 718584 KB Output is correct
11 Correct 2040 ms 724496 KB Output is correct
12 Correct 1934 ms 724220 KB Output is correct
13 Correct 2137 ms 705540 KB Output is correct
14 Correct 1481 ms 717400 KB Output is correct
15 Correct 1402 ms 717176 KB Output is correct
16 Correct 1594 ms 717912 KB Output is correct
17 Correct 1593 ms 717568 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 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 15 ms 9272 KB Output is correct
6 Correct 27 ms 9180 KB Output is correct
7 Correct 19 ms 6960 KB Output is correct
8 Correct 19 ms 10076 KB Output is correct
9 Correct 19 ms 10076 KB Output is correct
10 Correct 28 ms 10176 KB Output is correct
11 Correct 20 ms 10076 KB Output is correct
12 Correct 19 ms 10076 KB Output is correct
13 Correct 15 ms 10328 KB Output is correct
14 Correct 21 ms 10544 KB Output is correct
15 Correct 20 ms 10072 KB Output is correct
16 Correct 23 ms 10076 KB Output is correct
17 Correct 19 ms 10076 KB Output is correct
18 Correct 16 ms 10232 KB Output is correct
19 Correct 16 ms 10076 KB Output is correct
20 Correct 16 ms 10024 KB Output is correct
21 Correct 15 ms 10076 KB Output is correct
22 Correct 16 ms 10076 KB Output is correct
23 Correct 18 ms 10076 KB Output is correct
24 Correct 19 ms 10076 KB Output is correct
25 Correct 19 ms 10072 KB Output is correct
26 Correct 15 ms 10076 KB Output is correct
27 Correct 17 ms 10076 KB Output is correct
28 Correct 17 ms 10076 KB Output is correct
29 Correct 14 ms 9996 KB Output is correct
30 Correct 19 ms 10076 KB Output is correct
31 Correct 19 ms 10176 KB Output is correct
32 Correct 26 ms 10320 KB Output is correct
33 Correct 15 ms 10332 KB Output is correct
34 Correct 15 ms 10332 KB Output is correct
35 Correct 14 ms 10332 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 19 ms 10076 KB Output is correct
38 Correct 19 ms 10076 KB Output is correct
39 Correct 19 ms 10164 KB Output is correct
40 Correct 2621 ms 629720 KB Output is correct
41 Correct 2925 ms 553108 KB Output is correct
42 Correct 2648 ms 458580 KB Output is correct
43 Correct 2142 ms 439244 KB Output is correct
44 Correct 2183 ms 474112 KB Output is correct
45 Correct 3966 ms 700908 KB Output is correct
46 Correct 4140 ms 700900 KB Output is correct
47 Correct 4174 ms 700912 KB Output is correct
48 Correct 4091 ms 700780 KB Output is correct
49 Correct 4102 ms 703712 KB Output is correct
50 Correct 2393 ms 715220 KB Output is correct
51 Correct 2318 ms 715484 KB Output is correct
52 Correct 2528 ms 714384 KB Output is correct
53 Correct 4083 ms 704240 KB Output is correct
54 Correct 4273 ms 703736 KB Output is correct
55 Correct 4369 ms 706696 KB Output is correct
56 Correct 1649 ms 701880 KB Output is correct
57 Correct 1580 ms 706400 KB Output is correct
58 Correct 1680 ms 703900 KB Output is correct
59 Correct 1656 ms 703140 KB Output is correct
60 Correct 2904 ms 712976 KB Output is correct
61 Correct 2888 ms 690992 KB Output is correct
62 Correct 2532 ms 693876 KB Output is correct
63 Correct 1828 ms 705368 KB Output is correct
64 Correct 1553 ms 705308 KB Output is correct
65 Correct 2446 ms 705716 KB Output is correct
66 Correct 2342 ms 705576 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 14 ms 10332 KB Output is correct
69 Correct 15 ms 10332 KB Output is correct
70 Correct 15 ms 10340 KB Output is correct
71 Correct 1486 ms 474940 KB Output is correct
72 Correct 1261 ms 382464 KB Output is correct
73 Correct 1955 ms 621816 KB Output is correct
74 Correct 2486 ms 718460 KB Output is correct
75 Correct 2500 ms 718308 KB Output is correct
76 Correct 2472 ms 718584 KB Output is correct
77 Correct 2040 ms 724496 KB Output is correct
78 Correct 1934 ms 724220 KB Output is correct
79 Correct 2137 ms 705540 KB Output is correct
80 Correct 1481 ms 717400 KB Output is correct
81 Correct 1402 ms 717176 KB Output is correct
82 Correct 1594 ms 717912 KB Output is correct
83 Correct 1593 ms 717568 KB Output is correct
84 Correct 2684 ms 645564 KB Output is correct
85 Correct 2617 ms 561856 KB Output is correct
86 Correct 2253 ms 394196 KB Output is correct
87 Correct 4019 ms 706200 KB Output is correct
88 Correct 4098 ms 706104 KB Output is correct
89 Correct 4091 ms 705944 KB Output is correct
90 Correct 4584 ms 705908 KB Output is correct
91 Correct 4720 ms 705944 KB Output is correct
92 Correct 2896 ms 714552 KB Output is correct
93 Correct 2713 ms 716764 KB Output is correct
94 Correct 4013 ms 705848 KB Output is correct
95 Correct 4529 ms 706748 KB Output is correct
96 Correct 4305 ms 705496 KB Output is correct
97 Correct 4400 ms 701200 KB Output is correct
98 Correct 2747 ms 701572 KB Output is correct
99 Correct 2562 ms 701792 KB Output is correct
100 Correct 2568 ms 701720 KB Output is correct
101 Correct 2562 ms 701688 KB Output is correct
102 Correct 3060 ms 707192 KB Output is correct
103 Correct 3221 ms 688324 KB Output is correct
104 Correct 3536 ms 688568 KB Output is correct
105 Correct 2226 ms 703036 KB Output is correct
106 Correct 2471 ms 700356 KB Output is correct
107 Correct 2564 ms 700780 KB Output is correct
108 Correct 2497 ms 705436 KB Output is correct