oj.uz

Submission #825622

# Submission time Handle Problem Language Result Execution time Memory
825622 2023-08-15T06:33:05 Z t6twotwo Two Currencies (JOI23_currencies) C++17
38 / 100
 5000 ms 36812 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;
    }
    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 6/22;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 22 ms 552 KB Output is correct
6 Correct 37 ms 560 KB Output is correct
7 Correct 21 ms 468 KB Output is correct
8 Correct 40 ms 468 KB Output is correct
9 Correct 52 ms 576 KB Output is correct
10 Correct 41 ms 468 KB Output is correct
11 Correct 54 ms 564 KB Output is correct
12 Correct 42 ms 568 KB Output is correct
13 Correct 129 ms 468 KB Output is correct
14 Correct 137 ms 560 KB Output is correct
15 Correct 77 ms 540 KB Output is correct
16 Correct 85 ms 672 KB Output is correct
17 Correct 69 ms 544 KB Output is correct
18 Correct 77 ms 468 KB Output is correct
19 Correct 20 ms 588 KB Output is correct
20 Correct 20 ms 468 KB Output is correct
21 Correct 20 ms 584 KB Output is correct
22 Correct 20 ms 468 KB Output is correct
23 Correct 96 ms 468 KB Output is correct
24 Correct 102 ms 468 KB Output is correct
25 Correct 82 ms 544 KB Output is correct
26 Correct 26 ms 572 KB Output is correct
27 Correct 26 ms 564 KB Output is correct
28 Correct 26 ms 468 KB Output is correct
29 Correct 25 ms 572 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 96 ms 572 KB Output is correct
34 Correct 104 ms 468 KB Output is correct
35 Correct 102 ms 468 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 108 ms 26804 KB Output is correct
6 Correct 144 ms 22444 KB Output is correct
7 Correct 126 ms 25380 KB Output is correct
8 Correct 94 ms 25556 KB Output is correct
9 Correct 104 ms 25464 KB Output is correct
10 Correct 135 ms 30600 KB Output is correct
11 Correct 154 ms 30692 KB Output is correct
12 Correct 135 ms 30668 KB Output is correct
13 Correct 142 ms 30556 KB Output is correct
14 Correct 125 ms 30612 KB Output is correct
15 Correct 199 ms 36440 KB Output is correct
16 Correct 197 ms 36812 KB Output is correct
17 Correct 214 ms 36100 KB Output is correct
18 Correct 175 ms 30620 KB Output is correct
19 Correct 159 ms 30524 KB Output is correct
20 Correct 223 ms 30596 KB Output is correct
21 Correct 97 ms 30144 KB Output is correct
22 Correct 106 ms 30244 KB Output is correct
23 Correct 101 ms 30272 KB Output is correct
24 Correct 103 ms 30284 KB Output is correct
25 Correct 140 ms 30528 KB Output is correct
26 Correct 163 ms 30528 KB Output is correct
27 Correct 130 ms 30428 KB Output is correct
28 Correct 104 ms 30500 KB Output is correct
29 Correct 127 ms 30480 KB Output is correct
30 Correct 109 ms 30736 KB Output is correct
31 Correct 113 ms 30740 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 95 ms 556 KB Output is correct
3 Correct 101 ms 568 KB Output is correct
4 Correct 96 ms 468 KB Output is correct
5 Execution timed out 5053 ms 11496 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 22 ms 552 KB Output is correct
6 Correct 37 ms 560 KB Output is correct
7 Correct 21 ms 468 KB Output is correct
8 Correct 40 ms 468 KB Output is correct
9 Correct 52 ms 576 KB Output is correct
10 Correct 41 ms 468 KB Output is correct
11 Correct 54 ms 564 KB Output is correct
12 Correct 42 ms 568 KB Output is correct
13 Correct 129 ms 468 KB Output is correct
14 Correct 137 ms 560 KB Output is correct
15 Correct 77 ms 540 KB Output is correct
16 Correct 85 ms 672 KB Output is correct
17 Correct 69 ms 544 KB Output is correct
18 Correct 77 ms 468 KB Output is correct
19 Correct 20 ms 588 KB Output is correct
20 Correct 20 ms 468 KB Output is correct
21 Correct 20 ms 584 KB Output is correct
22 Correct 20 ms 468 KB Output is correct
23 Correct 96 ms 468 KB Output is correct
24 Correct 102 ms 468 KB Output is correct
25 Correct 82 ms 544 KB Output is correct
26 Correct 26 ms 572 KB Output is correct
27 Correct 26 ms 564 KB Output is correct
28 Correct 26 ms 468 KB Output is correct
29 Correct 25 ms 572 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 96 ms 572 KB Output is correct
34 Correct 104 ms 468 KB Output is correct
35 Correct 102 ms 468 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 3 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 108 ms 26804 KB Output is correct
41 Correct 144 ms 22444 KB Output is correct
42 Correct 126 ms 25380 KB Output is correct
43 Correct 94 ms 25556 KB Output is correct
44 Correct 104 ms 25464 KB Output is correct
45 Correct 135 ms 30600 KB Output is correct
46 Correct 154 ms 30692 KB Output is correct
47 Correct 135 ms 30668 KB Output is correct
48 Correct 142 ms 30556 KB Output is correct
49 Correct 125 ms 30612 KB Output is correct
50 Correct 199 ms 36440 KB Output is correct
51 Correct 197 ms 36812 KB Output is correct
52 Correct 214 ms 36100 KB Output is correct
53 Correct 175 ms 30620 KB Output is correct
54 Correct 159 ms 30524 KB Output is correct
55 Correct 223 ms 30596 KB Output is correct
56 Correct 97 ms 30144 KB Output is correct
57 Correct 106 ms 30244 KB Output is correct
58 Correct 101 ms 30272 KB Output is correct
59 Correct 103 ms 30284 KB Output is correct
60 Correct 140 ms 30528 KB Output is correct
61 Correct 163 ms 30528 KB Output is correct
62 Correct 130 ms 30428 KB Output is correct
63 Correct 104 ms 30500 KB Output is correct
64 Correct 127 ms 30480 KB Output is correct
65 Correct 109 ms 30736 KB Output is correct
66 Correct 113 ms 30740 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 95 ms 556 KB Output is correct
69 Correct 101 ms 568 KB Output is correct
70 Correct 96 ms 468 KB Output is correct
71 Execution timed out 5053 ms 11496 KB Time limit exceeded
72 Halted 0 ms 0 KB -