oj.uz

답안 #866940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866940 2023-10-27T12:34:18 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 4411 ms 724248 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 _ = 0; _ < 10; _++) {
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 14 ms 9356 KB Output is correct
6 Correct 17 ms 9432 KB Output is correct
7 Correct 19 ms 6996 KB Output is correct
8 Correct 19 ms 10184 KB Output is correct
9 Correct 25 ms 10064 KB Output is correct
10 Correct 25 ms 10200 KB Output is correct
11 Correct 18 ms 10180 KB Output is correct
12 Correct 25 ms 10084 KB Output is correct
13 Correct 22 ms 10348 KB Output is correct
14 Correct 22 ms 10332 KB Output is correct
15 Correct 16 ms 10340 KB Output is correct
16 Correct 16 ms 10336 KB Output is correct
17 Correct 23 ms 10080 KB Output is correct
18 Correct 23 ms 10336 KB Output is correct
19 Correct 15 ms 10220 KB Output is correct
20 Correct 20 ms 10080 KB Output is correct
21 Correct 21 ms 10140 KB Output is correct
22 Correct 21 ms 10248 KB Output is correct
23 Correct 18 ms 10180 KB Output is correct
24 Correct 18 ms 10176 KB Output is correct
25 Correct 18 ms 10076 KB Output is correct
26 Correct 16 ms 10076 KB Output is correct
27 Correct 15 ms 10072 KB Output is correct
28 Correct 17 ms 10072 KB Output is correct
29 Correct 13 ms 10072 KB Output is correct
30 Correct 24 ms 10188 KB Output is correct
31 Correct 24 ms 10180 KB Output is correct
32 Correct 19 ms 10192 KB Output is correct
33 Correct 20 ms 10332 KB Output is correct
34 Correct 21 ms 10388 KB Output is correct
35 Correct 14 ms 10328 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 27 ms 10068 KB Output is correct
3 Correct 27 ms 10136 KB Output is correct
4 Correct 25 ms 10060 KB Output is correct
5 Correct 2344 ms 633864 KB Output is correct
6 Correct 3259 ms 556888 KB Output is correct
7 Correct 2814 ms 462072 KB Output is correct
8 Correct 2169 ms 442540 KB Output is correct
9 Correct 2021 ms 477304 KB Output is correct
10 Correct 3713 ms 705048 KB Output is correct
11 Correct 3816 ms 702500 KB Output is correct
12 Correct 4375 ms 706276 KB Output is correct
13 Correct 3849 ms 705944 KB Output is correct
14 Correct 3880 ms 706216 KB Output is correct
15 Correct 2353 ms 717704 KB Output is correct
16 Correct 2069 ms 718440 KB Output is correct
17 Correct 2377 ms 717148 KB Output is correct
18 Correct 3472 ms 706656 KB Output is correct
19 Correct 3151 ms 706908 KB Output is correct
20 Correct 3457 ms 706948 KB Output is correct
21 Correct 1506 ms 706352 KB Output is correct
22 Correct 1495 ms 707036 KB Output is correct
23 Correct 1629 ms 704424 KB Output is correct
24 Correct 1580 ms 706492 KB Output is correct
25 Correct 2526 ms 712600 KB Output is correct
26 Correct 2629 ms 693972 KB Output is correct
27 Correct 2503 ms 693988 KB Output is correct
28 Correct 1709 ms 705800 KB Output is correct
29 Correct 1509 ms 705284 KB Output is correct
30 Correct 2265 ms 705736 KB Output is correct
31 Correct 2152 ms 705816 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 15 ms 10456 KB Output is correct
3 Correct 14 ms 10332 KB Output is correct
4 Correct 14 ms 10332 KB Output is correct
5 Correct 1286 ms 474852 KB Output is correct
6 Correct 1141 ms 382576 KB Output is correct
7 Correct 1769 ms 622044 KB Output is correct
8 Correct 2177 ms 718468 KB Output is correct
9 Correct 2373 ms 718660 KB Output is correct
10 Correct 2322 ms 718700 KB Output is correct
11 Correct 1909 ms 724196 KB Output is correct
12 Correct 1927 ms 724248 KB Output is correct
13 Correct 1886 ms 705376 KB Output is correct
14 Correct 1492 ms 717276 KB Output is correct
15 Correct 1347 ms 717188 KB Output is correct
16 Correct 1616 ms 717984 KB Output is correct
17 Correct 1522 ms 717776 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 14 ms 9356 KB Output is correct
6 Correct 17 ms 9432 KB Output is correct
7 Correct 19 ms 6996 KB Output is correct
8 Correct 19 ms 10184 KB Output is correct
9 Correct 25 ms 10064 KB Output is correct
10 Correct 25 ms 10200 KB Output is correct
11 Correct 18 ms 10180 KB Output is correct
12 Correct 25 ms 10084 KB Output is correct
13 Correct 22 ms 10348 KB Output is correct
14 Correct 22 ms 10332 KB Output is correct
15 Correct 16 ms 10340 KB Output is correct
16 Correct 16 ms 10336 KB Output is correct
17 Correct 23 ms 10080 KB Output is correct
18 Correct 23 ms 10336 KB Output is correct
19 Correct 15 ms 10220 KB Output is correct
20 Correct 20 ms 10080 KB Output is correct
21 Correct 21 ms 10140 KB Output is correct
22 Correct 21 ms 10248 KB Output is correct
23 Correct 18 ms 10180 KB Output is correct
24 Correct 18 ms 10176 KB Output is correct
25 Correct 18 ms 10076 KB Output is correct
26 Correct 16 ms 10076 KB Output is correct
27 Correct 15 ms 10072 KB Output is correct
28 Correct 17 ms 10072 KB Output is correct
29 Correct 13 ms 10072 KB Output is correct
30 Correct 24 ms 10188 KB Output is correct
31 Correct 24 ms 10180 KB Output is correct
32 Correct 19 ms 10192 KB Output is correct
33 Correct 20 ms 10332 KB Output is correct
34 Correct 21 ms 10388 KB Output is correct
35 Correct 14 ms 10328 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 27 ms 10068 KB Output is correct
38 Correct 27 ms 10136 KB Output is correct
39 Correct 25 ms 10060 KB Output is correct
40 Correct 2344 ms 633864 KB Output is correct
41 Correct 3259 ms 556888 KB Output is correct
42 Correct 2814 ms 462072 KB Output is correct
43 Correct 2169 ms 442540 KB Output is correct
44 Correct 2021 ms 477304 KB Output is correct
45 Correct 3713 ms 705048 KB Output is correct
46 Correct 3816 ms 702500 KB Output is correct
47 Correct 4375 ms 706276 KB Output is correct
48 Correct 3849 ms 705944 KB Output is correct
49 Correct 3880 ms 706216 KB Output is correct
50 Correct 2353 ms 717704 KB Output is correct
51 Correct 2069 ms 718440 KB Output is correct
52 Correct 2377 ms 717148 KB Output is correct
53 Correct 3472 ms 706656 KB Output is correct
54 Correct 3151 ms 706908 KB Output is correct
55 Correct 3457 ms 706948 KB Output is correct
56 Correct 1506 ms 706352 KB Output is correct
57 Correct 1495 ms 707036 KB Output is correct
58 Correct 1629 ms 704424 KB Output is correct
59 Correct 1580 ms 706492 KB Output is correct
60 Correct 2526 ms 712600 KB Output is correct
61 Correct 2629 ms 693972 KB Output is correct
62 Correct 2503 ms 693988 KB Output is correct
63 Correct 1709 ms 705800 KB Output is correct
64 Correct 1509 ms 705284 KB Output is correct
65 Correct 2265 ms 705736 KB Output is correct
66 Correct 2152 ms 705816 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 15 ms 10456 KB Output is correct
69 Correct 14 ms 10332 KB Output is correct
70 Correct 14 ms 10332 KB Output is correct
71 Correct 1286 ms 474852 KB Output is correct
72 Correct 1141 ms 382576 KB Output is correct
73 Correct 1769 ms 622044 KB Output is correct
74 Correct 2177 ms 718468 KB Output is correct
75 Correct 2373 ms 718660 KB Output is correct
76 Correct 2322 ms 718700 KB Output is correct
77 Correct 1909 ms 724196 KB Output is correct
78 Correct 1927 ms 724248 KB Output is correct
79 Correct 1886 ms 705376 KB Output is correct
80 Correct 1492 ms 717276 KB Output is correct
81 Correct 1347 ms 717188 KB Output is correct
82 Correct 1616 ms 717984 KB Output is correct
83 Correct 1522 ms 717776 KB Output is correct
84 Correct 2781 ms 645676 KB Output is correct
85 Correct 2976 ms 562048 KB Output is correct
86 Correct 2421 ms 393876 KB Output is correct
87 Correct 3920 ms 706144 KB Output is correct
88 Correct 3983 ms 706216 KB Output is correct
89 Correct 3734 ms 704248 KB Output is correct
90 Correct 4260 ms 705952 KB Output is correct
91 Correct 4411 ms 706068 KB Output is correct
92 Correct 2580 ms 714392 KB Output is correct
93 Correct 2518 ms 716532 KB Output is correct
94 Correct 3721 ms 705968 KB Output is correct
95 Correct 3793 ms 706708 KB Output is correct
96 Correct 3846 ms 706932 KB Output is correct
97 Correct 3825 ms 707048 KB Output is correct
98 Correct 2319 ms 706608 KB Output is correct
99 Correct 2383 ms 706164 KB Output is correct
100 Correct 2377 ms 706536 KB Output is correct
101 Correct 2388 ms 706740 KB Output is correct
102 Correct 2839 ms 712808 KB Output is correct
103 Correct 2886 ms 691160 KB Output is correct
104 Correct 2811 ms 688540 KB Output is correct
105 Correct 1845 ms 700212 KB Output is correct
106 Correct 2176 ms 700392 KB Output is correct
107 Correct 2374 ms 700380 KB Output is correct
108 Correct 2414 ms 700240 KB Output is correct