oj.uz

Submission #839359

# Submission time Handle Problem Language Result Execution time Memory
839359 2023-08-29T19:55:13 Z t6twotwo Two Currencies (JOI23_currencies) C++17
100 / 100
 3228 ms 154444 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct node {
    node *l, *r;
    ll s;
    node() : s(0) {
        l = r = nullptr;
    }
    node(ll v) : s(v) {
        l = r = nullptr;
    }
    node(node *u, node *v) : l(u), r(v) {
        s = l->s + r->s;
    }
};
node *bld(int l, int r) {
    if (l + 1 == r) {
        return new node();
    }
    int m = (l + r) / 2;
    return new node(bld(l, m), bld(m, r));
}
node *add(node *p, int l, int r, int i, int v) {
    if (l + 1 == r) {
        return new node(p->s + v);
    }
    int m = (l + r) / 2;
    if (i < m) {
        return new node(add(p->l, l, m, i, v), p->r);
    } else {
        return new node(p->l, add(p->r, m, r, i, v));
    }
}
ll qry(node *p, int l, int r, int L, int R) {
    if (R <= l || r <= L) {
        return 0;
    }
    if (L <= l && r <= R) {
        return p->s;
    }
    int m = (l + r) / 2;
    return qry(p->l, l, m, L, R) + qry(p->r, m, r, L, R);
}
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);
    vector<node*> q{bld(0, N)};
    for (int i = 0; i < M; i++) {
        auto [c, p] = ch[i];
        q.push_back(add(q.back(), 0, N, 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 += qry(q[z], 0, N, in[top[x]], in[x] + 1);
            x = par[top[x]];
        }
        if (dep[x] < dep[y]) {
            swap(x, y);
        }
        s += qry(q[z], 0, N, 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 = vector{bld(0, N)};
    for (int i = M; i >= 0; i--) {
        if (i < M) {
            auto [c, p] = ch[i];
            q.push_back(add(q.back(), 0, N, in[t[p]], 1));
        }
        for (int j : f[i]) {
            ans[j] = max(-1LL, X[j] - get(S[j], T[j], q.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 336 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 2260 KB Output is correct
6 Correct 12 ms 2260 KB Output is correct
7 Correct 10 ms 1748 KB Output is correct
8 Correct 12 ms 2388 KB Output is correct
9 Correct 12 ms 2640 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 12 ms 2480 KB Output is correct
12 Correct 12 ms 2388 KB Output is correct
13 Correct 7 ms 2644 KB Output is correct
14 Correct 8 ms 2644 KB Output is correct
15 Correct 9 ms 2516 KB Output is correct
16 Correct 10 ms 2516 KB Output is correct
17 Correct 13 ms 2480 KB Output is correct
18 Correct 9 ms 2516 KB Output is correct
19 Correct 8 ms 2388 KB Output is correct
20 Correct 8 ms 2388 KB Output is correct
21 Correct 8 ms 2516 KB Output is correct
22 Correct 8 ms 2388 KB Output is correct
23 Correct 12 ms 2516 KB Output is correct
24 Correct 13 ms 2516 KB Output is correct
25 Correct 12 ms 2516 KB Output is correct
26 Correct 8 ms 2388 KB Output is correct
27 Correct 9 ms 2388 KB Output is correct
28 Correct 11 ms 2388 KB Output is correct
29 Correct 6 ms 2388 KB Output is correct
30 Correct 12 ms 2516 KB Output is correct
31 Correct 11 ms 2388 KB Output is correct
32 Correct 12 ms 2388 KB Output is correct
33 Correct 7 ms 2644 KB Output is correct
34 Correct 7 ms 2644 KB Output is correct
35 Correct 7 ms 2736 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 12 ms 2388 KB Output is correct
3 Correct 12 ms 2388 KB Output is correct
4 Correct 12 ms 2388 KB Output is correct
5 Correct 1686 ms 127432 KB Output is correct
6 Correct 2295 ms 110608 KB Output is correct
7 Correct 2093 ms 97376 KB Output is correct
8 Correct 1604 ms 93608 KB Output is correct
9 Correct 1527 ms 99308 KB Output is correct
10 Correct 2757 ms 141860 KB Output is correct
11 Correct 2787 ms 141744 KB Output is correct
12 Correct 2874 ms 141808 KB Output is correct
13 Correct 2931 ms 141720 KB Output is correct
14 Correct 2848 ms 141736 KB Output is correct
15 Correct 1390 ms 152820 KB Output is correct
16 Correct 1354 ms 153348 KB Output is correct
17 Correct 1437 ms 152252 KB Output is correct
18 Correct 2723 ms 142248 KB Output is correct
19 Correct 2741 ms 142008 KB Output is correct
20 Correct 2755 ms 142056 KB Output is correct
21 Correct 906 ms 142608 KB Output is correct
22 Correct 911 ms 142524 KB Output is correct
23 Correct 944 ms 142596 KB Output is correct
24 Correct 956 ms 142592 KB Output is correct
25 Correct 1840 ms 143152 KB Output is correct
26 Correct 1979 ms 140136 KB Output is correct
27 Correct 1888 ms 140084 KB Output is correct
28 Correct 1306 ms 141340 KB Output is correct
29 Correct 1129 ms 141160 KB Output is correct
30 Correct 1706 ms 141156 KB Output is correct
31 Correct 1611 ms 141100 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 7 ms 2644 KB Output is correct
3 Correct 7 ms 2644 KB Output is correct
4 Correct 7 ms 2644 KB Output is correct
5 Correct 704 ms 108672 KB Output is correct
6 Correct 666 ms 93104 KB Output is correct
7 Correct 1060 ms 124436 KB Output is correct
8 Correct 1407 ms 153544 KB Output is correct
9 Correct 1456 ms 153656 KB Output is correct
10 Correct 1457 ms 153652 KB Output is correct
11 Correct 1126 ms 154444 KB Output is correct
12 Correct 1138 ms 154404 KB Output is correct
13 Correct 1080 ms 151308 KB Output is correct
14 Correct 755 ms 152388 KB Output is correct
15 Correct 629 ms 152156 KB Output is correct
16 Correct 854 ms 152640 KB Output is correct
17 Correct 775 ms 152512 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 8 ms 2260 KB Output is correct
6 Correct 12 ms 2260 KB Output is correct
7 Correct 10 ms 1748 KB Output is correct
8 Correct 12 ms 2388 KB Output is correct
9 Correct 12 ms 2640 KB Output is correct
10 Correct 13 ms 2388 KB Output is correct
11 Correct 12 ms 2480 KB Output is correct
12 Correct 12 ms 2388 KB Output is correct
13 Correct 7 ms 2644 KB Output is correct
14 Correct 8 ms 2644 KB Output is correct
15 Correct 9 ms 2516 KB Output is correct
16 Correct 10 ms 2516 KB Output is correct
17 Correct 13 ms 2480 KB Output is correct
18 Correct 9 ms 2516 KB Output is correct
19 Correct 8 ms 2388 KB Output is correct
20 Correct 8 ms 2388 KB Output is correct
21 Correct 8 ms 2516 KB Output is correct
22 Correct 8 ms 2388 KB Output is correct
23 Correct 12 ms 2516 KB Output is correct
24 Correct 13 ms 2516 KB Output is correct
25 Correct 12 ms 2516 KB Output is correct
26 Correct 8 ms 2388 KB Output is correct
27 Correct 9 ms 2388 KB Output is correct
28 Correct 11 ms 2388 KB Output is correct
29 Correct 6 ms 2388 KB Output is correct
30 Correct 12 ms 2516 KB Output is correct
31 Correct 11 ms 2388 KB Output is correct
32 Correct 12 ms 2388 KB Output is correct
33 Correct 7 ms 2644 KB Output is correct
34 Correct 7 ms 2644 KB Output is correct
35 Correct 7 ms 2736 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 12 ms 2388 KB Output is correct
38 Correct 12 ms 2388 KB Output is correct
39 Correct 12 ms 2388 KB Output is correct
40 Correct 1686 ms 127432 KB Output is correct
41 Correct 2295 ms 110608 KB Output is correct
42 Correct 2093 ms 97376 KB Output is correct
43 Correct 1604 ms 93608 KB Output is correct
44 Correct 1527 ms 99308 KB Output is correct
45 Correct 2757 ms 141860 KB Output is correct
46 Correct 2787 ms 141744 KB Output is correct
47 Correct 2874 ms 141808 KB Output is correct
48 Correct 2931 ms 141720 KB Output is correct
49 Correct 2848 ms 141736 KB Output is correct
50 Correct 1390 ms 152820 KB Output is correct
51 Correct 1354 ms 153348 KB Output is correct
52 Correct 1437 ms 152252 KB Output is correct
53 Correct 2723 ms 142248 KB Output is correct
54 Correct 2741 ms 142008 KB Output is correct
55 Correct 2755 ms 142056 KB Output is correct
56 Correct 906 ms 142608 KB Output is correct
57 Correct 911 ms 142524 KB Output is correct
58 Correct 944 ms 142596 KB Output is correct
59 Correct 956 ms 142592 KB Output is correct
60 Correct 1840 ms 143152 KB Output is correct
61 Correct 1979 ms 140136 KB Output is correct
62 Correct 1888 ms 140084 KB Output is correct
63 Correct 1306 ms 141340 KB Output is correct
64 Correct 1129 ms 141160 KB Output is correct
65 Correct 1706 ms 141156 KB Output is correct
66 Correct 1611 ms 141100 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 7 ms 2644 KB Output is correct
69 Correct 7 ms 2644 KB Output is correct
70 Correct 7 ms 2644 KB Output is correct
71 Correct 704 ms 108672 KB Output is correct
72 Correct 666 ms 93104 KB Output is correct
73 Correct 1060 ms 124436 KB Output is correct
74 Correct 1407 ms 153544 KB Output is correct
75 Correct 1456 ms 153656 KB Output is correct
76 Correct 1457 ms 153652 KB Output is correct
77 Correct 1126 ms 154444 KB Output is correct
78 Correct 1138 ms 154404 KB Output is correct
79 Correct 1080 ms 151308 KB Output is correct
80 Correct 755 ms 152388 KB Output is correct
81 Correct 629 ms 152156 KB Output is correct
82 Correct 854 ms 152640 KB Output is correct
83 Correct 775 ms 152512 KB Output is correct
84 Correct 1817 ms 127244 KB Output is correct
85 Correct 1924 ms 108424 KB Output is correct
86 Correct 1691 ms 79660 KB Output is correct
87 Correct 2936 ms 141676 KB Output is correct
88 Correct 3098 ms 141548 KB Output is correct
89 Correct 3228 ms 141544 KB Output is correct
90 Correct 3131 ms 141660 KB Output is correct
91 Correct 3119 ms 141616 KB Output is correct
92 Correct 1634 ms 149232 KB Output is correct
93 Correct 1573 ms 151500 KB Output is correct
94 Correct 2939 ms 141948 KB Output is correct
95 Correct 2982 ms 141832 KB Output is correct
96 Correct 2918 ms 141992 KB Output is correct
97 Correct 3147 ms 141908 KB Output is correct
98 Correct 1586 ms 142332 KB Output is correct
99 Correct 1607 ms 142340 KB Output is correct
100 Correct 1557 ms 142336 KB Output is correct
101 Correct 1540 ms 142268 KB Output is correct
102 Correct 2083 ms 142928 KB Output is correct
103 Correct 2254 ms 139832 KB Output is correct
104 Correct 2298 ms 139840 KB Output is correct
105 Correct 1292 ms 140848 KB Output is correct
106 Correct 1648 ms 141000 KB Output is correct
107 Correct 1742 ms 140952 KB Output is correct
108 Correct 1683 ms 140904 KB Output is correct