oj.uz

Submission #825833

# Submission time Handle Problem Language Result Execution time Memory
825833 2023-08-15T08:41:20 Z t6twotwo Two Currencies (JOI23_currencies) C++17
68 / 100
 281 ms 30932 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
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<pair<int, 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].emplace_back(y, i);
        adj[y].emplace_back(x, i);
    }
    vector<int> P(M), C(M);
    vector<vector<int>> c(N - 1);
    for (int i = 0; i < M; i++) {
        cin >> P[i] >> C[i];
        P[i]--;
        c[P[i]].push_back(C[i]);
    }
    if (C == vector(M, C[0])) {
        vector<int> cnt(N - 1);
        for (int i = 0; i < M; i++) {
            cnt[P[i]]++;
        }
        vector<int> f(N), dep(N);
        vector par(N, vector<int>(20, -1));
        auto dfs = [&](auto dfs, int x) -> void {
            for (int i = 0; i < 19 && par[x][i] != -1; i++) {
                par[x][i + 1] = par[par[x][i]][i];
            }
            for (auto [y, z] : adj[x]) {
                if (y != par[x][0]) {
                    dep[y] = dep[x] + 1;
                    f[y] = f[x] + cnt[z];
                    par[y][0] = x;
                    dfs(dfs, y);
                }
            }
        };
        dfs(dfs, 0);
        auto lca = [&](int x, int y) {
            if (dep[x] < dep[y]) {
                swap(x, y);
            }
            for (int i = 0; i < 20; i++) {
                if ((dep[x] - dep[y]) >> i & 1) {
                    x = par[x][i];
                }
            }
            if (x == y) {
                return x;
            }
            for (int i = 19; i >= 0; i--) {
                if (par[x][i] != par[y][i]) {
                    x = par[x][i];
                    y = par[y][i];
                }
            }
            return par[x][0];
        };
        while (Q--) {
            int S, T, X; ll Y;
            cin >> S >> T >> X >> Y;
            S--, T--;
            int k = f[S] + f[T] - 2 * f[lca(S, T)];
            cout << max(-1LL, X - max(0LL, k - Y / C[0])) << "\n";
        }
        return 0;
    }
    if (N <= 2000 && M <= 2000 && Q <= 2000) {
        while (Q--) {
            int S, T, X; ll Y;
            cin >> S >> T >> X >> Y;
            S--, T--;
            vector<int> p(N, -1);
            queue<int> q;
            p[S] = S;
            q.push(S);
            while (!q.empty()) {
                int x = q.front();
                q.pop();
                for (auto [y, z] : adj[x]) {
                    if (p[y] == -1) {
                        p[y] = z;
                        q.push(y);
                    }
                }
            }
            priority_queue<int, vector<int>, greater<int>> pq;
            while (T != S) {
                for (int v : c[p[T]]) {
                    pq.push(v);
                }
                auto [x, y] = edges[p[T]];
                T ^= x ^ y;
            }
            while (!pq.empty() && pq.top() <= Y) {
                Y -= pq.top();
                pq.pop();
            }
            X -= pq.size();
            X = max(X, -1);
            cout << X << "\n";
        }
        return 0;
    }
    vector<int> S(Q), T(Q), X(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]--;
        if (S[i] > T[i]) {
            swap(S[i], T[i]);
        }
    }
    vector<pair<int, int>> ch(M);
    for (int i = 0; i < M; i++) {
        ch[i] = {C[i], P[i]};
    }
    sort(ch.begin(), ch.end());
    vector<int> lo(Q), hi(Q, M);
    vector<ll> bit(N);
    auto add = [&](int i, int v) {
        for (i++; i < N; i += i & -i) {
            bit[i] += v;
        }
    };
    auto sum = [&](int i) {
        ll s = 0;
        for (; i; i -= i & -i) {
            s += bit[i];
        }
        return s;
    };
    for (int z = 0; z < 20; z++) {
        vector<int> mi(Q);
        vector<vector<int>> f(M);
        for (int i = 0; i < Q; i++) {
            if (lo[i] != hi[i]) {
                mi[i] = (lo[i] + hi[i] + 1) / 2;
                f[mi[i] - 1].push_back(i);
            }
        }
        bit.assign(N, 0);
        for (int i = 0; i < M; i++) {
            auto [c, p] = ch[i];
            add(p, c);
            for (int j : f[i]) {
                if (sum(T[j]) - sum(S[j]) <= Y[j]) {
                    lo[j] = i + 1;
                } else {
                    hi[j] = i;
                }
            }
        }
    }
    vector<ll> ans(Q);
    vector<vector<int>> f(M + 1);
    for (int i = 0; i < Q; i++) {
        f[lo[i]].push_back(i);
    }
    bit.assign(N, 0);
    for (int i = M; i >= 0; i--) {
        if (i < M) {
            auto [c, p] = ch[i];
            add(p, 1);
        }
        for (int j : f[i]) {
            ans[j] = max(-1LL, X[j] - sum(T[j]) + sum(S[j]));
        }
    }
    for (int i = 0; i < Q; i++) {
        cout << ans[i] << " \n"[i == Q - 1];
    }
    return 6/22;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 25 ms 596 KB Output is correct
6 Correct 37 ms 652 KB Output is correct
7 Correct 21 ms 564 KB Output is correct
8 Correct 39 ms 656 KB Output is correct
9 Correct 40 ms 668 KB Output is correct
10 Correct 39 ms 652 KB Output is correct
11 Correct 42 ms 644 KB Output is correct
12 Correct 40 ms 640 KB Output is correct
13 Correct 134 ms 780 KB Output is correct
14 Correct 131 ms 596 KB Output is correct
15 Correct 79 ms 664 KB Output is correct
16 Correct 72 ms 644 KB Output is correct
17 Correct 70 ms 596 KB Output is correct
18 Correct 78 ms 648 KB Output is correct
19 Correct 23 ms 708 KB Output is correct
20 Correct 21 ms 668 KB Output is correct
21 Correct 22 ms 668 KB Output is correct
22 Correct 22 ms 632 KB Output is correct
23 Correct 88 ms 652 KB Output is correct
24 Correct 83 ms 644 KB Output is correct
25 Correct 94 ms 596 KB Output is correct
26 Correct 27 ms 656 KB Output is correct
27 Correct 28 ms 760 KB Output is correct
28 Correct 26 ms 596 KB Output is correct
29 Correct 26 ms 596 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 97 ms 660 KB Output is correct
34 Correct 107 ms 652 KB Output is correct
35 Correct 101 ms 652 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 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 104 ms 28052 KB Output is correct
6 Correct 101 ms 17416 KB Output is correct
7 Correct 106 ms 20740 KB Output is correct
8 Correct 101 ms 21536 KB Output is correct
9 Correct 126 ms 21492 KB Output is correct
10 Correct 141 ms 25368 KB Output is correct
11 Correct 143 ms 25476 KB Output is correct
12 Correct 126 ms 25492 KB Output is correct
13 Correct 142 ms 25412 KB Output is correct
14 Correct 183 ms 25384 KB Output is correct
15 Correct 187 ms 30516 KB Output is correct
16 Correct 196 ms 30932 KB Output is correct
17 Correct 214 ms 30280 KB Output is correct
18 Correct 172 ms 25148 KB Output is correct
19 Correct 176 ms 25108 KB Output is correct
20 Correct 170 ms 25100 KB Output is correct
21 Correct 97 ms 25536 KB Output is correct
22 Correct 108 ms 25616 KB Output is correct
23 Correct 112 ms 25596 KB Output is correct
24 Correct 115 ms 25516 KB Output is correct
25 Correct 140 ms 24960 KB Output is correct
26 Correct 148 ms 24944 KB Output is correct
27 Correct 125 ms 24956 KB Output is correct
28 Correct 118 ms 25384 KB Output is correct
29 Correct 103 ms 25448 KB Output is correct
30 Correct 105 ms 25472 KB Output is correct
31 Correct 112 ms 25480 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 101 ms 652 KB Output is correct
3 Correct 105 ms 660 KB Output is correct
4 Correct 104 ms 652 KB Output is correct
5 Correct 168 ms 22312 KB Output is correct
6 Correct 150 ms 20804 KB Output is correct
7 Correct 212 ms 21936 KB Output is correct
8 Correct 267 ms 28496 KB Output is correct
9 Correct 263 ms 28408 KB Output is correct
10 Correct 281 ms 28436 KB Output is correct
11 Correct 220 ms 27824 KB Output is correct
12 Correct 225 ms 27904 KB Output is correct
13 Correct 264 ms 27772 KB Output is correct
14 Correct 207 ms 28184 KB Output is correct
15 Correct 216 ms 28052 KB Output is correct
16 Correct 227 ms 28360 KB Output is correct
17 Correct 221 ms 28320 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 25 ms 596 KB Output is correct
6 Correct 37 ms 652 KB Output is correct
7 Correct 21 ms 564 KB Output is correct
8 Correct 39 ms 656 KB Output is correct
9 Correct 40 ms 668 KB Output is correct
10 Correct 39 ms 652 KB Output is correct
11 Correct 42 ms 644 KB Output is correct
12 Correct 40 ms 640 KB Output is correct
13 Correct 134 ms 780 KB Output is correct
14 Correct 131 ms 596 KB Output is correct
15 Correct 79 ms 664 KB Output is correct
16 Correct 72 ms 644 KB Output is correct
17 Correct 70 ms 596 KB Output is correct
18 Correct 78 ms 648 KB Output is correct
19 Correct 23 ms 708 KB Output is correct
20 Correct 21 ms 668 KB Output is correct
21 Correct 22 ms 668 KB Output is correct
22 Correct 22 ms 632 KB Output is correct
23 Correct 88 ms 652 KB Output is correct
24 Correct 83 ms 644 KB Output is correct
25 Correct 94 ms 596 KB Output is correct
26 Correct 27 ms 656 KB Output is correct
27 Correct 28 ms 760 KB Output is correct
28 Correct 26 ms 596 KB Output is correct
29 Correct 26 ms 596 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 97 ms 660 KB Output is correct
34 Correct 107 ms 652 KB Output is correct
35 Correct 101 ms 652 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 2 ms 852 KB Output is correct
38 Correct 2 ms 852 KB Output is correct
39 Correct 2 ms 852 KB Output is correct
40 Correct 104 ms 28052 KB Output is correct
41 Correct 101 ms 17416 KB Output is correct
42 Correct 106 ms 20740 KB Output is correct
43 Correct 101 ms 21536 KB Output is correct
44 Correct 126 ms 21492 KB Output is correct
45 Correct 141 ms 25368 KB Output is correct
46 Correct 143 ms 25476 KB Output is correct
47 Correct 126 ms 25492 KB Output is correct
48 Correct 142 ms 25412 KB Output is correct
49 Correct 183 ms 25384 KB Output is correct
50 Correct 187 ms 30516 KB Output is correct
51 Correct 196 ms 30932 KB Output is correct
52 Correct 214 ms 30280 KB Output is correct
53 Correct 172 ms 25148 KB Output is correct
54 Correct 176 ms 25108 KB Output is correct
55 Correct 170 ms 25100 KB Output is correct
56 Correct 97 ms 25536 KB Output is correct
57 Correct 108 ms 25616 KB Output is correct
58 Correct 112 ms 25596 KB Output is correct
59 Correct 115 ms 25516 KB Output is correct
60 Correct 140 ms 24960 KB Output is correct
61 Correct 148 ms 24944 KB Output is correct
62 Correct 125 ms 24956 KB Output is correct
63 Correct 118 ms 25384 KB Output is correct
64 Correct 103 ms 25448 KB Output is correct
65 Correct 105 ms 25472 KB Output is correct
66 Correct 112 ms 25480 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 101 ms 652 KB Output is correct
69 Correct 105 ms 660 KB Output is correct
70 Correct 104 ms 652 KB Output is correct
71 Correct 168 ms 22312 KB Output is correct
72 Correct 150 ms 20804 KB Output is correct
73 Correct 212 ms 21936 KB Output is correct
74 Correct 267 ms 28496 KB Output is correct
75 Correct 263 ms 28408 KB Output is correct
76 Correct 281 ms 28436 KB Output is correct
77 Correct 220 ms 27824 KB Output is correct
78 Correct 225 ms 27904 KB Output is correct
79 Correct 264 ms 27772 KB Output is correct
80 Correct 207 ms 28184 KB Output is correct
81 Correct 216 ms 28052 KB Output is correct
82 Correct 227 ms 28360 KB Output is correct
83 Correct 221 ms 28320 KB Output is correct
84 Incorrect 190 ms 23156 KB Output isn't correct
85 Halted 0 ms 0 KB -