oj.uz

답안 #947547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947547 2024-03-16T11:29:31 Z vladilius Two Currencies (JOI23_currencies) C++17
100 / 100
 644 ms 58992 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using pii = pair<int, int>;
 
struct FT{
    vector<ll> a;
    int n;
    FT(int ns){
        n = ns;
        a.resize(n + 1);
    }
    ll get(int v){
        ll out = 0;
        while (v > 0){
            out += a[v];
            v = (v & (v + 1)) - 1;
        }
        return out;
    }
    void upd(int p, int v){
        while (p <= n){
            a[p] += v;
            p |= (p + 1);
        }
    }
};
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m, q; cin>>n>>m>>q;
    vector<pii> g[n + 1];
    vector<int> a(n), b(n);
    for (int i = 1; i < n; i++){
        cin>>a[i]>>b[i];
        g[a[i]].push_back({b[i], i});
        g[b[i]].push_back({a[i], i});
    }
    vector<int> p(m + 1), c(m + 1), C(n);
    vector<pii> f = {{0, 0}};
    for (int i = 1; i <= m; i++){
        cin>>p[i]>>c[i];
        C[p[i]]++;
        f.push_back({c[i], p[i]});
    }
    sort(f.begin(), f.end());
    vector<int> s(q + 1), t(q + 1), x(q + 1), y(q + 1), L(q + 1), R(q + 1);
    for (int i = 1; i <= q; i++){
        cin>>s[i]>>t[i]>>x[i]>>y[i];
        L[i] = 0;
        R[i] = m;
    }
    
    vector<int> pw[n + 1];
    int lg = ceil(log2(n));
    for (int i = 1; i <= n; i++){
        pw[i].resize(lg + 1);
    }
    vector<int> tin(n + 1), tout(n + 1), d(n + 1), dd(n + 1);
    int timer = 0;
    function<void(int, int)> dfs = [&](int v, int pr) -> void{
        tin[v] = ++timer;
        pw[v][0] = pr;
        for (int i = 1; i <= lg; i++){
            pw[v][i] = pw[pw[v][i - 1]][i - 1];
        }
        for (auto [i, j]: g[v]){
            if (i == pr) continue;
            dd[i] = dd[v] + C[j];
            d[i] = d[v] + 1;
            dfs(i, v);
        }
        tout[v] = timer;
    };
    dfs(1, 1);
    
    auto sub = [&](int x, int y) -> bool{
        return (tin[x] <= tin[y] && tout[x] >= tout[y]);
    };
    auto lca = [&](int x, int y) -> int{
        if (sub(x, y)) return x;
        if (sub(y, x)) return y;
        for (int i = lg; i >= 0; i--){
            if (!sub(pw[x][i], y)){
                x = pw[x][i];
            }
        }
        return pw[x][0];
    };
    
    vector<int> lc(q + 1);
    for (int i = 1; i <= q; i++){
        lc[i] = lca(s[i], t[i]);
    }
    
    auto ff = [&](int x, int y){
        if (d[x] > d[y]){
            return x;
        }
        return y;
    };
    
    while (true){
        bool ind = true;
        vector<int> check[m + 1];
        for (int i = 1; i <= q; i++){
            if (L[i] + 1 < R[i]){
                int m = (L[i] + R[i]) / 2;
                check[m].push_back(i);
                ind = false;
            }
        }
        if (ind) break;
        FT T(n);
        for (int i = 0; i <= m; i++){
            if (i > 0){
                auto [v, j] = f[i];
                j = ff(a[j], b[j]);
                T.upd(tin[j], v);
                T.upd(tout[j] + 1, -v);
            }
            for (int j: check[i]){
                ll sum = T.get(tin[s[j]]) + T.get(tin[t[j]]) - 2 * T.get(tin[lc[j]]);
                if (sum <= y[j]){
                    L[j] = i;
                }
                else {
                    R[j] = i - 1;
                }
            }
        }
    }
    vector<int> check[m + 1];
    for (int i = 1; i <= q; i++){
        check[R[i]].push_back(i);
    }
    FT T(n);
    for (int i = 0; i <= m; i++){
        if (i > 0){
            auto [v, j] = f[i];
            j = ff(a[j], b[j]);
            T.upd(tin[j], v);
            T.upd(tout[j] + 1, -v);
        }
        for (int j: check[i]){
            ll sum = T.get(tin[s[j]]) + T.get(tin[t[j]]) - 2 * T.get(tin[lc[j]]);
            if (sum <= y[j]){
                L[j] = R[j];
            }
        }
    }
    for (int i = 0; i <= m; i++) check[i].clear();
    for (int i = 1; i <= q; i++) check[L[i]].push_back(i);
    FT T1(n);
    vector<int> cnt(q + 1);
    for (int i = 0; i <= m; i++){
        if (i > 0){
            auto [v, j] = f[i];
            j = ff(a[j], b[j]);
            T1.upd(tin[j], 1);
            T1.upd(tout[j] + 1, -1);
        }
        for (int j: check[i]){
            cnt[j] = T1.get(tin[s[j]]) + T1.get(tin[t[j]]) - 2 * T1.get(tin[lc[j]]);
        }
    }
    
    for (int i = 1; i <= q; i++){
        int len = dd[s[i]] + dd[t[i]] - 2 * dd[lc[i]];
        len -= cnt[i];
        if (len > x[i]){
            cout<<-1<<"\n";
            continue;
        }
        cout<<x[i] - len<<"\n";
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 4 ms 1112 KB Output is correct
6 Correct 5 ms 1316 KB Output is correct
7 Correct 4 ms 1116 KB Output is correct
8 Correct 5 ms 1236 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 6 ms 1372 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 5 ms 1368 KB Output is correct
14 Correct 5 ms 1372 KB Output is correct
15 Correct 5 ms 1400 KB Output is correct
16 Correct 6 ms 1372 KB Output is correct
17 Correct 5 ms 1368 KB Output is correct
18 Correct 5 ms 1372 KB Output is correct
19 Correct 5 ms 1372 KB Output is correct
20 Correct 5 ms 1368 KB Output is correct
21 Correct 4 ms 1372 KB Output is correct
22 Correct 4 ms 1372 KB Output is correct
23 Correct 5 ms 1372 KB Output is correct
24 Correct 5 ms 1368 KB Output is correct
25 Correct 4 ms 1372 KB Output is correct
26 Correct 4 ms 1372 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 4 ms 1372 KB Output is correct
29 Correct 4 ms 1116 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 5 ms 1372 KB Output is correct
32 Correct 5 ms 1372 KB Output is correct
33 Correct 5 ms 1368 KB Output is correct
34 Correct 5 ms 1372 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 1372 KB Output is correct
3 Correct 5 ms 1372 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 313 ms 45292 KB Output is correct
6 Correct 353 ms 37488 KB Output is correct
7 Correct 367 ms 40664 KB Output is correct
8 Correct 277 ms 39840 KB Output is correct
9 Correct 265 ms 39564 KB Output is correct
10 Correct 450 ms 49692 KB Output is correct
11 Correct 471 ms 49988 KB Output is correct
12 Correct 438 ms 49636 KB Output is correct
13 Correct 437 ms 49872 KB Output is correct
14 Correct 430 ms 49848 KB Output is correct
15 Correct 496 ms 58128 KB Output is correct
16 Correct 483 ms 58720 KB Output is correct
17 Correct 530 ms 57664 KB Output is correct
18 Correct 509 ms 49980 KB Output is correct
19 Correct 517 ms 50068 KB Output is correct
20 Correct 516 ms 50176 KB Output is correct
21 Correct 481 ms 49156 KB Output is correct
22 Correct 408 ms 49348 KB Output is correct
23 Correct 376 ms 49404 KB Output is correct
24 Correct 414 ms 49092 KB Output is correct
25 Correct 415 ms 50272 KB Output is correct
26 Correct 374 ms 50164 KB Output is correct
27 Correct 418 ms 50152 KB Output is correct
28 Correct 325 ms 49696 KB Output is correct
29 Correct 317 ms 49596 KB Output is correct
30 Correct 336 ms 49088 KB Output is correct
31 Correct 324 ms 49044 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 5 ms 1372 KB Output is correct
3 Correct 4 ms 1372 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 290 ms 51736 KB Output is correct
6 Correct 250 ms 50292 KB Output is correct
7 Correct 303 ms 36476 KB Output is correct
8 Correct 434 ms 58900 KB Output is correct
9 Correct 488 ms 58852 KB Output is correct
10 Correct 414 ms 58888 KB Output is correct
11 Correct 382 ms 58792 KB Output is correct
12 Correct 393 ms 58992 KB Output is correct
13 Correct 378 ms 58696 KB Output is correct
14 Correct 342 ms 58232 KB Output is correct
15 Correct 329 ms 57952 KB Output is correct
16 Correct 398 ms 58712 KB Output is correct
17 Correct 361 ms 58336 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 4 ms 1112 KB Output is correct
6 Correct 5 ms 1316 KB Output is correct
7 Correct 4 ms 1116 KB Output is correct
8 Correct 5 ms 1236 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 6 ms 1372 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 5 ms 1368 KB Output is correct
14 Correct 5 ms 1372 KB Output is correct
15 Correct 5 ms 1400 KB Output is correct
16 Correct 6 ms 1372 KB Output is correct
17 Correct 5 ms 1368 KB Output is correct
18 Correct 5 ms 1372 KB Output is correct
19 Correct 5 ms 1372 KB Output is correct
20 Correct 5 ms 1368 KB Output is correct
21 Correct 4 ms 1372 KB Output is correct
22 Correct 4 ms 1372 KB Output is correct
23 Correct 5 ms 1372 KB Output is correct
24 Correct 5 ms 1368 KB Output is correct
25 Correct 4 ms 1372 KB Output is correct
26 Correct 4 ms 1372 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 4 ms 1372 KB Output is correct
29 Correct 4 ms 1116 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 5 ms 1372 KB Output is correct
32 Correct 5 ms 1372 KB Output is correct
33 Correct 5 ms 1368 KB Output is correct
34 Correct 5 ms 1372 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 5 ms 1372 KB Output is correct
38 Correct 5 ms 1372 KB Output is correct
39 Correct 5 ms 1372 KB Output is correct
40 Correct 313 ms 45292 KB Output is correct
41 Correct 353 ms 37488 KB Output is correct
42 Correct 367 ms 40664 KB Output is correct
43 Correct 277 ms 39840 KB Output is correct
44 Correct 265 ms 39564 KB Output is correct
45 Correct 450 ms 49692 KB Output is correct
46 Correct 471 ms 49988 KB Output is correct
47 Correct 438 ms 49636 KB Output is correct
48 Correct 437 ms 49872 KB Output is correct
49 Correct 430 ms 49848 KB Output is correct
50 Correct 496 ms 58128 KB Output is correct
51 Correct 483 ms 58720 KB Output is correct
52 Correct 530 ms 57664 KB Output is correct
53 Correct 509 ms 49980 KB Output is correct
54 Correct 517 ms 50068 KB Output is correct
55 Correct 516 ms 50176 KB Output is correct
56 Correct 481 ms 49156 KB Output is correct
57 Correct 408 ms 49348 KB Output is correct
58 Correct 376 ms 49404 KB Output is correct
59 Correct 414 ms 49092 KB Output is correct
60 Correct 415 ms 50272 KB Output is correct
61 Correct 374 ms 50164 KB Output is correct
62 Correct 418 ms 50152 KB Output is correct
63 Correct 325 ms 49696 KB Output is correct
64 Correct 317 ms 49596 KB Output is correct
65 Correct 336 ms 49088 KB Output is correct
66 Correct 324 ms 49044 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 5 ms 1372 KB Output is correct
69 Correct 4 ms 1372 KB Output is correct
70 Correct 5 ms 1372 KB Output is correct
71 Correct 290 ms 51736 KB Output is correct
72 Correct 250 ms 50292 KB Output is correct
73 Correct 303 ms 36476 KB Output is correct
74 Correct 434 ms 58900 KB Output is correct
75 Correct 488 ms 58852 KB Output is correct
76 Correct 414 ms 58888 KB Output is correct
77 Correct 382 ms 58792 KB Output is correct
78 Correct 393 ms 58992 KB Output is correct
79 Correct 378 ms 58696 KB Output is correct
80 Correct 342 ms 58232 KB Output is correct
81 Correct 329 ms 57952 KB Output is correct
82 Correct 398 ms 58712 KB Output is correct
83 Correct 361 ms 58336 KB Output is correct
84 Correct 364 ms 40276 KB Output is correct
85 Correct 315 ms 30432 KB Output is correct
86 Correct 289 ms 28644 KB Output is correct
87 Correct 502 ms 49596 KB Output is correct
88 Correct 522 ms 49580 KB Output is correct
89 Correct 513 ms 49656 KB Output is correct
90 Correct 564 ms 49708 KB Output is correct
91 Correct 526 ms 49824 KB Output is correct
92 Correct 535 ms 55056 KB Output is correct
93 Correct 644 ms 57324 KB Output is correct
94 Correct 642 ms 49932 KB Output is correct
95 Correct 559 ms 49880 KB Output is correct
96 Correct 568 ms 50164 KB Output is correct
97 Correct 627 ms 50068 KB Output is correct
98 Correct 502 ms 49136 KB Output is correct
99 Correct 524 ms 49132 KB Output is correct
100 Correct 526 ms 49368 KB Output is correct
101 Correct 470 ms 46684 KB Output is correct
102 Correct 418 ms 47108 KB Output is correct
103 Correct 447 ms 47368 KB Output is correct
104 Correct 424 ms 47048 KB Output is correct
105 Correct 433 ms 46712 KB Output is correct
106 Correct 362 ms 46724 KB Output is correct
107 Correct 387 ms 46328 KB Output is correct
108 Correct 349 ms 46068 KB Output is correct