oj.uz

답안 #868462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868462 2023-10-31T13:45:47 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 3030 ms 166692 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, const S &v) {
        if (l + 1 == r) {
            return new T(f(i->s, v));
        }
        int m = (l + r) / 2;
        if (p < m) {
            return new T(upd(i->l, l, m, p, v), i->r);
        } else {
            return new T(i->l, upd(i->r, m, r, p, 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, const S &v) {
        rts[k] = upd(rts[k], 0, n, i, 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;
}
struct HLD {
    bool e;
    int n, timer;
    vector<int> sz, dep, par, top, pos;
    vector<vector<int>> adj;
    HLD(int n, bool edge) : n(n), e(edge) {
        sz.resize(n);
        dep.resize(n);
        top.resize(n);
        pos.resize(n);
        adj.resize(n);
        par.resize(n);
    }
    void add_edge(int x, int y) {
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    void init(int x) {
        sz[x] = 1;
        for (int &y : adj[x]) {
            dep[y] = dep[x] + 1;
            adj[y].erase(find(adj[y].begin(), adj[y].end(), par[y] = x));
            init(y);
            sz[x] += sz[y];
            if (sz[y] > sz[adj[x][0]]) {
                swap(y, adj[x][0]);
            }
        }
    }
    void dfs(int x) {
        pos[x] = timer++;
        for (int y : adj[x]) {
            top[y] = y == adj[x][0] ? top[x] : y;
            dfs(y);
        }
    }
    void build() {
        par[0] = -1; init(0);
        timer = 0; dfs(0);
    }
    int lca(int x, int y) {
        for (; top[x] != top[y]; x = par[top[x]]) {
            if (dep[top[x]] < dep[top[y]]) {
                swap(x, y);
            }
        }
        return dep[x] < dep[y] ? x : y;
    }
    template <class T>
    void path(int x, int y, T f) {
        int z = lca(x, y);
        for (; top[x] != top[y]; x = par[top[x]]) {
            if (dep[top[x]] < dep[top[y]]) {
                swap(x, y);
            }
            f(pos[top[x]], pos[x] + 1);
        }
        if (dep[x] > dep[y]) {
            swap(x, y);
        }
        f(pos[x] + e, pos[y] + 1);
        assert(z == x);
    }
};
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);
    }
    HLD hld(N, 1);
    for (int i = 0; i < N; i++) {
        for (int &j : adj[i]) {
            auto [x, y] = edges[j];
            j = i ^ x ^ y;
            if (j < i) {
                hld.add_edge(i, j);
            }
        }
    }
    hld.build();
    PST<ll, F, 0> q(N);
    for (int i = 0; i < M; i++) {
        auto [c, p] = ch[i];
        q.upd(q.cpy(q.lst()), hld.pos[t[p]], c);
    }
    auto get = [&](int x, int y, int z) -> ll {
        ll s = 0;
        hld.path(x, y, [&](int l, int r) {
            s += q.qry(z, l, r);
        });
        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()), hld.pos[t[p]], 1);
        }
        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;
}

Compilation message

currencies.cpp: In constructor 'HLD::HLD(int, bool)':
currencies.cpp:84:9: warning: 'HLD::n' will be initialized after [-Wreorder]
   84 |     int n, timer;
      |         ^
currencies.cpp:83:10: warning:   'bool HLD::e' [-Wreorder]
   83 |     bool e;
      |          ^
currencies.cpp:87:5: warning:   when initialized here [-Wreorder]
   87 |     HLD(int n, bool edge) : n(n), e(edge) {
      |     ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 8 ms 2516 KB Output is correct
6 Correct 15 ms 2652 KB Output is correct
7 Correct 9 ms 2252 KB Output is correct
8 Correct 12 ms 2648 KB Output is correct
9 Correct 12 ms 2652 KB Output is correct
10 Correct 12 ms 2648 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 14 ms 2724 KB Output is correct
13 Correct 7 ms 2908 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 10 ms 2908 KB Output is correct
16 Correct 9 ms 2912 KB Output is correct
17 Correct 11 ms 2904 KB Output is correct
18 Correct 10 ms 2908 KB Output is correct
19 Correct 11 ms 2652 KB Output is correct
20 Correct 8 ms 2652 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 8 ms 2652 KB Output is correct
23 Correct 12 ms 2652 KB Output is correct
24 Correct 14 ms 2876 KB Output is correct
25 Correct 12 ms 2652 KB Output is correct
26 Correct 9 ms 2652 KB Output is correct
27 Correct 8 ms 2652 KB Output is correct
28 Correct 10 ms 2652 KB Output is correct
29 Correct 10 ms 2604 KB Output is correct
30 Correct 16 ms 2712 KB Output is correct
31 Correct 13 ms 2652 KB Output is correct
32 Correct 12 ms 2876 KB Output is correct
33 Correct 7 ms 2908 KB Output is correct
34 Correct 7 ms 2908 KB Output is correct
35 Correct 7 ms 2904 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 11 ms 2652 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 12 ms 2652 KB Output is correct
5 Correct 1622 ms 142164 KB Output is correct
6 Correct 2182 ms 122560 KB Output is correct
7 Correct 1989 ms 109408 KB Output is correct
8 Correct 1491 ms 104640 KB Output is correct
9 Correct 1377 ms 111000 KB Output is correct
10 Correct 2600 ms 157108 KB Output is correct
11 Correct 2648 ms 157268 KB Output is correct
12 Correct 2588 ms 157112 KB Output is correct
13 Correct 2623 ms 156908 KB Output is correct
14 Correct 2661 ms 157052 KB Output is correct
15 Correct 1423 ms 165304 KB Output is correct
16 Correct 1307 ms 165628 KB Output is correct
17 Correct 1451 ms 164900 KB Output is correct
18 Correct 2549 ms 157528 KB Output is correct
19 Correct 2684 ms 157348 KB Output is correct
20 Correct 2505 ms 157380 KB Output is correct
21 Correct 1149 ms 157592 KB Output is correct
22 Correct 881 ms 157664 KB Output is correct
23 Correct 1179 ms 155944 KB Output is correct
24 Correct 976 ms 157504 KB Output is correct
25 Correct 1729 ms 158904 KB Output is correct
26 Correct 1822 ms 155408 KB Output is correct
27 Correct 1915 ms 158692 KB Output is correct
28 Correct 1244 ms 156196 KB Output is correct
29 Correct 1073 ms 156156 KB Output is correct
30 Correct 1799 ms 156540 KB Output is correct
31 Correct 1851 ms 156340 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 3028 KB Output is correct
3 Correct 7 ms 2908 KB Output is correct
4 Correct 9 ms 2980 KB Output is correct
5 Correct 752 ms 118616 KB Output is correct
6 Correct 648 ms 101420 KB Output is correct
7 Correct 1079 ms 134768 KB Output is correct
8 Correct 1479 ms 165940 KB Output is correct
9 Correct 1439 ms 165952 KB Output is correct
10 Correct 1476 ms 165804 KB Output is correct
11 Correct 1154 ms 166600 KB Output is correct
12 Correct 1148 ms 166692 KB Output is correct
13 Correct 1129 ms 163700 KB Output is correct
14 Correct 702 ms 164748 KB Output is correct
15 Correct 634 ms 164516 KB Output is correct
16 Correct 877 ms 165004 KB Output is correct
17 Correct 787 ms 164908 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 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 8 ms 2516 KB Output is correct
6 Correct 15 ms 2652 KB Output is correct
7 Correct 9 ms 2252 KB Output is correct
8 Correct 12 ms 2648 KB Output is correct
9 Correct 12 ms 2652 KB Output is correct
10 Correct 12 ms 2648 KB Output is correct
11 Correct 12 ms 2652 KB Output is correct
12 Correct 14 ms 2724 KB Output is correct
13 Correct 7 ms 2908 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 10 ms 2908 KB Output is correct
16 Correct 9 ms 2912 KB Output is correct
17 Correct 11 ms 2904 KB Output is correct
18 Correct 10 ms 2908 KB Output is correct
19 Correct 11 ms 2652 KB Output is correct
20 Correct 8 ms 2652 KB Output is correct
21 Correct 8 ms 2652 KB Output is correct
22 Correct 8 ms 2652 KB Output is correct
23 Correct 12 ms 2652 KB Output is correct
24 Correct 14 ms 2876 KB Output is correct
25 Correct 12 ms 2652 KB Output is correct
26 Correct 9 ms 2652 KB Output is correct
27 Correct 8 ms 2652 KB Output is correct
28 Correct 10 ms 2652 KB Output is correct
29 Correct 10 ms 2604 KB Output is correct
30 Correct 16 ms 2712 KB Output is correct
31 Correct 13 ms 2652 KB Output is correct
32 Correct 12 ms 2876 KB Output is correct
33 Correct 7 ms 2908 KB Output is correct
34 Correct 7 ms 2908 KB Output is correct
35 Correct 7 ms 2904 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 11 ms 2652 KB Output is correct
38 Correct 11 ms 2652 KB Output is correct
39 Correct 12 ms 2652 KB Output is correct
40 Correct 1622 ms 142164 KB Output is correct
41 Correct 2182 ms 122560 KB Output is correct
42 Correct 1989 ms 109408 KB Output is correct
43 Correct 1491 ms 104640 KB Output is correct
44 Correct 1377 ms 111000 KB Output is correct
45 Correct 2600 ms 157108 KB Output is correct
46 Correct 2648 ms 157268 KB Output is correct
47 Correct 2588 ms 157112 KB Output is correct
48 Correct 2623 ms 156908 KB Output is correct
49 Correct 2661 ms 157052 KB Output is correct
50 Correct 1423 ms 165304 KB Output is correct
51 Correct 1307 ms 165628 KB Output is correct
52 Correct 1451 ms 164900 KB Output is correct
53 Correct 2549 ms 157528 KB Output is correct
54 Correct 2684 ms 157348 KB Output is correct
55 Correct 2505 ms 157380 KB Output is correct
56 Correct 1149 ms 157592 KB Output is correct
57 Correct 881 ms 157664 KB Output is correct
58 Correct 1179 ms 155944 KB Output is correct
59 Correct 976 ms 157504 KB Output is correct
60 Correct 1729 ms 158904 KB Output is correct
61 Correct 1822 ms 155408 KB Output is correct
62 Correct 1915 ms 158692 KB Output is correct
63 Correct 1244 ms 156196 KB Output is correct
64 Correct 1073 ms 156156 KB Output is correct
65 Correct 1799 ms 156540 KB Output is correct
66 Correct 1851 ms 156340 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 7 ms 3028 KB Output is correct
69 Correct 7 ms 2908 KB Output is correct
70 Correct 9 ms 2980 KB Output is correct
71 Correct 752 ms 118616 KB Output is correct
72 Correct 648 ms 101420 KB Output is correct
73 Correct 1079 ms 134768 KB Output is correct
74 Correct 1479 ms 165940 KB Output is correct
75 Correct 1439 ms 165952 KB Output is correct
76 Correct 1476 ms 165804 KB Output is correct
77 Correct 1154 ms 166600 KB Output is correct
78 Correct 1148 ms 166692 KB Output is correct
79 Correct 1129 ms 163700 KB Output is correct
80 Correct 702 ms 164748 KB Output is correct
81 Correct 634 ms 164516 KB Output is correct
82 Correct 877 ms 165004 KB Output is correct
83 Correct 787 ms 164908 KB Output is correct
84 Correct 1825 ms 140700 KB Output is correct
85 Correct 1921 ms 119544 KB Output is correct
86 Correct 1547 ms 88552 KB Output is correct
87 Correct 2962 ms 156680 KB Output is correct
88 Correct 2975 ms 156812 KB Output is correct
89 Correct 2990 ms 156672 KB Output is correct
90 Correct 3019 ms 156804 KB Output is correct
91 Correct 2932 ms 156672 KB Output is correct
92 Correct 1693 ms 162852 KB Output is correct
93 Correct 1583 ms 164956 KB Output is correct
94 Correct 2797 ms 156596 KB Output is correct
95 Correct 2840 ms 157624 KB Output is correct
96 Correct 2829 ms 157148 KB Output is correct
97 Correct 3030 ms 158188 KB Output is correct
98 Correct 1736 ms 158340 KB Output is correct
99 Correct 1586 ms 158120 KB Output is correct
100 Correct 1692 ms 158468 KB Output is correct
101 Correct 1622 ms 158252 KB Output is correct
102 Correct 2160 ms 156300 KB Output is correct
103 Correct 2144 ms 159416 KB Output is correct
104 Correct 2127 ms 156332 KB Output is correct
105 Correct 1178 ms 157248 KB Output is correct
106 Correct 1459 ms 157124 KB Output is correct
107 Correct 1616 ms 157088 KB Output is correct
108 Correct 1469 ms 156828 KB Output is correct