oj.uz

Submission #792779

# Submission time Handle Problem Language Result Execution time Memory
792779 2023-07-25T08:40:40 Z vjudge1 Two Currencies (JOI23_currencies) C++17
10 / 100
 80 ms 12168 KB 
#ifdef Home
#define _GLIBCXX_DEBUG
#endif // Home

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 100100;
const int LOGN = 17;

struct MyPQ{
    priority_queue < int > pq;
    ll sum = 0, y, c = 0;

    MyPQ(ll y):y(y) {};

    void add(ll x) {
        pq.push(x);
        sum += x;
        for(; sum > y;) {
            sum -= pq.top();
            pq.pop();
            ++ c;
        }
    }
};

vector < pair < int, int > > adj[N];
vector < int > C[N];

int n, m, q, cnt[N][LOGN], depth[N], up[N][LOGN], P_C[N];

void dfs1(int v, int p) {
    depth[v] = depth[p] + 1;
    up[v][0] = p;
    for(int i = 1; i < LOGN; ++ i) {
        up[v][i] = up[ up[v][i - 1] ][i - 1];
    }
    for(auto &[u, w] : adj[v]) {
        if(u != p) {
            P_C[u] = w;
            dfs1(u, v);
        }
    }
}

ll slow_LCA(ll a, ll b, ll &Y) {
    if(depth[a] < depth[b]) {
        swap(a, b);
    }
    MyPQ ans(Y);
    for(; depth[a] > depth[b];) {
        for(auto &i : C[P_C[a]]) {
            ans.add(i);
        }
        a = up[a][0];
    }
    for(; a != b;) {
        for(auto &i : C[P_C[a]]) {
            ans.add(i);
        }
        for(auto &i : C[P_C[b]]) {
            ans.add(i);
        }
        a = up[a][0];
        b = up[b][0];
    }
    return ans.c;
}

void solve_subtask_1() {
    dfs1(1, 1);
    ll s, t, X, Y, Z;
    for(; q --> 0;) {
        cin >> s >> t >> X >> Y;
        Z = slow_LCA(s, t, Y);
        cout << (X < Z ? -1 : X - Z) << '\n';
    }   
}

main() {
#ifdef Home
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // Home
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> q;
    for(int u, v, i = 1; i < n; ++ i) {
        cin >> u >> v;
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }
    for(int p, c; m --> 0;) {
        cin >> p >> c;
        C[p].push_back(c);
    }
    if(n <= 2023 && q <= 2023) {
        solve_subtask_1();
        return 0;
    }
}

Compilation message

currencies.cpp:85:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 | main() {
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5028 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 4 ms 5332 KB Output is correct
6 Correct 5 ms 5332 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 5 ms 5332 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 5 ms 5296 KB Output is correct
12 Correct 5 ms 5332 KB Output is correct
13 Correct 71 ms 5484 KB Output is correct
14 Correct 68 ms 5476 KB Output is correct
15 Correct 30 ms 5332 KB Output is correct
16 Correct 27 ms 5432 KB Output is correct
17 Correct 19 ms 5332 KB Output is correct
18 Correct 31 ms 5428 KB Output is correct
19 Correct 4 ms 5332 KB Output is correct
20 Correct 4 ms 5332 KB Output is correct
21 Correct 4 ms 5332 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 38 ms 5332 KB Output is correct
24 Correct 37 ms 5332 KB Output is correct
25 Correct 36 ms 5332 KB Output is correct
26 Correct 4 ms 5332 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 5 ms 5304 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 4 ms 5332 KB Output is correct
31 Correct 7 ms 5332 KB Output is correct
32 Correct 5 ms 5332 KB Output is correct
33 Correct 62 ms 5480 KB Output is correct
34 Correct 72 ms 5500 KB Output is correct
35 Correct 68 ms 5484 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 6 ms 5300 KB Output is correct
3 Correct 5 ms 5300 KB Output is correct
4 Correct 5 ms 5300 KB Output is correct
5 Incorrect 45 ms 12168 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 70 ms 5484 KB Output is correct
3 Correct 64 ms 5484 KB Output is correct
4 Correct 80 ms 5484 KB Output is correct
5 Incorrect 42 ms 11192 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5028 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 4 ms 5332 KB Output is correct
6 Correct 5 ms 5332 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 5 ms 5332 KB Output is correct
10 Correct 5 ms 5332 KB Output is correct
11 Correct 5 ms 5296 KB Output is correct
12 Correct 5 ms 5332 KB Output is correct
13 Correct 71 ms 5484 KB Output is correct
14 Correct 68 ms 5476 KB Output is correct
15 Correct 30 ms 5332 KB Output is correct
16 Correct 27 ms 5432 KB Output is correct
17 Correct 19 ms 5332 KB Output is correct
18 Correct 31 ms 5428 KB Output is correct
19 Correct 4 ms 5332 KB Output is correct
20 Correct 4 ms 5332 KB Output is correct
21 Correct 4 ms 5332 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 38 ms 5332 KB Output is correct
24 Correct 37 ms 5332 KB Output is correct
25 Correct 36 ms 5332 KB Output is correct
26 Correct 4 ms 5332 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 5 ms 5304 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 4 ms 5332 KB Output is correct
31 Correct 7 ms 5332 KB Output is correct
32 Correct 5 ms 5332 KB Output is correct
33 Correct 62 ms 5480 KB Output is correct
34 Correct 72 ms 5500 KB Output is correct
35 Correct 68 ms 5484 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 6 ms 5300 KB Output is correct
38 Correct 5 ms 5300 KB Output is correct
39 Correct 5 ms 5300 KB Output is correct
40 Incorrect 45 ms 12168 KB Output isn't correct
41 Halted 0 ms 0 KB -