oj.uz

Submission #861900

# Submission time Handle Problem Language Result Execution time Memory
861900 2023-10-17T07:13:03 Z sleepntsheep Two Currencies (JOI23_currencies) C++17
100 / 100
 563 ms 126920 KB 
#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#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 ALL(x) x.begin(), x.end()

struct persist
{
    int a; ll b;
    persist *l, *r;
    persist(int a0, ll b0) : a(a0), b(b0), l(nullptr), r(nullptr) {}
    persist(persist *l0, persist *r0) : a((l0?l0->a:0) + (r0?r0->a:0)), b((l0?l0->b:0) + (r0?r0->b:0)), l(l0), r(r0) {}
    ~persist() {if (l) delete l; if (r) delete r;}
};

persist *build(int l, int r)
{
    if (l == r) return new persist(0, 0);
    return new persist(build(l, (l+r)/2), build((l+r)/2+1, r));
}

persist *upd(persist *v, int l, int r, ll w, int W)
{
    if (l == r) return new persist(v->a + 1, v->b + w);
    if (W <= (l+r)/2) return new persist(upd(v->l, l, (l+r)/2, w, W), v->r);
    return new persist(v->l, upd(v->r, (l+r)/2+1, r, w, W));
}

vector<ll> silver_cord;

ll qry(persist *u, persist *v, persist *a, int l, int r, ll k)
{
    if (l == r)
        return min(k, u->b + v->b - 2*a->b) / silver_cord[l];
    ll left = u->l->b + v->l->b - a->l->b * 2;
    if (k < left) return qry(u->l, v->l, a->l, l, (l+r)/2, k);
    return (u->l->a + v->l->a - a->l->a * 2) + qry(u->r, v->r, a->r, (l+r)/2+1, r, k - left);
}

inline ll qry_count(persist *u, persist *v, persist *a) { return 1ll * u->a + v->a - a->a * 2ll; }

int n, m, q, P[17][N], dep[N], ne;
vector<int> mark[N];
vector<pair<int, int>> g[N];
persist *root[N];

inline int lca(int u, int v)
{
    if (dep[u] < dep[v]) swap(v, u);
    int dt = dep[u] - dep[v];
    for (int j = 17; j--;) if (dt & (1 << j)) u = P[j][u];
    if (u == v) return u;
    for (int j = 17; j--;) if (P[j][u] != P[j][v]) u = P[j][u], v = P[j][v];
    return P[0][u];
}

void dfs(int u, int p, int d)
{
    dep[u] = d; P[0][u] = p; for (int j = 1; j < 17; ++j) P[j][u] = P[j-1][P[j-1][u]];
    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(ALL(silver_cord), w) - silver_cord.begin());
        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), silver_cord.push_back(c);

    sort(ALL(silver_cord)); silver_cord.erase(unique(ALL(silver_cord)), silver_cord.end()); ne = silver_cord.size() - 1;

    root[1] = build(0, ne); dfs(1, 1, 1);

    for (ll s, t, gold, silver; q--; )
    {
        cin >> s >> t >> gold >> silver;
        persist *ps = root[s], *pt = root[t], *pa = root[lca(s, t)];
        int gone = qry(ps, pt, pa, 0, ne, silver), all = qry_count(ps, pt, 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 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 5 ms 13980 KB Output is correct
6 Correct 5 ms 14204 KB Output is correct
7 Correct 4 ms 13676 KB Output is correct
8 Correct 5 ms 14172 KB Output is correct
9 Correct 5 ms 14172 KB Output is correct
10 Correct 5 ms 14168 KB Output is correct
11 Correct 5 ms 14172 KB Output is correct
12 Correct 5 ms 14204 KB Output is correct
13 Correct 5 ms 14424 KB Output is correct
14 Correct 5 ms 14428 KB Output is correct
15 Correct 5 ms 14172 KB Output is correct
16 Correct 5 ms 14172 KB Output is correct
17 Correct 5 ms 14172 KB Output is correct
18 Correct 5 ms 14172 KB Output is correct
19 Correct 5 ms 14172 KB Output is correct
20 Correct 5 ms 14196 KB Output is correct
21 Correct 5 ms 14172 KB Output is correct
22 Correct 5 ms 14172 KB Output is correct
23 Correct 5 ms 14172 KB Output is correct
24 Correct 5 ms 14172 KB Output is correct
25 Correct 5 ms 14172 KB Output is correct
26 Correct 5 ms 14168 KB Output is correct
27 Correct 5 ms 14172 KB Output is correct
28 Correct 5 ms 14172 KB Output is correct
29 Correct 5 ms 14172 KB Output is correct
30 Correct 3 ms 12928 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12988 KB Output is correct
33 Correct 5 ms 14428 KB Output is correct
34 Correct 5 ms 14424 KB Output is correct
35 Correct 5 ms 14428 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 4 ms 12892 KB Output is correct
3 Correct 3 ms 12996 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 105 ms 27964 KB Output is correct
6 Correct 93 ms 26604 KB Output is correct
7 Correct 111 ms 25952 KB Output is correct
8 Correct 85 ms 25124 KB Output is correct
9 Correct 84 ms 25280 KB Output is correct
10 Correct 118 ms 29408 KB Output is correct
11 Correct 129 ms 29384 KB Output is correct
12 Correct 118 ms 29568 KB Output is correct
13 Correct 119 ms 29392 KB Output is correct
14 Correct 136 ms 29448 KB Output is correct
15 Correct 139 ms 38340 KB Output is correct
16 Correct 138 ms 38792 KB Output is correct
17 Correct 150 ms 37968 KB Output is correct
18 Correct 133 ms 29380 KB Output is correct
19 Correct 147 ms 29380 KB Output is correct
20 Correct 133 ms 29632 KB Output is correct
21 Correct 95 ms 29092 KB Output is correct
22 Correct 95 ms 29200 KB Output is correct
23 Correct 104 ms 29272 KB Output is correct
24 Correct 98 ms 29124 KB Output is correct
25 Correct 112 ms 29384 KB Output is correct
26 Correct 115 ms 29320 KB Output is correct
27 Correct 119 ms 29388 KB Output is correct
28 Correct 106 ms 29292 KB Output is correct
29 Correct 106 ms 29380 KB Output is correct
30 Correct 110 ms 29536 KB Output is correct
31 Correct 117 ms 29860 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 5 ms 14316 KB Output is correct
3 Correct 5 ms 14428 KB Output is correct
4 Correct 5 ms 14312 KB Output is correct
5 Correct 271 ms 89236 KB Output is correct
6 Correct 246 ms 76116 KB Output is correct
7 Correct 363 ms 112584 KB Output is correct
8 Correct 481 ms 126576 KB Output is correct
9 Correct 489 ms 126872 KB Output is correct
10 Correct 511 ms 126912 KB Output is correct
11 Correct 426 ms 126384 KB Output is correct
12 Correct 419 ms 126408 KB Output is correct
13 Correct 427 ms 126420 KB Output is correct
14 Correct 300 ms 126664 KB Output is correct
15 Correct 283 ms 126668 KB Output is correct
16 Correct 319 ms 126920 KB Output is correct
17 Correct 337 ms 126916 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 5 ms 13980 KB Output is correct
6 Correct 5 ms 14204 KB Output is correct
7 Correct 4 ms 13676 KB Output is correct
8 Correct 5 ms 14172 KB Output is correct
9 Correct 5 ms 14172 KB Output is correct
10 Correct 5 ms 14168 KB Output is correct
11 Correct 5 ms 14172 KB Output is correct
12 Correct 5 ms 14204 KB Output is correct
13 Correct 5 ms 14424 KB Output is correct
14 Correct 5 ms 14428 KB Output is correct
15 Correct 5 ms 14172 KB Output is correct
16 Correct 5 ms 14172 KB Output is correct
17 Correct 5 ms 14172 KB Output is correct
18 Correct 5 ms 14172 KB Output is correct
19 Correct 5 ms 14172 KB Output is correct
20 Correct 5 ms 14196 KB Output is correct
21 Correct 5 ms 14172 KB Output is correct
22 Correct 5 ms 14172 KB Output is correct
23 Correct 5 ms 14172 KB Output is correct
24 Correct 5 ms 14172 KB Output is correct
25 Correct 5 ms 14172 KB Output is correct
26 Correct 5 ms 14168 KB Output is correct
27 Correct 5 ms 14172 KB Output is correct
28 Correct 5 ms 14172 KB Output is correct
29 Correct 5 ms 14172 KB Output is correct
30 Correct 3 ms 12928 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12988 KB Output is correct
33 Correct 5 ms 14428 KB Output is correct
34 Correct 5 ms 14424 KB Output is correct
35 Correct 5 ms 14428 KB Output is correct
36 Correct 2 ms 12632 KB Output is correct
37 Correct 4 ms 12892 KB Output is correct
38 Correct 3 ms 12996 KB Output is correct
39 Correct 3 ms 12892 KB Output is correct
40 Correct 105 ms 27964 KB Output is correct
41 Correct 93 ms 26604 KB Output is correct
42 Correct 111 ms 25952 KB Output is correct
43 Correct 85 ms 25124 KB Output is correct
44 Correct 84 ms 25280 KB Output is correct
45 Correct 118 ms 29408 KB Output is correct
46 Correct 129 ms 29384 KB Output is correct
47 Correct 118 ms 29568 KB Output is correct
48 Correct 119 ms 29392 KB Output is correct
49 Correct 136 ms 29448 KB Output is correct
50 Correct 139 ms 38340 KB Output is correct
51 Correct 138 ms 38792 KB Output is correct
52 Correct 150 ms 37968 KB Output is correct
53 Correct 133 ms 29380 KB Output is correct
54 Correct 147 ms 29380 KB Output is correct
55 Correct 133 ms 29632 KB Output is correct
56 Correct 95 ms 29092 KB Output is correct
57 Correct 95 ms 29200 KB Output is correct
58 Correct 104 ms 29272 KB Output is correct
59 Correct 98 ms 29124 KB Output is correct
60 Correct 112 ms 29384 KB Output is correct
61 Correct 115 ms 29320 KB Output is correct
62 Correct 119 ms 29388 KB Output is correct
63 Correct 106 ms 29292 KB Output is correct
64 Correct 106 ms 29380 KB Output is correct
65 Correct 110 ms 29536 KB Output is correct
66 Correct 117 ms 29860 KB Output is correct
67 Correct 2 ms 12636 KB Output is correct
68 Correct 5 ms 14316 KB Output is correct
69 Correct 5 ms 14428 KB Output is correct
70 Correct 5 ms 14312 KB Output is correct
71 Correct 271 ms 89236 KB Output is correct
72 Correct 246 ms 76116 KB Output is correct
73 Correct 363 ms 112584 KB Output is correct
74 Correct 481 ms 126576 KB Output is correct
75 Correct 489 ms 126872 KB Output is correct
76 Correct 511 ms 126912 KB Output is correct
77 Correct 426 ms 126384 KB Output is correct
78 Correct 419 ms 126408 KB Output is correct
79 Correct 427 ms 126420 KB Output is correct
80 Correct 300 ms 126664 KB Output is correct
81 Correct 283 ms 126668 KB Output is correct
82 Correct 319 ms 126920 KB Output is correct
83 Correct 337 ms 126916 KB Output is correct
84 Correct 265 ms 108908 KB Output is correct
85 Correct 240 ms 98880 KB Output is correct
86 Correct 183 ms 72652 KB Output is correct
87 Correct 343 ms 117188 KB Output is correct
88 Correct 352 ms 117520 KB Output is correct
89 Correct 339 ms 117232 KB Output is correct
90 Correct 352 ms 117460 KB Output is correct
91 Correct 339 ms 117320 KB Output is correct
92 Correct 563 ms 123272 KB Output is correct
93 Correct 543 ms 125684 KB Output is correct
94 Correct 471 ms 117332 KB Output is correct
95 Correct 463 ms 117512 KB Output is correct
96 Correct 461 ms 117240 KB Output is correct
97 Correct 461 ms 117228 KB Output is correct
98 Correct 294 ms 116680 KB Output is correct
99 Correct 309 ms 116144 KB Output is correct
100 Correct 318 ms 116032 KB Output is correct
101 Correct 303 ms 116164 KB Output is correct
102 Correct 338 ms 116200 KB Output is correct
103 Correct 342 ms 116216 KB Output is correct
104 Correct 351 ms 116288 KB Output is correct
105 Correct 247 ms 116460 KB Output is correct
106 Correct 249 ms 116168 KB Output is correct
107 Correct 272 ms 116016 KB Output is correct
108 Correct 271 ms 116192 KB Output is correct