oj.uz

Submission #825612

# Submission time Handle Problem Language Result Execution time Memory
825612 2023-08-15T06:20:43 Z t6twotwo Two Currencies (JOI23_currencies) C++17
10 / 100
 5000 ms 14660 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<vector<int>> c(N - 1);
    for (int i = 0; i < M; i++) {
        int P, C;
        cin >> P >> C;
        c[P - 1].push_back(C);
    }
    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 1 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 21 ms 596 KB Output is correct
6 Correct 35 ms 592 KB Output is correct
7 Correct 20 ms 552 KB Output is correct
8 Correct 38 ms 624 KB Output is correct
9 Correct 38 ms 640 KB Output is correct
10 Correct 38 ms 588 KB Output is correct
11 Correct 44 ms 648 KB Output is correct
12 Correct 39 ms 588 KB Output is correct
13 Correct 127 ms 636 KB Output is correct
14 Correct 127 ms 596 KB Output is correct
15 Correct 76 ms 624 KB Output is correct
16 Correct 70 ms 628 KB Output is correct
17 Correct 67 ms 596 KB Output is correct
18 Correct 77 ms 632 KB Output is correct
19 Correct 24 ms 652 KB Output is correct
20 Correct 20 ms 648 KB Output is correct
21 Correct 21 ms 636 KB Output is correct
22 Correct 20 ms 596 KB Output is correct
23 Correct 85 ms 652 KB Output is correct
24 Correct 79 ms 632 KB Output is correct
25 Correct 83 ms 624 KB Output is correct
26 Correct 24 ms 596 KB Output is correct
27 Correct 24 ms 632 KB Output is correct
28 Correct 25 ms 596 KB Output is correct
29 Correct 25 ms 632 KB Output is correct
30 Correct 38 ms 596 KB Output is correct
31 Correct 37 ms 596 KB Output is correct
32 Correct 37 ms 596 KB Output is correct
33 Correct 95 ms 644 KB Output is correct
34 Correct 96 ms 636 KB Output is correct
35 Correct 95 ms 640 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 38 ms 640 KB Output is correct
3 Correct 38 ms 632 KB Output is correct
4 Correct 38 ms 644 KB Output is correct
5 Execution timed out 5056 ms 14660 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 96 ms 636 KB Output is correct
3 Correct 95 ms 636 KB Output is correct
4 Correct 95 ms 724 KB Output is correct
5 Execution timed out 5035 ms 13404 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 21 ms 596 KB Output is correct
6 Correct 35 ms 592 KB Output is correct
7 Correct 20 ms 552 KB Output is correct
8 Correct 38 ms 624 KB Output is correct
9 Correct 38 ms 640 KB Output is correct
10 Correct 38 ms 588 KB Output is correct
11 Correct 44 ms 648 KB Output is correct
12 Correct 39 ms 588 KB Output is correct
13 Correct 127 ms 636 KB Output is correct
14 Correct 127 ms 596 KB Output is correct
15 Correct 76 ms 624 KB Output is correct
16 Correct 70 ms 628 KB Output is correct
17 Correct 67 ms 596 KB Output is correct
18 Correct 77 ms 632 KB Output is correct
19 Correct 24 ms 652 KB Output is correct
20 Correct 20 ms 648 KB Output is correct
21 Correct 21 ms 636 KB Output is correct
22 Correct 20 ms 596 KB Output is correct
23 Correct 85 ms 652 KB Output is correct
24 Correct 79 ms 632 KB Output is correct
25 Correct 83 ms 624 KB Output is correct
26 Correct 24 ms 596 KB Output is correct
27 Correct 24 ms 632 KB Output is correct
28 Correct 25 ms 596 KB Output is correct
29 Correct 25 ms 632 KB Output is correct
30 Correct 38 ms 596 KB Output is correct
31 Correct 37 ms 596 KB Output is correct
32 Correct 37 ms 596 KB Output is correct
33 Correct 95 ms 644 KB Output is correct
34 Correct 96 ms 636 KB Output is correct
35 Correct 95 ms 640 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 38 ms 640 KB Output is correct
38 Correct 38 ms 632 KB Output is correct
39 Correct 38 ms 644 KB Output is correct
40 Execution timed out 5056 ms 14660 KB Time limit exceeded
41 Halted 0 ms 0 KB -