oj.uz

답안 #862024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862024 2023-10-17T11:48:15 Z vjudge1 Two Currencies (JOI23_currencies) C++17
100 / 100
 446 ms 67152 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14760 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 2 ms 14952 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 5 ms 14940 KB Output is correct
6 Correct 5 ms 14940 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 6 ms 14936 KB Output is correct
9 Correct 5 ms 13148 KB Output is correct
10 Correct 5 ms 11108 KB Output is correct
11 Correct 6 ms 14940 KB Output is correct
12 Correct 5 ms 15124 KB Output is correct
13 Correct 5 ms 13144 KB Output is correct
14 Correct 5 ms 15448 KB Output is correct
15 Correct 6 ms 15192 KB Output is correct
16 Correct 6 ms 15048 KB Output is correct
17 Correct 6 ms 14940 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 6 ms 15128 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 5 ms 14940 KB Output is correct
23 Correct 6 ms 11100 KB Output is correct
24 Correct 5 ms 13148 KB Output is correct
25 Correct 5 ms 14936 KB Output is correct
26 Correct 6 ms 14936 KB Output is correct
27 Correct 5 ms 14940 KB Output is correct
28 Correct 4 ms 13148 KB Output is correct
29 Correct 4 ms 13148 KB Output is correct
30 Correct 3 ms 10844 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 5 ms 10844 KB Output is correct
33 Correct 5 ms 15448 KB Output is correct
34 Correct 6 ms 15448 KB Output is correct
35 Correct 5 ms 15196 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 5 ms 10844 KB Output is correct
3 Correct 4 ms 10844 KB Output is correct
4 Correct 3 ms 10844 KB Output is correct
5 Correct 101 ms 16592 KB Output is correct
6 Correct 97 ms 15276 KB Output is correct
7 Correct 83 ms 15700 KB Output is correct
8 Correct 77 ms 15736 KB Output is correct
9 Correct 72 ms 15824 KB Output is correct
10 Correct 140 ms 16720 KB Output is correct
11 Correct 109 ms 16684 KB Output is correct
12 Correct 123 ms 16720 KB Output is correct
13 Correct 89 ms 16724 KB Output is correct
14 Correct 98 ms 16860 KB Output is correct
15 Correct 141 ms 24916 KB Output is correct
16 Correct 130 ms 25424 KB Output is correct
17 Correct 130 ms 24656 KB Output is correct
18 Correct 120 ms 16492 KB Output is correct
19 Correct 119 ms 16688 KB Output is correct
20 Correct 134 ms 16408 KB Output is correct
21 Correct 81 ms 16836 KB Output is correct
22 Correct 73 ms 16840 KB Output is correct
23 Correct 73 ms 16840 KB Output is correct
24 Correct 85 ms 16840 KB Output is correct
25 Correct 96 ms 16344 KB Output is correct
26 Correct 93 ms 16340 KB Output is correct
27 Correct 104 ms 16368 KB Output is correct
28 Correct 93 ms 16736 KB Output is correct
29 Correct 81 ms 16720 KB Output is correct
30 Correct 92 ms 16704 KB Output is correct
31 Correct 85 ms 16640 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 6 ms 15196 KB Output is correct
3 Correct 4 ms 15196 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 191 ms 51220 KB Output is correct
6 Correct 170 ms 44532 KB Output is correct
7 Correct 278 ms 58708 KB Output is correct
8 Correct 377 ms 66900 KB Output is correct
9 Correct 382 ms 67152 KB Output is correct
10 Correct 384 ms 66904 KB Output is correct
11 Correct 324 ms 66368 KB Output is correct
12 Correct 291 ms 66248 KB Output is correct
13 Correct 324 ms 66572 KB Output is correct
14 Correct 178 ms 66748 KB Output is correct
15 Correct 194 ms 66864 KB Output is correct
16 Correct 243 ms 66752 KB Output is correct
17 Correct 235 ms 66896 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14760 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 2 ms 14952 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 5 ms 14940 KB Output is correct
6 Correct 5 ms 14940 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 6 ms 14936 KB Output is correct
9 Correct 5 ms 13148 KB Output is correct
10 Correct 5 ms 11108 KB Output is correct
11 Correct 6 ms 14940 KB Output is correct
12 Correct 5 ms 15124 KB Output is correct
13 Correct 5 ms 13144 KB Output is correct
14 Correct 5 ms 15448 KB Output is correct
15 Correct 6 ms 15192 KB Output is correct
16 Correct 6 ms 15048 KB Output is correct
17 Correct 6 ms 14940 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 6 ms 15128 KB Output is correct
20 Correct 5 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 5 ms 14940 KB Output is correct
23 Correct 6 ms 11100 KB Output is correct
24 Correct 5 ms 13148 KB Output is correct
25 Correct 5 ms 14936 KB Output is correct
26 Correct 6 ms 14936 KB Output is correct
27 Correct 5 ms 14940 KB Output is correct
28 Correct 4 ms 13148 KB Output is correct
29 Correct 4 ms 13148 KB Output is correct
30 Correct 3 ms 10844 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 5 ms 10844 KB Output is correct
33 Correct 5 ms 15448 KB Output is correct
34 Correct 6 ms 15448 KB Output is correct
35 Correct 5 ms 15196 KB Output is correct
36 Correct 2 ms 10844 KB Output is correct
37 Correct 5 ms 10844 KB Output is correct
38 Correct 4 ms 10844 KB Output is correct
39 Correct 3 ms 10844 KB Output is correct
40 Correct 101 ms 16592 KB Output is correct
41 Correct 97 ms 15276 KB Output is correct
42 Correct 83 ms 15700 KB Output is correct
43 Correct 77 ms 15736 KB Output is correct
44 Correct 72 ms 15824 KB Output is correct
45 Correct 140 ms 16720 KB Output is correct
46 Correct 109 ms 16684 KB Output is correct
47 Correct 123 ms 16720 KB Output is correct
48 Correct 89 ms 16724 KB Output is correct
49 Correct 98 ms 16860 KB Output is correct
50 Correct 141 ms 24916 KB Output is correct
51 Correct 130 ms 25424 KB Output is correct
52 Correct 130 ms 24656 KB Output is correct
53 Correct 120 ms 16492 KB Output is correct
54 Correct 119 ms 16688 KB Output is correct
55 Correct 134 ms 16408 KB Output is correct
56 Correct 81 ms 16836 KB Output is correct
57 Correct 73 ms 16840 KB Output is correct
58 Correct 73 ms 16840 KB Output is correct
59 Correct 85 ms 16840 KB Output is correct
60 Correct 96 ms 16344 KB Output is correct
61 Correct 93 ms 16340 KB Output is correct
62 Correct 104 ms 16368 KB Output is correct
63 Correct 93 ms 16736 KB Output is correct
64 Correct 81 ms 16720 KB Output is correct
65 Correct 92 ms 16704 KB Output is correct
66 Correct 85 ms 16640 KB Output is correct
67 Correct 2 ms 14940 KB Output is correct
68 Correct 6 ms 15196 KB Output is correct
69 Correct 4 ms 15196 KB Output is correct
70 Correct 4 ms 15196 KB Output is correct
71 Correct 191 ms 51220 KB Output is correct
72 Correct 170 ms 44532 KB Output is correct
73 Correct 278 ms 58708 KB Output is correct
74 Correct 377 ms 66900 KB Output is correct
75 Correct 382 ms 67152 KB Output is correct
76 Correct 384 ms 66904 KB Output is correct
77 Correct 324 ms 66368 KB Output is correct
78 Correct 291 ms 66248 KB Output is correct
79 Correct 324 ms 66572 KB Output is correct
80 Correct 178 ms 66748 KB Output is correct
81 Correct 194 ms 66864 KB Output is correct
82 Correct 243 ms 66752 KB Output is correct
83 Correct 235 ms 66896 KB Output is correct
84 Correct 157 ms 54868 KB Output is correct
85 Correct 163 ms 49332 KB Output is correct
86 Correct 122 ms 38804 KB Output is correct
87 Correct 224 ms 57684 KB Output is correct
88 Correct 219 ms 58348 KB Output is correct
89 Correct 234 ms 57684 KB Output is correct
90 Correct 211 ms 57688 KB Output is correct
91 Correct 217 ms 57684 KB Output is correct
92 Correct 421 ms 63324 KB Output is correct
93 Correct 446 ms 65488 KB Output is correct
94 Correct 325 ms 57428 KB Output is correct
95 Correct 359 ms 57628 KB Output is correct
96 Correct 337 ms 57492 KB Output is correct
97 Correct 320 ms 57624 KB Output is correct
98 Correct 185 ms 57848 KB Output is correct
99 Correct 166 ms 57800 KB Output is correct
100 Correct 174 ms 57796 KB Output is correct
101 Correct 166 ms 57928 KB Output is correct
102 Correct 212 ms 57316 KB Output is correct
103 Correct 211 ms 57320 KB Output is correct
104 Correct 202 ms 57296 KB Output is correct
105 Correct 147 ms 57832 KB Output is correct
106 Correct 153 ms 57816 KB Output is correct
107 Correct 152 ms 57876 KB Output is correct
108 Correct 158 ms 57680 KB Output is correct