oj.uz

Submission #805185

# Submission time Handle Problem Language Result Execution time Memory
805185 2023-08-03T13:48:40 Z Sharky Two Currencies (JOI23_currencies) C++17
10 / 100
 5000 ms 37780 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define sz(x) (int)x.size()
const int maxn = 1E5+8;

vector<pair<int, vector<int>>> adj[maxn];

struct edge {
    int u, v;
    vector<int> c;
};

vector<edge> edges;
map<pair<int, int>, int> mp;
int n, m, q, ls[maxn];

void dfs(int u, int pr = -1) {
    for (auto& [v, c] : adj[u]) {
        if (v == pr) continue;
        dfs(v, u);
        ls[v] = u;
    }
}

int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> q;
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        edges.push_back((edge) {u, v, {}});
        mp[{u, v}] = mp[{v, u}] = i;
    }
    for (int i = 1; i <= m; i++) {
        int p, c;
        cin >> p >> c;
        edges[p-1].c.push_back(c);
    }
    for (auto& [u, v, c] : edges) {
        adj[u].push_back({v, c});
        adj[v].push_back({u, c});
    }
    while (q--) {
        int s, t, x, y;
        cin >> s >> t >> x >> y;
        for (int i = 1; i <= n; i++) ls[i] = -1;
        vector<int> path, c;
        dfs(s);
        int bk = t;
        while (bk != -1) {
            path.push_back(bk);
            bk = ls[bk];
        }
        reverse(path.begin(), path.end());
        // for (int& e : path) cout << e << " ";
        // cout << "\n";
        for (int i = 0; i < sz(path) - 1; i++) {
            int l = path[i], r = path[i+1];
            for (int& e : edges[mp[{l, r}]].c) c.push_back(e);
        }
        sort(c.begin(), c.end());
        int cur = 0, mnd = sz(c);
        for (int i = 0; i < sz(c); i++) {
            cur += c[i];
            if (cur <= y) {
                int d = sz(c) - i - 1;
                mnd = min(mnd, d);
            }
        }
        if (x < mnd) {
            cout << "-1\n";
            goto bye;
        }
        cout << x - mnd << "\n";
        bye:{}
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2676 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 33 ms 3328 KB Output is correct
6 Correct 52 ms 3388 KB Output is correct
7 Correct 37 ms 3160 KB Output is correct
8 Correct 55 ms 3412 KB Output is correct
9 Correct 66 ms 3412 KB Output is correct
10 Correct 55 ms 3412 KB Output is correct
11 Correct 71 ms 3412 KB Output is correct
12 Correct 56 ms 3412 KB Output is correct
13 Correct 282 ms 3540 KB Output is correct
14 Correct 289 ms 3524 KB Output is correct
15 Correct 163 ms 3472 KB Output is correct
16 Correct 152 ms 3588 KB Output is correct
17 Correct 123 ms 3448 KB Output is correct
18 Correct 160 ms 3468 KB Output is correct
19 Correct 21 ms 3284 KB Output is correct
20 Correct 28 ms 3392 KB Output is correct
21 Correct 23 ms 3328 KB Output is correct
22 Correct 23 ms 3380 KB Output is correct
23 Correct 115 ms 3412 KB Output is correct
24 Correct 95 ms 3392 KB Output is correct
25 Correct 88 ms 3412 KB Output is correct
26 Correct 30 ms 3412 KB Output is correct
27 Correct 32 ms 3408 KB Output is correct
28 Correct 43 ms 3412 KB Output is correct
29 Correct 34 ms 3380 KB Output is correct
30 Correct 56 ms 3412 KB Output is correct
31 Correct 53 ms 3396 KB Output is correct
32 Correct 62 ms 3412 KB Output is correct
33 Correct 171 ms 3412 KB Output is correct
34 Correct 164 ms 3492 KB Output is correct
35 Correct 168 ms 3412 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2680 KB Output is correct
2 Correct 54 ms 3332 KB Output is correct
3 Correct 54 ms 3412 KB Output is correct
4 Correct 70 ms 3284 KB Output is correct
5 Execution timed out 5046 ms 37064 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 2644 KB Output is correct
2 Correct 182 ms 3480 KB Output is correct
3 Correct 166 ms 3500 KB Output is correct
4 Correct 172 ms 3488 KB Output is correct
5 Execution timed out 5074 ms 37780 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 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2676 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 33 ms 3328 KB Output is correct
6 Correct 52 ms 3388 KB Output is correct
7 Correct 37 ms 3160 KB Output is correct
8 Correct 55 ms 3412 KB Output is correct
9 Correct 66 ms 3412 KB Output is correct
10 Correct 55 ms 3412 KB Output is correct
11 Correct 71 ms 3412 KB Output is correct
12 Correct 56 ms 3412 KB Output is correct
13 Correct 282 ms 3540 KB Output is correct
14 Correct 289 ms 3524 KB Output is correct
15 Correct 163 ms 3472 KB Output is correct
16 Correct 152 ms 3588 KB Output is correct
17 Correct 123 ms 3448 KB Output is correct
18 Correct 160 ms 3468 KB Output is correct
19 Correct 21 ms 3284 KB Output is correct
20 Correct 28 ms 3392 KB Output is correct
21 Correct 23 ms 3328 KB Output is correct
22 Correct 23 ms 3380 KB Output is correct
23 Correct 115 ms 3412 KB Output is correct
24 Correct 95 ms 3392 KB Output is correct
25 Correct 88 ms 3412 KB Output is correct
26 Correct 30 ms 3412 KB Output is correct
27 Correct 32 ms 3408 KB Output is correct
28 Correct 43 ms 3412 KB Output is correct
29 Correct 34 ms 3380 KB Output is correct
30 Correct 56 ms 3412 KB Output is correct
31 Correct 53 ms 3396 KB Output is correct
32 Correct 62 ms 3412 KB Output is correct
33 Correct 171 ms 3412 KB Output is correct
34 Correct 164 ms 3492 KB Output is correct
35 Correct 168 ms 3412 KB Output is correct
36 Correct 2 ms 2680 KB Output is correct
37 Correct 54 ms 3332 KB Output is correct
38 Correct 54 ms 3412 KB Output is correct
39 Correct 70 ms 3284 KB Output is correct
40 Execution timed out 5046 ms 37064 KB Time limit exceeded
41 Halted 0 ms 0 KB -