oj.uz

Submission #862023

# Submission time Handle Problem Language Result Execution time Memory
862023 2023-10-17T11:47:55 Z vjudge1 Two Currencies (JOI23_currencies) C++17
100 / 100
 458 ms 67220 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 2 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 14940 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 5 ms 14940 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 5 ms 14940 KB Output is correct
13 Correct 5 ms 15196 KB Output is correct
14 Correct 5 ms 15172 KB Output is correct
15 Correct 4 ms 14940 KB Output is correct
16 Correct 5 ms 14940 KB Output is correct
17 Correct 5 ms 14940 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 6 ms 14940 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 15096 KB Output is correct
25 Correct 4 ms 14940 KB Output is correct
26 Correct 5 ms 15124 KB Output is correct
27 Correct 5 ms 14936 KB Output is correct
28 Correct 5 ms 14940 KB Output is correct
29 Correct 4 ms 14940 KB Output is correct
30 Correct 3 ms 10840 KB Output is correct
31 Correct 3 ms 10844 KB Output is correct
32 Correct 4 ms 11008 KB Output is correct
33 Correct 6 ms 15196 KB Output is correct
34 Correct 5 ms 15196 KB Output is correct
35 Correct 5 ms 15196 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 3 ms 11004 KB Output is correct
5 Correct 77 ms 16724 KB Output is correct
6 Correct 78 ms 15192 KB Output is correct
7 Correct 80 ms 15696 KB Output is correct
8 Correct 87 ms 15872 KB Output is correct
9 Correct 65 ms 15700 KB Output is correct
10 Correct 91 ms 16644 KB Output is correct
11 Correct 98 ms 16724 KB Output is correct
12 Correct 92 ms 16736 KB Output is correct
13 Correct 95 ms 16832 KB Output is correct
14 Correct 90 ms 16720 KB Output is correct
15 Correct 137 ms 24916 KB Output is correct
16 Correct 128 ms 25556 KB Output is correct
17 Correct 131 ms 24464 KB Output is correct
18 Correct 111 ms 16464 KB Output is correct
19 Correct 148 ms 16352 KB Output is correct
20 Correct 127 ms 16816 KB Output is correct
21 Correct 78 ms 16836 KB Output is correct
22 Correct 77 ms 16836 KB Output is correct
23 Correct 73 ms 16928 KB Output is correct
24 Correct 75 ms 16840 KB Output is correct
25 Correct 98 ms 16616 KB Output is correct
26 Correct 98 ms 16420 KB Output is correct
27 Correct 96 ms 16336 KB Output is correct
28 Correct 79 ms 16724 KB Output is correct
29 Correct 81 ms 16720 KB Output is correct
30 Correct 116 ms 16720 KB Output is correct
31 Correct 89 ms 16660 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 5 ms 15292 KB Output is correct
3 Correct 5 ms 15196 KB Output is correct
4 Correct 5 ms 15196 KB Output is correct
5 Correct 188 ms 51172 KB Output is correct
6 Correct 188 ms 44784 KB Output is correct
7 Correct 276 ms 58476 KB Output is correct
8 Correct 385 ms 67220 KB Output is correct
9 Correct 384 ms 66716 KB Output is correct
10 Correct 394 ms 66844 KB Output is correct
11 Correct 317 ms 66236 KB Output is correct
12 Correct 316 ms 66544 KB Output is correct
13 Correct 316 ms 66160 KB Output is correct
14 Correct 207 ms 66720 KB Output is correct
15 Correct 184 ms 66680 KB Output is correct
16 Correct 232 ms 66896 KB Output is correct
17 Correct 237 ms 66696 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 2 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 14940 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 5 ms 14940 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 5 ms 14940 KB Output is correct
13 Correct 5 ms 15196 KB Output is correct
14 Correct 5 ms 15172 KB Output is correct
15 Correct 4 ms 14940 KB Output is correct
16 Correct 5 ms 14940 KB Output is correct
17 Correct 5 ms 14940 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 6 ms 14940 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 15096 KB Output is correct
25 Correct 4 ms 14940 KB Output is correct
26 Correct 5 ms 15124 KB Output is correct
27 Correct 5 ms 14936 KB Output is correct
28 Correct 5 ms 14940 KB Output is correct
29 Correct 4 ms 14940 KB Output is correct
30 Correct 3 ms 10840 KB Output is correct
31 Correct 3 ms 10844 KB Output is correct
32 Correct 4 ms 11008 KB Output is correct
33 Correct 6 ms 15196 KB Output is correct
34 Correct 5 ms 15196 KB Output is correct
35 Correct 5 ms 15196 KB Output is correct
36 Correct 2 ms 10844 KB Output is correct
37 Correct 3 ms 10844 KB Output is correct
38 Correct 3 ms 10844 KB Output is correct
39 Correct 3 ms 11004 KB Output is correct
40 Correct 77 ms 16724 KB Output is correct
41 Correct 78 ms 15192 KB Output is correct
42 Correct 80 ms 15696 KB Output is correct
43 Correct 87 ms 15872 KB Output is correct
44 Correct 65 ms 15700 KB Output is correct
45 Correct 91 ms 16644 KB Output is correct
46 Correct 98 ms 16724 KB Output is correct
47 Correct 92 ms 16736 KB Output is correct
48 Correct 95 ms 16832 KB Output is correct
49 Correct 90 ms 16720 KB Output is correct
50 Correct 137 ms 24916 KB Output is correct
51 Correct 128 ms 25556 KB Output is correct
52 Correct 131 ms 24464 KB Output is correct
53 Correct 111 ms 16464 KB Output is correct
54 Correct 148 ms 16352 KB Output is correct
55 Correct 127 ms 16816 KB Output is correct
56 Correct 78 ms 16836 KB Output is correct
57 Correct 77 ms 16836 KB Output is correct
58 Correct 73 ms 16928 KB Output is correct
59 Correct 75 ms 16840 KB Output is correct
60 Correct 98 ms 16616 KB Output is correct
61 Correct 98 ms 16420 KB Output is correct
62 Correct 96 ms 16336 KB Output is correct
63 Correct 79 ms 16724 KB Output is correct
64 Correct 81 ms 16720 KB Output is correct
65 Correct 116 ms 16720 KB Output is correct
66 Correct 89 ms 16660 KB Output is correct
67 Correct 2 ms 14940 KB Output is correct
68 Correct 5 ms 15292 KB Output is correct
69 Correct 5 ms 15196 KB Output is correct
70 Correct 5 ms 15196 KB Output is correct
71 Correct 188 ms 51172 KB Output is correct
72 Correct 188 ms 44784 KB Output is correct
73 Correct 276 ms 58476 KB Output is correct
74 Correct 385 ms 67220 KB Output is correct
75 Correct 384 ms 66716 KB Output is correct
76 Correct 394 ms 66844 KB Output is correct
77 Correct 317 ms 66236 KB Output is correct
78 Correct 316 ms 66544 KB Output is correct
79 Correct 316 ms 66160 KB Output is correct
80 Correct 207 ms 66720 KB Output is correct
81 Correct 184 ms 66680 KB Output is correct
82 Correct 232 ms 66896 KB Output is correct
83 Correct 237 ms 66696 KB Output is correct
84 Correct 168 ms 55004 KB Output is correct
85 Correct 150 ms 49300 KB Output is correct
86 Correct 126 ms 39364 KB Output is correct
87 Correct 206 ms 57916 KB Output is correct
88 Correct 213 ms 57880 KB Output is correct
89 Correct 219 ms 57984 KB Output is correct
90 Correct 222 ms 57788 KB Output is correct
91 Correct 218 ms 57684 KB Output is correct
92 Correct 458 ms 63160 KB Output is correct
93 Correct 429 ms 65364 KB Output is correct
94 Correct 362 ms 57620 KB Output is correct
95 Correct 337 ms 57680 KB Output is correct
96 Correct 359 ms 57528 KB Output is correct
97 Correct 401 ms 57428 KB Output is correct
98 Correct 201 ms 57812 KB Output is correct
99 Correct 214 ms 58000 KB Output is correct
100 Correct 210 ms 58288 KB Output is correct
101 Correct 214 ms 57988 KB Output is correct
102 Correct 278 ms 57296 KB Output is correct
103 Correct 269 ms 57336 KB Output is correct
104 Correct 271 ms 57292 KB Output is correct
105 Correct 171 ms 57192 KB Output is correct
106 Correct 186 ms 57812 KB Output is correct
107 Correct 175 ms 57716 KB Output is correct
108 Correct 169 ms 57836 KB Output is correct