oj.uz

Submission #793166

# Submission time Handle Problem Language Result Execution time Memory
793166 2023-07-25T14:44:34 Z phoenix Two Currencies (JOI23_currencies) C++17
38 / 100
 421 ms 32348 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

struct citizen {
    int s, t;
    ll x, y;
    int inx;
};

struct edge {
    int to, i;
};

int n, m, q;
vector<pair<int, int>> edges;
vector<pair<int, int>> checkpoints;
vector<citizen> citizens;
vector<int> answers;

namespace Subtask1 {
    const int N = 1e5 + 10;
    vector<edge> g[N];
    int depth[N], pre[N], T;
    int inx[N] = {};
    ll C;
    void precalc(int s, int p) {
        pre[s] = p;
        for(auto [to, i] : g[s]) {
            if(to == p) continue;
            depth[to] = depth[s] + 1;
            inx[to] = i;
            precalc(to, s);
        }
    }
    void init() {
        int koll = 0;
        for(auto [u, v] : edges) {
            g[u].push_back({v, koll});
            g[v].push_back({u, koll});
            koll++;
        }
        precalc(1, 1);
        for(citizen cit : citizens) {
            set<int> ee;
            int u = cit.s, v = cit.t;
            while(u != v) {
                if(depth[u] >= depth[v]) {
                    ee.insert(inx[u]);
                    u = pre[u];
                } else {
                    ee.insert(inx[v]);
                    v = pre[v];
                }
            }
            set<ll> st;
            ll sum = 0, k = 0;
            for(auto [p, c] : checkpoints) {
                if(!ee.count(p)) continue;
                st.insert(c);
                sum += c;
                if(sum > cit.y) {
                    k++;
                    sum -= *(--st.end());
                    st.erase(--st.end());
                }
            }
            answers[cit.inx] = (cit.x < k ? -1 : cit.x - k);
        }
    }
};

namespace Subtask2 {
    const int N = 1e5 + 10;
    vector<int> g[N];
    int tin[N], tout[N], anc[N][17], T;
    int f[N] = {};
    int cnt[N] = {};
    ll C;
    void precalc(int s, int p) {
        tin[s] = T++;
        anc[s][0] = p;
        cnt[s] = cnt[p] + f[s]; 
        for(int i = 1; i < 17; i++) 
            anc[s][i] = anc[anc[s][i - 1]][i - 1];
        for(int to : g[s]) {
            if(to == p) continue;
            precalc(to, s);
        }
        tout[s] = T++;
    }
    bool up(int u, int v) {
        return tin[u] <= tin[v] && tout[u] >= tout[v];
    }
    int lca(int u, int v) {
        if(up(u, v)) return u;
        if(up(v, u)) return v;
        for(int i = 16; i >= 0; i--) {
            if(!up(anc[u][i], v)) u = anc[u][i];
        }
        return anc[u][0];
    }
    void init() {
        for(auto [u, v] : edges) {
            g[u].push_back(v);
            g[v].push_back(u);
        }
        precalc(1, 1);
        
        for(auto [p, c] : checkpoints) {
            auto [u, v] = edges[p];
            if(tin[u] > tin[v]) swap(u, v);
            f[v]++;
            C = c;
        }
        precalc(1, 1);
        
        for(citizen c : citizens) {
            int u = lca(c.s, c.t);
            int k = cnt[c.s] + cnt[c.t] - 2 * cnt[u];
            if(C == 0) answers[c.inx] = c.x;
            else {
                int ans = c.x - max(k - c.y / C, 0ll);
                if(ans < 0) ans = -1;
                answers[c.inx] = ans;
            }
            // cout << c.inx << ' ' << ans << '\n';
        }
    } 
};

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        edges.push_back({u, v});
    }
    for(int i = 0; i < m; i++) {
        int p, c;
        cin >> p >> c;
        p--;
        checkpoints.push_back({p, c});
    }
    for(int i = 0; i < q; i++) {
        citizen s;
        cin >> s.s >> s.t >> s.x >> s.y;
        s.inx = i;
        citizens.push_back(s);
    }
    answers.resize(q);
    if(n <= 2000) {
        Subtask1::init();
    } else {
        Subtask2::init();
    }
    for(int c : answers) 
        cout << c << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 40 ms 5204 KB Output is correct
6 Correct 64 ms 5324 KB Output is correct
7 Correct 48 ms 5264 KB Output is correct
8 Correct 69 ms 5316 KB Output is correct
9 Correct 70 ms 5304 KB Output is correct
10 Correct 69 ms 5312 KB Output is correct
11 Correct 82 ms 5320 KB Output is correct
12 Correct 70 ms 5332 KB Output is correct
13 Correct 412 ms 5592 KB Output is correct
14 Correct 421 ms 5564 KB Output is correct
15 Correct 255 ms 5332 KB Output is correct
16 Correct 218 ms 5300 KB Output is correct
17 Correct 197 ms 5332 KB Output is correct
18 Correct 248 ms 5400 KB Output is correct
19 Correct 35 ms 5256 KB Output is correct
20 Correct 30 ms 5316 KB Output is correct
21 Correct 30 ms 5204 KB Output is correct
22 Correct 31 ms 5320 KB Output is correct
23 Correct 125 ms 5364 KB Output is correct
24 Correct 132 ms 5332 KB Output is correct
25 Correct 121 ms 5364 KB Output is correct
26 Correct 40 ms 5204 KB Output is correct
27 Correct 31 ms 5204 KB Output is correct
28 Correct 39 ms 5316 KB Output is correct
29 Correct 25 ms 5332 KB Output is correct
30 Correct 71 ms 5332 KB Output is correct
31 Correct 69 ms 5204 KB Output is correct
32 Correct 70 ms 5308 KB Output is correct
33 Correct 289 ms 5596 KB Output is correct
34 Correct 295 ms 5608 KB Output is correct
35 Correct 295 ms 5548 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 71 ms 5308 KB Output is correct
3 Correct 69 ms 5308 KB Output is correct
4 Correct 68 ms 5308 KB Output is correct
5 Correct 103 ms 24752 KB Output is correct
6 Correct 95 ms 22556 KB Output is correct
7 Correct 108 ms 23880 KB Output is correct
8 Correct 96 ms 22660 KB Output is correct
9 Correct 84 ms 22348 KB Output is correct
10 Correct 112 ms 26916 KB Output is correct
11 Correct 124 ms 26956 KB Output is correct
12 Correct 113 ms 27028 KB Output is correct
13 Correct 111 ms 26976 KB Output is correct
14 Correct 115 ms 26908 KB Output is correct
15 Correct 177 ms 31948 KB Output is correct
16 Correct 126 ms 32348 KB Output is correct
17 Correct 128 ms 31756 KB Output is correct
18 Correct 128 ms 27304 KB Output is correct
19 Correct 139 ms 27324 KB Output is correct
20 Correct 123 ms 27496 KB Output is correct
21 Correct 97 ms 26640 KB Output is correct
22 Correct 106 ms 26772 KB Output is correct
23 Correct 95 ms 26712 KB Output is correct
24 Correct 97 ms 26900 KB Output is correct
25 Correct 110 ms 27424 KB Output is correct
26 Correct 114 ms 27332 KB Output is correct
27 Correct 114 ms 27372 KB Output is correct
28 Correct 112 ms 26828 KB Output is correct
29 Correct 121 ms 26788 KB Output is correct
30 Correct 109 ms 27036 KB Output is correct
31 Correct 108 ms 27072 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 302 ms 5596 KB Output is correct
3 Correct 293 ms 5604 KB Output is correct
4 Correct 332 ms 5620 KB Output is correct
5 Incorrect 70 ms 28516 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 40 ms 5204 KB Output is correct
6 Correct 64 ms 5324 KB Output is correct
7 Correct 48 ms 5264 KB Output is correct
8 Correct 69 ms 5316 KB Output is correct
9 Correct 70 ms 5304 KB Output is correct
10 Correct 69 ms 5312 KB Output is correct
11 Correct 82 ms 5320 KB Output is correct
12 Correct 70 ms 5332 KB Output is correct
13 Correct 412 ms 5592 KB Output is correct
14 Correct 421 ms 5564 KB Output is correct
15 Correct 255 ms 5332 KB Output is correct
16 Correct 218 ms 5300 KB Output is correct
17 Correct 197 ms 5332 KB Output is correct
18 Correct 248 ms 5400 KB Output is correct
19 Correct 35 ms 5256 KB Output is correct
20 Correct 30 ms 5316 KB Output is correct
21 Correct 30 ms 5204 KB Output is correct
22 Correct 31 ms 5320 KB Output is correct
23 Correct 125 ms 5364 KB Output is correct
24 Correct 132 ms 5332 KB Output is correct
25 Correct 121 ms 5364 KB Output is correct
26 Correct 40 ms 5204 KB Output is correct
27 Correct 31 ms 5204 KB Output is correct
28 Correct 39 ms 5316 KB Output is correct
29 Correct 25 ms 5332 KB Output is correct
30 Correct 71 ms 5332 KB Output is correct
31 Correct 69 ms 5204 KB Output is correct
32 Correct 70 ms 5308 KB Output is correct
33 Correct 289 ms 5596 KB Output is correct
34 Correct 295 ms 5608 KB Output is correct
35 Correct 295 ms 5548 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 71 ms 5308 KB Output is correct
38 Correct 69 ms 5308 KB Output is correct
39 Correct 68 ms 5308 KB Output is correct
40 Correct 103 ms 24752 KB Output is correct
41 Correct 95 ms 22556 KB Output is correct
42 Correct 108 ms 23880 KB Output is correct
43 Correct 96 ms 22660 KB Output is correct
44 Correct 84 ms 22348 KB Output is correct
45 Correct 112 ms 26916 KB Output is correct
46 Correct 124 ms 26956 KB Output is correct
47 Correct 113 ms 27028 KB Output is correct
48 Correct 111 ms 26976 KB Output is correct
49 Correct 115 ms 26908 KB Output is correct
50 Correct 177 ms 31948 KB Output is correct
51 Correct 126 ms 32348 KB Output is correct
52 Correct 128 ms 31756 KB Output is correct
53 Correct 128 ms 27304 KB Output is correct
54 Correct 139 ms 27324 KB Output is correct
55 Correct 123 ms 27496 KB Output is correct
56 Correct 97 ms 26640 KB Output is correct
57 Correct 106 ms 26772 KB Output is correct
58 Correct 95 ms 26712 KB Output is correct
59 Correct 97 ms 26900 KB Output is correct
60 Correct 110 ms 27424 KB Output is correct
61 Correct 114 ms 27332 KB Output is correct
62 Correct 114 ms 27372 KB Output is correct
63 Correct 112 ms 26828 KB Output is correct
64 Correct 121 ms 26788 KB Output is correct
65 Correct 109 ms 27036 KB Output is correct
66 Correct 108 ms 27072 KB Output is correct
67 Correct 3 ms 4948 KB Output is correct
68 Correct 302 ms 5596 KB Output is correct
69 Correct 293 ms 5604 KB Output is correct
70 Correct 332 ms 5620 KB Output is correct
71 Incorrect 70 ms 28516 KB Output isn't correct
72 Halted 0 ms 0 KB -