oj.uz

Submission #792730

# Submission time Handle Problem Language Result Execution time Memory
792730 2023-07-25T08:22:07 Z vjudge1 Two Currencies (JOI23_currencies) C++17
28 / 100
 147 ms 32276 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 tin[N], tout[N], anc[N][17], depth[N], T;
    int inx[N] = {};
    ll C;
    void precalc(int s, int p) {
        tin[s] = T++;
        anc[s][0] = p;
        for(int i = 1; i < 17; i++) 
            anc[s][i] = anc[anc[s][i - 1]][i - 1];
        for(auto [to, i] : g[s]) {
            if(to == p) continue;
            depth[to] = depth[s] + 1;
            inx[to] = i;
            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() {
        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 = anc[u][0];
                } else {
                    ee.insert(inx[v]);
                    v = anc[v][0];
                }
            }
            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);
    Subtask2::init();
    for(int c : answers) 
        cout << c << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5040 KB Output is correct
2 Correct 5 ms 5408 KB Output is correct
3 Correct 4 ms 5428 KB Output is correct
4 Correct 4 ms 5460 KB Output is correct
5 Correct 112 ms 24704 KB Output is correct
6 Correct 95 ms 22552 KB Output is correct
7 Correct 94 ms 23860 KB Output is correct
8 Correct 90 ms 22712 KB Output is correct
9 Correct 81 ms 22412 KB Output is correct
10 Correct 118 ms 26940 KB Output is correct
11 Correct 147 ms 26964 KB Output is correct
12 Correct 144 ms 27040 KB Output is correct
13 Correct 116 ms 26948 KB Output is correct
14 Correct 118 ms 27008 KB Output is correct
15 Correct 145 ms 32060 KB Output is correct
16 Correct 139 ms 32276 KB Output is correct
17 Correct 137 ms 31668 KB Output is correct
18 Correct 123 ms 27308 KB Output is correct
19 Correct 127 ms 27408 KB Output is correct
20 Correct 124 ms 27456 KB Output is correct
21 Correct 99 ms 26648 KB Output is correct
22 Correct 106 ms 26772 KB Output is correct
23 Correct 97 ms 26772 KB Output is correct
24 Correct 102 ms 26816 KB Output is correct
25 Correct 110 ms 27420 KB Output is correct
26 Correct 115 ms 27412 KB Output is correct
27 Correct 119 ms 27296 KB Output is correct
28 Correct 116 ms 26872 KB Output is correct
29 Correct 110 ms 26876 KB Output is correct
30 Correct 111 ms 27064 KB Output is correct
31 Correct 112 ms 27032 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -