oj.uz

Submission #803031

# Submission time Handle Problem Language Result Execution time Memory
803031 2023-08-02T19:41:04 Z lukameladze Two Currencies (JOI23_currencies) C++17
100 / 100
 3328 ms 163760 KB 
# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int n, m, q, a[N], b[N], edge[N], par[N][20], idx[N], c[N], in[N], out[N], tin, cur;
vector <pii> v[N];
int le_[30 * N], ri_[30 * N], root[N]; 
pii tree[30 * N];
void dfs(int a, int p) {
    par[a][0] = p;
    for (int i = 1; i <= 18; i++) {
        par[a][i] = par[par[a][i - 1]][i - 1];
    }
    in[a] = ++tin;
    for (pii sth : v[a]) {
        int to = sth.f, id = sth.s;
        if (to == p) continue;
        edge[id] = to; // {a, to}
        dfs(to, a);
    }
    out[a] = tin;
}
int upper(int a, int b) {
    return (in[a] <= in[b] && out[a] >= out[b]);
}
int lca(int a, int b) {
    if (upper(a, b)) return a;
    for (int i = 18; i >= 0; i--) {
        if (par[a][i] && !upper(par[a][i], b)) a = par[a][i];
    }
    return par[a][0];
}
pii merge(pii a, pii b) {
    return {a.f + b.f, a.s + b.s};
}
void build(int node, int le, int ri) {
    if (le == ri) {
        tree[node] = {0, 0};
        return ;
    }
    int mid = (le + ri) / 2;
    le_[node] = ++cur; ri_[node] = ++cur;
    build(le_[node], le, mid);
    build(ri_[node], mid + 1, ri);
    tree[node] = merge(tree[le_[node]], tree[ri_[node]]);
}
void update(int node, int le, int ri, int idx, int val) {
    if (le > idx || ri < idx) return ;
    if (le == ri) {
        tree[cur] = {tree[node].f + val, tree[node].s + ((val > 0) ? 1 : -1)};
        return ;
    }
    int mid = (le + ri) / 2;
    int x = cur;
    le_[x] = le_[node]; ri_[x] = ri_[node];
    if (idx <= mid) le_[x] = ++cur;
    else ri_[x] = ++cur;
    update(le_[node], le, mid, idx, val); // node
    update(ri_[node], mid + 1, ri, idx, val); //node
    tree[x] = merge(tree[le_[x]], tree[ri_[x]]);
}
pii getans(int node, int le, int ri, int start, int end) {
    if (le > end || ri < start) return {0, 0};
    if (le >= start && ri <= end) return tree[node];
    int mid = (le + ri) / 2;
    return merge(getans(le_[node], le, mid, start, end), getans(ri_[node], mid + 1, ri, start, end));
}
signed main() {
    cin>>n>>m>>q;
    for (int i = 1; i <= n - 1; i++) {
        cin>>a[i]>>b[i];
        v[a[i]].pb({b[i], i}); v[b[i]].pb({a[i], i});
    }
    dfs(1, 0);
    vector <pii> vec;
    for (int i = 1; i <= m; i++) {
        cin>>idx[i]>>c[i];
        idx[i] = edge[idx[i]]; // {a, to}
        vec.pb({c[i], idx[i]});
    }
    vec.pb({0, 0});
    sort(vec.begin(), vec.end());
    root[0] = 1; cur = 1;
    build(1, 1, n);
    for (int i = 1; i < (int)vec.size(); i++) {
        root[i] = ++cur;
        //cout<<"update "<<in[vec[i].s]<<" "<<out[vec[i].s]<<" "<<vec[i].f<<"\n";
        update(root[i - 1], 1, n, in[vec[i].s], vec[i].f);
        int proot = root[i];
        if (out[vec[i].s] + 1 <= n) {
            root[i] = ++cur;
            update(proot, 1, n, out[vec[i].s] + 1, -vec[i].f);
        }
        /*
        for (int j = 1; j <= n; j++) {
            cout<<getans(root[i], 1, n, 1, in[j]).s<<" ";
        }
        cout<<"\n";
        */
    }
    while (q--) {
        int s, t, x, y;
        cin>>s>>t>>x>>y;  int lc = lca(s, t);
        int l = 0, r = (int)vec.size() - 1, ans = -1;
        while (l <= r) {
            int mid = (l + r) / 2;
            int silver = getans(root[mid], 1, n, 1, in[s]).f + getans(root[mid], 1, n, 1, in[t]).f - 2 * getans(root[mid], 1, n, 1, in[lc]).f;
            if (silver <= y) {
                ans = mid; l = mid + 1;
            } else r = mid - 1;
        }
        if (ans == (int)vec.size() - 1) {
            cout<<x<<"\n"; continue;
        }
        int sz = (int)vec.size() - 1;
        int rem = getans(root[sz], 1, n, 1, in[s]).s + getans(root[sz], 1, n, 1, in[t]).s - 2 * getans(root[sz], 1,n, 1, in[lc]).s;
        rem -= (getans(root[ans], 1, n, 1, in[s]).s + getans(root[ans], 1, n, 1, in[t]).s - 2 * getans(root[ans], 1, n, 1, in[lc]).s);
        if (rem > x) cout<<-1<<"\n";
        else cout<<(x - rem)<<"\n"; 
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 11 ms 9428 KB Output is correct
6 Correct 15 ms 9604 KB Output is correct
7 Correct 13 ms 8916 KB Output is correct
8 Correct 15 ms 9760 KB Output is correct
9 Correct 15 ms 9672 KB Output is correct
10 Correct 19 ms 9672 KB Output is correct
11 Correct 17 ms 9680 KB Output is correct
12 Correct 16 ms 9684 KB Output is correct
13 Correct 15 ms 9124 KB Output is correct
14 Correct 16 ms 9328 KB Output is correct
15 Correct 20 ms 9652 KB Output is correct
16 Correct 16 ms 9684 KB Output is correct
17 Correct 16 ms 9792 KB Output is correct
18 Correct 17 ms 9744 KB Output is correct
19 Correct 15 ms 9684 KB Output is correct
20 Correct 17 ms 9684 KB Output is correct
21 Correct 22 ms 9676 KB Output is correct
22 Correct 16 ms 9684 KB Output is correct
23 Correct 21 ms 9684 KB Output is correct
24 Correct 19 ms 9684 KB Output is correct
25 Correct 22 ms 9684 KB Output is correct
26 Correct 14 ms 9684 KB Output is correct
27 Correct 14 ms 9684 KB Output is correct
28 Correct 15 ms 9760 KB Output is correct
29 Correct 13 ms 9684 KB Output is correct
30 Correct 19 ms 9812 KB Output is correct
31 Correct 17 ms 9672 KB Output is correct
32 Correct 16 ms 9756 KB Output is correct
33 Correct 15 ms 9096 KB Output is correct
34 Correct 16 ms 9036 KB Output is correct
35 Correct 15 ms 9044 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 20 ms 9556 KB Output is correct
3 Correct 18 ms 9760 KB Output is correct
4 Correct 16 ms 9684 KB Output is correct
5 Correct 1572 ms 145936 KB Output is correct
6 Correct 2023 ms 124116 KB Output is correct
7 Correct 1838 ms 112084 KB Output is correct
8 Correct 1384 ms 109408 KB Output is correct
9 Correct 1590 ms 115204 KB Output is correct
10 Correct 2883 ms 158612 KB Output is correct
11 Correct 2723 ms 158616 KB Output is correct
12 Correct 2972 ms 158556 KB Output is correct
13 Correct 2731 ms 158588 KB Output is correct
14 Correct 2585 ms 158664 KB Output is correct
15 Correct 2776 ms 157156 KB Output is correct
16 Correct 2656 ms 163760 KB Output is correct
17 Correct 2562 ms 115540 KB Output is correct
18 Correct 2877 ms 159192 KB Output is correct
19 Correct 2811 ms 159120 KB Output is correct
20 Correct 2872 ms 159248 KB Output is correct
21 Correct 2246 ms 157548 KB Output is correct
22 Correct 2137 ms 157776 KB Output is correct
23 Correct 2095 ms 157704 KB Output is correct
24 Correct 2123 ms 157744 KB Output is correct
25 Correct 1554 ms 156916 KB Output is correct
26 Correct 1450 ms 158408 KB Output is correct
27 Correct 1485 ms 159908 KB Output is correct
28 Correct 1027 ms 158480 KB Output is correct
29 Correct 1022 ms 158508 KB Output is correct
30 Correct 1272 ms 158724 KB Output is correct
31 Correct 1301 ms 158736 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 16 ms 9096 KB Output is correct
3 Correct 15 ms 9032 KB Output is correct
4 Correct 15 ms 9044 KB Output is correct
5 Correct 1340 ms 84344 KB Output is correct
6 Correct 1206 ms 75152 KB Output is correct
7 Correct 1698 ms 84468 KB Output is correct
8 Correct 2400 ms 108224 KB Output is correct
9 Correct 2376 ms 108244 KB Output is correct
10 Correct 2464 ms 108300 KB Output is correct
11 Correct 1861 ms 108792 KB Output is correct
12 Correct 1818 ms 107268 KB Output is correct
13 Correct 1921 ms 108724 KB Output is correct
14 Correct 1361 ms 108176 KB Output is correct
15 Correct 1216 ms 108108 KB Output is correct
16 Correct 1617 ms 108248 KB Output is correct
17 Correct 1549 ms 108284 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 11 ms 9428 KB Output is correct
6 Correct 15 ms 9604 KB Output is correct
7 Correct 13 ms 8916 KB Output is correct
8 Correct 15 ms 9760 KB Output is correct
9 Correct 15 ms 9672 KB Output is correct
10 Correct 19 ms 9672 KB Output is correct
11 Correct 17 ms 9680 KB Output is correct
12 Correct 16 ms 9684 KB Output is correct
13 Correct 15 ms 9124 KB Output is correct
14 Correct 16 ms 9328 KB Output is correct
15 Correct 20 ms 9652 KB Output is correct
16 Correct 16 ms 9684 KB Output is correct
17 Correct 16 ms 9792 KB Output is correct
18 Correct 17 ms 9744 KB Output is correct
19 Correct 15 ms 9684 KB Output is correct
20 Correct 17 ms 9684 KB Output is correct
21 Correct 22 ms 9676 KB Output is correct
22 Correct 16 ms 9684 KB Output is correct
23 Correct 21 ms 9684 KB Output is correct
24 Correct 19 ms 9684 KB Output is correct
25 Correct 22 ms 9684 KB Output is correct
26 Correct 14 ms 9684 KB Output is correct
27 Correct 14 ms 9684 KB Output is correct
28 Correct 15 ms 9760 KB Output is correct
29 Correct 13 ms 9684 KB Output is correct
30 Correct 19 ms 9812 KB Output is correct
31 Correct 17 ms 9672 KB Output is correct
32 Correct 16 ms 9756 KB Output is correct
33 Correct 15 ms 9096 KB Output is correct
34 Correct 16 ms 9036 KB Output is correct
35 Correct 15 ms 9044 KB Output is correct
36 Correct 4 ms 7380 KB Output is correct
37 Correct 20 ms 9556 KB Output is correct
38 Correct 18 ms 9760 KB Output is correct
39 Correct 16 ms 9684 KB Output is correct
40 Correct 1572 ms 145936 KB Output is correct
41 Correct 2023 ms 124116 KB Output is correct
42 Correct 1838 ms 112084 KB Output is correct
43 Correct 1384 ms 109408 KB Output is correct
44 Correct 1590 ms 115204 KB Output is correct
45 Correct 2883 ms 158612 KB Output is correct
46 Correct 2723 ms 158616 KB Output is correct
47 Correct 2972 ms 158556 KB Output is correct
48 Correct 2731 ms 158588 KB Output is correct
49 Correct 2585 ms 158664 KB Output is correct
50 Correct 2776 ms 157156 KB Output is correct
51 Correct 2656 ms 163760 KB Output is correct
52 Correct 2562 ms 115540 KB Output is correct
53 Correct 2877 ms 159192 KB Output is correct
54 Correct 2811 ms 159120 KB Output is correct
55 Correct 2872 ms 159248 KB Output is correct
56 Correct 2246 ms 157548 KB Output is correct
57 Correct 2137 ms 157776 KB Output is correct
58 Correct 2095 ms 157704 KB Output is correct
59 Correct 2123 ms 157744 KB Output is correct
60 Correct 1554 ms 156916 KB Output is correct
61 Correct 1450 ms 158408 KB Output is correct
62 Correct 1485 ms 159908 KB Output is correct
63 Correct 1027 ms 158480 KB Output is correct
64 Correct 1022 ms 158508 KB Output is correct
65 Correct 1272 ms 158724 KB Output is correct
66 Correct 1301 ms 158736 KB Output is correct
67 Correct 4 ms 7380 KB Output is correct
68 Correct 16 ms 9096 KB Output is correct
69 Correct 15 ms 9032 KB Output is correct
70 Correct 15 ms 9044 KB Output is correct
71 Correct 1340 ms 84344 KB Output is correct
72 Correct 1206 ms 75152 KB Output is correct
73 Correct 1698 ms 84468 KB Output is correct
74 Correct 2400 ms 108224 KB Output is correct
75 Correct 2376 ms 108244 KB Output is correct
76 Correct 2464 ms 108300 KB Output is correct
77 Correct 1861 ms 108792 KB Output is correct
78 Correct 1818 ms 107268 KB Output is correct
79 Correct 1921 ms 108724 KB Output is correct
80 Correct 1361 ms 108176 KB Output is correct
81 Correct 1216 ms 108108 KB Output is correct
82 Correct 1617 ms 108248 KB Output is correct
83 Correct 1549 ms 108284 KB Output is correct
84 Correct 1550 ms 143324 KB Output is correct
85 Correct 1778 ms 120940 KB Output is correct
86 Correct 1559 ms 91720 KB Output is correct
87 Correct 3066 ms 158568 KB Output is correct
88 Correct 3026 ms 158536 KB Output is correct
89 Correct 3052 ms 158572 KB Output is correct
90 Correct 3050 ms 158624 KB Output is correct
91 Correct 2995 ms 158580 KB Output is correct
92 Correct 3090 ms 128368 KB Output is correct
93 Correct 2859 ms 117256 KB Output is correct
94 Correct 3328 ms 159140 KB Output is correct
95 Correct 3284 ms 159072 KB Output is correct
96 Correct 3161 ms 158848 KB Output is correct
97 Correct 3215 ms 159156 KB Output is correct
98 Correct 2461 ms 157824 KB Output is correct
99 Correct 2603 ms 157716 KB Output is correct
100 Correct 2452 ms 157652 KB Output is correct
101 Correct 2327 ms 157684 KB Output is correct
102 Correct 2061 ms 160000 KB Output is correct
103 Correct 2103 ms 159996 KB Output is correct
104 Correct 2341 ms 159900 KB Output is correct
105 Correct 1344 ms 158632 KB Output is correct
106 Correct 1184 ms 158608 KB Output is correct
107 Correct 1435 ms 158544 KB Output is correct
108 Correct 1450 ms 158552 KB Output is correct