oj.uz

Submission #862021

# Submission time Handle Problem Language Result Execution time Memory
862021 2023-10-17T11:45:53 Z sleepntsheep Two Currencies (JOI23_currencies) C++17
100 / 100
 444 ms 70872 KB 
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)

#define N 100005
#define M N*40
#define ALL(x) x.begin(), x.end()

int A[M], L[M], R[M], ALLOC = 1;
ll B[M];

inline int persist1(int a, ll b)
{
    int p = ALLOC++;
    A[p] = a, B[p] = b;
    return p;
}

inline int persist2(int l, int r)
{
    int p = ALLOC++; L[p] = l; R[p] = r;
    A[p] = A[l] + A[r]; B[p] = B[l] + B[r];
    return p;
}

int build(int l, int r)
{
    if (l == r) return persist1(0, 0);
    return persist2(build(l, (l+r)/2), build((l+r)/2+1, r));
}

int upd(int v, int l, int r, int w, int W)
{
    if (l == r) return persist1(A[v] + 1, B[v] + w);
    if (W <= (l+r)/2) return persist2(upd(L[v], l, (l+r)/2, w, W), R[v]);
    return persist2(L[v], upd(R[v], (l+r)/2+1, r, w, W));
}

int cord[N], ne, n, m, q, P[N], J[N], D[N], root[N];
vector<int> mark[N];
vector<pair<int, int>> g[N];

ll qry(int u, int v, int a, int l, int r, ll k)
{
    if (l == r) return min(k, B[u] + B[v] - B[a]*2) / cord[l];
    ll left = B[L[u]] + B[L[v]] - B[L[a]]*2;
    if (k < left) return qry(L[u], L[v], L[a], l, (l+r)/2, k);
    return (A[L[u]]+ A[L[v]]- 2*A[L[a]]) + qry(R[u], R[v], R[a], (l+r)/2+1, r, k - left);
}

inline int find(int u, int d)
{
    while (D[u] > d) u = D[J[u]] >= d ? J[u] : P[u];
    return u;
}

inline int lca(int u, int v)
{
    if (D[u] < D[v]) swap(v, u);
    u = find(u, D[v]);
    while (u != v)
        if (J[u] == J[v]) u = P[u], v = P[v];
        else u = J[u], v = J[v];
    return u;
}

void dfs(int u, int p, int d)
{
    D[u] = d; P[u] = p; J[u] = (D[p] - D[J[p]] == D[J[p]] - D[J[J[p]]]) ? J[J[p]] : p;
    for (auto [v, i] : g[u]) 
    {
        if (v == p) continue;
        root[v] = root[u];
        for (auto w : mark[i]) root[v] = upd(root[v], 0, ne, w, lower_bound(cord, cord+ne, w) - cord);
        dfs(v, u, d+1);
    }
}

int main()
{
    ShinLena;
    cin >> n >> m >> q;
    for (int u, v, i = 1; i < n; ++i) cin >> u >> v, g[u].emplace_back(v, i), g[v].emplace_back(u, i);
    for (int p, c; m--; ) cin >> p >> c, mark[p].push_back(c), cord[ne++] = c;
    sort(cord, cord+ne), ne = unique(cord, cord+ne) - cord - 1;
    J[1] = 1; root[1] = build(0, ne); dfs(1, 1, 1);

    for (ll s, t, gold, silver; q--; )
    {
        cin >> s >> t >> gold >> silver;
        int ps = root[s], pt = root[t], pa = root[lca(s, t)];
        int gone = qry(ps, pt, pa, 0, ne, silver), all = A[ps] + A[pt] - 2*A[pa];

        cout << ((all - gone > gold) ? -1 : gold - (all - gone)) << '\n';
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 2 ms 14940 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 4 ms 15080 KB Output is correct
6 Correct 5 ms 15196 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 15192 KB Output is correct
9 Correct 4 ms 15196 KB Output is correct
10 Correct 5 ms 15024 KB Output is correct
11 Correct 4 ms 15004 KB Output is correct
12 Correct 5 ms 15196 KB Output is correct
13 Correct 5 ms 15144 KB Output is correct
14 Correct 5 ms 15196 KB Output is correct
15 Correct 5 ms 15192 KB Output is correct
16 Correct 5 ms 15448 KB Output is correct
17 Correct 5 ms 15192 KB Output is correct
18 Correct 5 ms 15192 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 4 ms 15144 KB Output is correct
21 Correct 4 ms 15196 KB Output is correct
22 Correct 4 ms 15196 KB Output is correct
23 Correct 4 ms 15148 KB Output is correct
24 Correct 4 ms 15004 KB Output is correct
25 Correct 4 ms 15196 KB Output is correct
26 Correct 5 ms 15000 KB Output is correct
27 Correct 4 ms 15196 KB Output is correct
28 Correct 4 ms 15148 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 3 ms 11052 KB Output is correct
31 Correct 3 ms 10904 KB Output is correct
32 Correct 3 ms 11100 KB Output is correct
33 Correct 5 ms 15196 KB Output is correct
34 Correct 5 ms 15196 KB Output is correct
35 Correct 5 ms 15396 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 3 ms 10840 KB Output is correct
3 Correct 3 ms 10900 KB Output is correct
4 Correct 3 ms 11108 KB Output is correct
5 Correct 77 ms 21048 KB Output is correct
6 Correct 82 ms 20048 KB Output is correct
7 Correct 78 ms 20252 KB Output is correct
8 Correct 69 ms 19540 KB Output is correct
9 Correct 66 ms 19540 KB Output is correct
10 Correct 97 ms 21844 KB Output is correct
11 Correct 109 ms 21844 KB Output is correct
12 Correct 122 ms 21836 KB Output is correct
13 Correct 100 ms 21940 KB Output is correct
14 Correct 92 ms 21956 KB Output is correct
15 Correct 133 ms 30804 KB Output is correct
16 Correct 143 ms 31568 KB Output is correct
17 Correct 134 ms 30184 KB Output is correct
18 Correct 114 ms 21840 KB Output is correct
19 Correct 117 ms 21944 KB Output is correct
20 Correct 128 ms 22052 KB Output is correct
21 Correct 74 ms 21448 KB Output is correct
22 Correct 75 ms 21672 KB Output is correct
23 Correct 74 ms 21516 KB Output is correct
24 Correct 76 ms 21704 KB Output is correct
25 Correct 97 ms 21800 KB Output is correct
26 Correct 91 ms 21784 KB Output is correct
27 Correct 99 ms 21708 KB Output is correct
28 Correct 82 ms 22096 KB Output is correct
29 Correct 83 ms 21844 KB Output is correct
30 Correct 88 ms 21896 KB Output is correct
31 Correct 93 ms 22096 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 5 ms 15192 KB Output is correct
3 Correct 5 ms 15196 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 187 ms 51312 KB Output is correct
6 Correct 167 ms 44628 KB Output is correct
7 Correct 277 ms 58376 KB Output is correct
8 Correct 369 ms 66904 KB Output is correct
9 Correct 378 ms 66680 KB Output is correct
10 Correct 368 ms 66884 KB Output is correct
11 Correct 297 ms 66220 KB Output is correct
12 Correct 317 ms 66256 KB Output is correct
13 Correct 300 ms 66388 KB Output is correct
14 Correct 176 ms 66900 KB Output is correct
15 Correct 175 ms 66644 KB Output is correct
16 Correct 220 ms 66896 KB Output is correct
17 Correct 219 ms 66672 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 1 ms 10844 KB Output is correct
3 Correct 2 ms 14940 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 4 ms 15080 KB Output is correct
6 Correct 5 ms 15196 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 15192 KB Output is correct
9 Correct 4 ms 15196 KB Output is correct
10 Correct 5 ms 15024 KB Output is correct
11 Correct 4 ms 15004 KB Output is correct
12 Correct 5 ms 15196 KB Output is correct
13 Correct 5 ms 15144 KB Output is correct
14 Correct 5 ms 15196 KB Output is correct
15 Correct 5 ms 15192 KB Output is correct
16 Correct 5 ms 15448 KB Output is correct
17 Correct 5 ms 15192 KB Output is correct
18 Correct 5 ms 15192 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 4 ms 15144 KB Output is correct
21 Correct 4 ms 15196 KB Output is correct
22 Correct 4 ms 15196 KB Output is correct
23 Correct 4 ms 15148 KB Output is correct
24 Correct 4 ms 15004 KB Output is correct
25 Correct 4 ms 15196 KB Output is correct
26 Correct 5 ms 15000 KB Output is correct
27 Correct 4 ms 15196 KB Output is correct
28 Correct 4 ms 15148 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 3 ms 11052 KB Output is correct
31 Correct 3 ms 10904 KB Output is correct
32 Correct 3 ms 11100 KB Output is correct
33 Correct 5 ms 15196 KB Output is correct
34 Correct 5 ms 15196 KB Output is correct
35 Correct 5 ms 15396 KB Output is correct
36 Correct 2 ms 11096 KB Output is correct
37 Correct 3 ms 10840 KB Output is correct
38 Correct 3 ms 10900 KB Output is correct
39 Correct 3 ms 11108 KB Output is correct
40 Correct 77 ms 21048 KB Output is correct
41 Correct 82 ms 20048 KB Output is correct
42 Correct 78 ms 20252 KB Output is correct
43 Correct 69 ms 19540 KB Output is correct
44 Correct 66 ms 19540 KB Output is correct
45 Correct 97 ms 21844 KB Output is correct
46 Correct 109 ms 21844 KB Output is correct
47 Correct 122 ms 21836 KB Output is correct
48 Correct 100 ms 21940 KB Output is correct
49 Correct 92 ms 21956 KB Output is correct
50 Correct 133 ms 30804 KB Output is correct
51 Correct 143 ms 31568 KB Output is correct
52 Correct 134 ms 30184 KB Output is correct
53 Correct 114 ms 21840 KB Output is correct
54 Correct 117 ms 21944 KB Output is correct
55 Correct 128 ms 22052 KB Output is correct
56 Correct 74 ms 21448 KB Output is correct
57 Correct 75 ms 21672 KB Output is correct
58 Correct 74 ms 21516 KB Output is correct
59 Correct 76 ms 21704 KB Output is correct
60 Correct 97 ms 21800 KB Output is correct
61 Correct 91 ms 21784 KB Output is correct
62 Correct 99 ms 21708 KB Output is correct
63 Correct 82 ms 22096 KB Output is correct
64 Correct 83 ms 21844 KB Output is correct
65 Correct 88 ms 21896 KB Output is correct
66 Correct 93 ms 22096 KB Output is correct
67 Correct 2 ms 14936 KB Output is correct
68 Correct 5 ms 15192 KB Output is correct
69 Correct 5 ms 15196 KB Output is correct
70 Correct 4 ms 15196 KB Output is correct
71 Correct 187 ms 51312 KB Output is correct
72 Correct 167 ms 44628 KB Output is correct
73 Correct 277 ms 58376 KB Output is correct
74 Correct 369 ms 66904 KB Output is correct
75 Correct 378 ms 66680 KB Output is correct
76 Correct 368 ms 66884 KB Output is correct
77 Correct 297 ms 66220 KB Output is correct
78 Correct 317 ms 66256 KB Output is correct
79 Correct 300 ms 66388 KB Output is correct
80 Correct 176 ms 66900 KB Output is correct
81 Correct 175 ms 66644 KB Output is correct
82 Correct 220 ms 66896 KB Output is correct
83 Correct 219 ms 66672 KB Output is correct
84 Correct 156 ms 59216 KB Output is correct
85 Correct 147 ms 53584 KB Output is correct
86 Correct 116 ms 42764 KB Output is correct
87 Correct 209 ms 62800 KB Output is correct
88 Correct 209 ms 62936 KB Output is correct
89 Correct 212 ms 62792 KB Output is correct
90 Correct 210 ms 62800 KB Output is correct
91 Correct 246 ms 63056 KB Output is correct
92 Correct 422 ms 68884 KB Output is correct
93 Correct 444 ms 70872 KB Output is correct
94 Correct 337 ms 63056 KB Output is correct
95 Correct 331 ms 63396 KB Output is correct
96 Correct 318 ms 63056 KB Output is correct
97 Correct 344 ms 62908 KB Output is correct
98 Correct 170 ms 62668 KB Output is correct
99 Correct 171 ms 62536 KB Output is correct
100 Correct 177 ms 62728 KB Output is correct
101 Correct 167 ms 62660 KB Output is correct
102 Correct 202 ms 62680 KB Output is correct
103 Correct 206 ms 62928 KB Output is correct
104 Correct 205 ms 62672 KB Output is correct
105 Correct 151 ms 63056 KB Output is correct
106 Correct 159 ms 63104 KB Output is correct
107 Correct 152 ms 62960 KB Output is correct
108 Correct 158 ms 62800 KB Output is correct