oj.uz

답안 #866932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866932 2023-10-27T12:16:38 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 2895 ms 163000 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 2524 KB Output is correct
6 Correct 11 ms 2392 KB Output is correct
7 Correct 11 ms 1884 KB Output is correct
8 Correct 15 ms 2652 KB Output is correct
9 Correct 11 ms 2648 KB Output is correct
10 Correct 12 ms 2652 KB Output is correct
11 Correct 11 ms 2652 KB Output is correct
12 Correct 11 ms 2776 KB Output is correct
13 Correct 7 ms 2752 KB Output is correct
14 Correct 7 ms 2720 KB Output is correct
15 Correct 9 ms 2652 KB Output is correct
16 Correct 9 ms 2724 KB Output is correct
17 Correct 9 ms 2680 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 8 ms 2760 KB Output is correct
20 Correct 8 ms 2772 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 8 ms 2752 KB Output is correct
23 Correct 11 ms 2652 KB Output is correct
24 Correct 11 ms 2648 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 8 ms 2648 KB Output is correct
27 Correct 8 ms 2672 KB Output is correct
28 Correct 9 ms 2652 KB Output is correct
29 Correct 7 ms 2652 KB Output is correct
30 Correct 12 ms 2532 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 7 ms 2768 KB Output is correct
35 Correct 7 ms 2772 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 11 ms 2764 KB Output is correct
3 Correct 11 ms 2648 KB Output is correct
4 Correct 11 ms 2652 KB Output is correct
5 Correct 1517 ms 135708 KB Output is correct
6 Correct 2003 ms 117676 KB Output is correct
7 Correct 1817 ms 103436 KB Output is correct
8 Correct 1406 ms 98896 KB Output is correct
9 Correct 1309 ms 104700 KB Output is correct
10 Correct 2532 ms 149840 KB Output is correct
11 Correct 2487 ms 150084 KB Output is correct
12 Correct 2543 ms 149808 KB Output is correct
13 Correct 2498 ms 150052 KB Output is correct
14 Correct 2514 ms 149848 KB Output is correct
15 Correct 1297 ms 161104 KB Output is correct
16 Correct 1296 ms 162148 KB Output is correct
17 Correct 1322 ms 160852 KB Output is correct
18 Correct 2385 ms 150392 KB Output is correct
19 Correct 2398 ms 150500 KB Output is correct
20 Correct 2456 ms 150376 KB Output is correct
21 Correct 841 ms 150504 KB Output is correct
22 Correct 947 ms 150544 KB Output is correct
23 Correct 889 ms 150596 KB Output is correct
24 Correct 871 ms 150472 KB Output is correct
25 Correct 1618 ms 151244 KB Output is correct
26 Correct 1702 ms 148148 KB Output is correct
27 Correct 1786 ms 148256 KB Output is correct
28 Correct 1092 ms 149248 KB Output is correct
29 Correct 954 ms 149236 KB Output is correct
30 Correct 1499 ms 149544 KB Output is correct
31 Correct 1416 ms 149548 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 2836 KB Output is correct
3 Correct 7 ms 2904 KB Output is correct
4 Correct 9 ms 2908 KB Output is correct
5 Correct 752 ms 115084 KB Output is correct
6 Correct 715 ms 98104 KB Output is correct
7 Correct 1012 ms 132300 KB Output is correct
8 Correct 1413 ms 162136 KB Output is correct
9 Correct 1379 ms 162352 KB Output is correct
10 Correct 1459 ms 162148 KB Output is correct
11 Correct 1166 ms 163000 KB Output is correct
12 Correct 1151 ms 162920 KB Output is correct
13 Correct 1147 ms 159892 KB Output is correct
14 Correct 775 ms 161348 KB Output is correct
15 Correct 584 ms 160560 KB Output is correct
16 Correct 848 ms 161300 KB Output is correct
17 Correct 761 ms 161224 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 2524 KB Output is correct
6 Correct 11 ms 2392 KB Output is correct
7 Correct 11 ms 1884 KB Output is correct
8 Correct 15 ms 2652 KB Output is correct
9 Correct 11 ms 2648 KB Output is correct
10 Correct 12 ms 2652 KB Output is correct
11 Correct 11 ms 2652 KB Output is correct
12 Correct 11 ms 2776 KB Output is correct
13 Correct 7 ms 2752 KB Output is correct
14 Correct 7 ms 2720 KB Output is correct
15 Correct 9 ms 2652 KB Output is correct
16 Correct 9 ms 2724 KB Output is correct
17 Correct 9 ms 2680 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 8 ms 2760 KB Output is correct
20 Correct 8 ms 2772 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 8 ms 2752 KB Output is correct
23 Correct 11 ms 2652 KB Output is correct
24 Correct 11 ms 2648 KB Output is correct
25 Correct 11 ms 2652 KB Output is correct
26 Correct 8 ms 2648 KB Output is correct
27 Correct 8 ms 2672 KB Output is correct
28 Correct 9 ms 2652 KB Output is correct
29 Correct 7 ms 2652 KB Output is correct
30 Correct 12 ms 2532 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 7 ms 2768 KB Output is correct
35 Correct 7 ms 2772 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 11 ms 2764 KB Output is correct
38 Correct 11 ms 2648 KB Output is correct
39 Correct 11 ms 2652 KB Output is correct
40 Correct 1517 ms 135708 KB Output is correct
41 Correct 2003 ms 117676 KB Output is correct
42 Correct 1817 ms 103436 KB Output is correct
43 Correct 1406 ms 98896 KB Output is correct
44 Correct 1309 ms 104700 KB Output is correct
45 Correct 2532 ms 149840 KB Output is correct
46 Correct 2487 ms 150084 KB Output is correct
47 Correct 2543 ms 149808 KB Output is correct
48 Correct 2498 ms 150052 KB Output is correct
49 Correct 2514 ms 149848 KB Output is correct
50 Correct 1297 ms 161104 KB Output is correct
51 Correct 1296 ms 162148 KB Output is correct
52 Correct 1322 ms 160852 KB Output is correct
53 Correct 2385 ms 150392 KB Output is correct
54 Correct 2398 ms 150500 KB Output is correct
55 Correct 2456 ms 150376 KB Output is correct
56 Correct 841 ms 150504 KB Output is correct
57 Correct 947 ms 150544 KB Output is correct
58 Correct 889 ms 150596 KB Output is correct
59 Correct 871 ms 150472 KB Output is correct
60 Correct 1618 ms 151244 KB Output is correct
61 Correct 1702 ms 148148 KB Output is correct
62 Correct 1786 ms 148256 KB Output is correct
63 Correct 1092 ms 149248 KB Output is correct
64 Correct 954 ms 149236 KB Output is correct
65 Correct 1499 ms 149544 KB Output is correct
66 Correct 1416 ms 149548 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 7 ms 2836 KB Output is correct
69 Correct 7 ms 2904 KB Output is correct
70 Correct 9 ms 2908 KB Output is correct
71 Correct 752 ms 115084 KB Output is correct
72 Correct 715 ms 98104 KB Output is correct
73 Correct 1012 ms 132300 KB Output is correct
74 Correct 1413 ms 162136 KB Output is correct
75 Correct 1379 ms 162352 KB Output is correct
76 Correct 1459 ms 162148 KB Output is correct
77 Correct 1166 ms 163000 KB Output is correct
78 Correct 1151 ms 162920 KB Output is correct
79 Correct 1147 ms 159892 KB Output is correct
80 Correct 775 ms 161348 KB Output is correct
81 Correct 584 ms 160560 KB Output is correct
82 Correct 848 ms 161300 KB Output is correct
83 Correct 761 ms 161224 KB Output is correct
84 Correct 1707 ms 134764 KB Output is correct
85 Correct 1768 ms 115244 KB Output is correct
86 Correct 1535 ms 84964 KB Output is correct
87 Correct 2846 ms 150036 KB Output is correct
88 Correct 2869 ms 150060 KB Output is correct
89 Correct 2888 ms 149764 KB Output is correct
90 Correct 2895 ms 149848 KB Output is correct
91 Correct 2834 ms 149788 KB Output is correct
92 Correct 1707 ms 157836 KB Output is correct
93 Correct 1621 ms 160304 KB Output is correct
94 Correct 2705 ms 150284 KB Output is correct
95 Correct 2815 ms 150736 KB Output is correct
96 Correct 2639 ms 150284 KB Output is correct
97 Correct 2792 ms 150560 KB Output is correct
98 Correct 1506 ms 150416 KB Output is correct
99 Correct 1520 ms 150400 KB Output is correct
100 Correct 1493 ms 150508 KB Output is correct
101 Correct 1494 ms 150440 KB Output is correct
102 Correct 1929 ms 151444 KB Output is correct
103 Correct 2033 ms 148172 KB Output is correct
104 Correct 1959 ms 148412 KB Output is correct
105 Correct 1142 ms 149360 KB Output is correct
106 Correct 1373 ms 149656 KB Output is correct
107 Correct 1447 ms 149556 KB Output is correct
108 Correct 1589 ms 149352 KB Output is correct