oj.uz

답안 #972234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972234 2024-04-30T09:06:30 Z vjudge1 Two Currencies (JOI23_currencies) C++17
100 / 100
 4062 ms 104656 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;
int tt = 1, n, m, q;
vector<int> g[100005];
ll p[100005], c[100005], s[100005], t[100005], x[100005], y[100005], h[100005], lk[500006], pred[100005];
pair<ll, ll> sum[2000005];
vector<ll> v, v1;
map<pair<int, int>, int> mp;
int kol[100005], dp[100005];
void dfs(int k, int pr){
    v.push_back(k);
    v1.push_back(k);
    pred[k] = pr;
    kol[k] += dp[mp[{k, pr}]];
    for(int to : g[k]){
        if(to == pr) continue;
        h[to] = h[k] + 1;
        kol[to] += kol[k];
        dfs(to, k);
        v1.push_back(k);
    }
    v.push_back(k);
}
pair<int, int> mn[2000005];

void up1(int l, int r, int pos, int num, int ind, int vv){
    if(l > pos || r < pos) return;
    if(l == r){
        mn[vv] = {num, ind};
        return; 
    }
    int mid = (l + r) / 2;
    up1(l, mid, pos, num, ind, vv * 2);
    up1(mid + 1, r, pos, num, ind, vv * 2 + 1);
    mn[vv] = min(mn[vv * 2], mn[vv * 2 + 1]);
}
pair<int, int> sbor1(int l, int r, int l1, int r1, int vv){
    if(l > r1 || l1 > r) return {1e9, 1e9};
    if(l >= l1 && r1 >= r) return mn[vv];
    int mid = (l + r) / 2;
    return min(sbor1(l, mid, l1, r1, vv * 2), sbor1(mid + 1, r, l1, r1, vv * 2 + 1));
}

void up(int l, int r, int pos, ll num, int vv){
    if(l > pos || r < pos) return;
    if(l == r){
        sum[vv].first += num;
        if(num > 0) sum[vv].second++;
        else sum[vv].second--;
        return; 
    }
    int mid = (l + r) / 2;
    up(l, mid, pos, num, vv * 2);
    up(mid + 1, r, pos, num, vv * 2 + 1);
    sum[vv].first = sum[vv * 2].first + sum[vv * 2 + 1].first;
    sum[vv].second = sum[vv * 2].second + sum[vv * 2 + 1].second;
}
pair<ll, ll> sbor(int l, int r, int l1, int r1, int vv){
    if(l > r1 || l1 > r) return {0, 0};
    if(l >= l1 && r1 >= r) return sum[vv];
    int mid = (l + r) / 2;
    pair<ll, ll> num1 = sbor(l, mid, l1, r1, vv * 2);
    pair<ll, ll> num2 = sbor(mid + 1, r, l1, r1, vv * 2 + 1);
    return {num1.first + num2.first, num1.second + num2.second};
}
vector<ll> ss[100005];
int lf[400005], rg[400005];
int l[100005], r[100005], res[100005];
set<int> st;
vector<int> d[100005];
pair<int, pair<int, int>> pp[100005];
pair<int, int> edge[100005];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i < n; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
        mp[{a, b}] = i;
        mp[{b, a}] = i;
        edge[i] = {a, b};
    }
    for(int i = 1; i <= m; i++){
        cin >> p[i] >> c[i];
        ss[p[i]].push_back(c[i]);
        dp[p[i]]++;
        st.insert(s[i]);
        pp[i] = {c[i], {p[i], i}};
    }
    for(int i = 1; i <= q; i++){
        l[i] = 0;
        r[i] = m + 1;
        cin >> s[i] >> t[i] >> x[i] >> y[i];
    }
    v.push_back(1);
    v1.push_back(1);
    dfs(1, 0);
    sort(pp + 1, pp + m + 1);
    for(int i = 1; i < int(v.size()); i++)
        if(lf[v[i]] == 0) lf[v[i]] = i;
    for(int i = int(v.size()) - 1; i >= 1; i--)
        if(rg[v[i]] == 0) rg[v[i]] = i;
    int dl1 = int(v1.size()) - 1;
    for(int i = 1; i <= dl1; i++){
        up1(1, dl1, i, h[v1[i]], v1[i], 1);
        if(lk[v1[i]] == 0) lk[v1[i]] = i;
    }
    int dl = int(v.size()) - 1;
    for(int i = 0; i < 18; i++){    
        for(int j = 1; j <= m; j++)  d[j].clear();
        for(int j = 1; j <= 2000000; j++) sum[j] = {0, 0};
        for(int j = 1; j <= q; j++){
            int mid = (l[j] + r[j]) / 2;
            d[mid].push_back(j);
        }
        for(int j = 1; j <= m; j++){
            int a = edge[pp[j].second.first].first, b = edge[pp[j].second.first].second, lc;
            if(h[a] > h[b]) swap(a, b);
            up(1, dl, lf[b], pp[j].first, 1);
            up(1, dl, rg[b], -pp[j].first, 1);
            for(int to : d[j]){
                int l1 = min(lk[s[to]], lk[t[to]]);
                int r1 = max(lk[s[to]], lk[t[to]]);
                auto it = sbor1(1, dl1, l1, r1, 1);
                int lca = it.second;
                ll dist1 = 0, dist2 = 0;
                if(lca != s[to]){
                    auto it1 = sbor(1, dl, lf[lca] + 1, lf[s[to]], 1);
                    dist1 += it1.first;
                    dist2 += it1.second;
                }
                if(lca != t[to]){
                    auto it1 = sbor(1, dl, lf[lca] + 1, lf[t[to]], 1);
                    dist1 += it1.first;
                    dist2 += it1.second;
                }
                if(dist1 <= y[to]){
                    l[to] = j;
                    res[to] = dist2;
                }
                else r[to] = j;
            }
        }
    }
    for(int i = 1; i <= q; i++){
        int l1 = min(lk[s[i]], lk[t[i]]);
        int r1 = max(lk[s[i]], lk[t[i]]);
        auto it = sbor1(1, dl1, l1, r1, 1);
        int lca = it.second;
        ll dist = kol[s[i]] - kol[lca] + kol[t[i]] - kol[lca];
        if(x[i] - max(0ll, dist - res[i]) >= 0) cout << x[i] - max(0ll, dist - res[i]) << "\n";
        else cout << -1 << "\n";
    }
}

Compilation message

currencies.cpp: In function 'int main()':
currencies.cpp:146:90: warning: unused variable 'lc' [-Wunused-variable]
  146 |             int a = edge[pp[j].second.first].first, b = edge[pp[j].second.first].second, lc;
      |                                                                                          ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 50060 KB Output is correct
2 Correct 68 ms 47964 KB Output is correct
3 Correct 66 ms 45916 KB Output is correct
4 Correct 65 ms 45760 KB Output is correct
5 Correct 91 ms 46596 KB Output is correct
6 Correct 115 ms 46764 KB Output is correct
7 Correct 95 ms 46488 KB Output is correct
8 Correct 102 ms 46688 KB Output is correct
9 Correct 105 ms 46692 KB Output is correct
10 Correct 106 ms 46736 KB Output is correct
11 Correct 98 ms 46680 KB Output is correct
12 Correct 107 ms 46684 KB Output is correct
13 Correct 97 ms 46944 KB Output is correct
14 Correct 95 ms 46936 KB Output is correct
15 Correct 96 ms 46680 KB Output is correct
16 Correct 98 ms 46736 KB Output is correct
17 Correct 100 ms 46824 KB Output is correct
18 Correct 103 ms 46864 KB Output is correct
19 Correct 98 ms 42844 KB Output is correct
20 Correct 105 ms 46700 KB Output is correct
21 Correct 99 ms 46800 KB Output is correct
22 Correct 97 ms 46680 KB Output is correct
23 Correct 106 ms 46704 KB Output is correct
24 Correct 96 ms 46784 KB Output is correct
25 Correct 97 ms 42952 KB Output is correct
26 Correct 95 ms 46736 KB Output is correct
27 Correct 101 ms 46720 KB Output is correct
28 Correct 96 ms 46792 KB Output is correct
29 Correct 89 ms 50768 KB Output is correct
30 Correct 99 ms 48724 KB Output is correct
31 Correct 100 ms 46792 KB Output is correct
32 Correct 97 ms 50772 KB Output is correct
33 Correct 102 ms 46956 KB Output is correct
34 Correct 89 ms 47152 KB Output is correct
35 Correct 109 ms 46928 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 45824 KB Output is correct
2 Correct 102 ms 46584 KB Output is correct
3 Correct 104 ms 46768 KB Output is correct
4 Correct 105 ms 47024 KB Output is correct
5 Correct 2463 ms 83732 KB Output is correct
6 Correct 2532 ms 80592 KB Output is correct
7 Correct 2607 ms 84672 KB Output is correct
8 Correct 2140 ms 81760 KB Output is correct
9 Correct 2125 ms 81380 KB Output is correct
10 Correct 3582 ms 91528 KB Output is correct
11 Correct 3477 ms 91820 KB Output is correct
12 Correct 3462 ms 91608 KB Output is correct
13 Correct 3391 ms 91716 KB Output is correct
14 Correct 3338 ms 91600 KB Output is correct
15 Correct 3010 ms 102736 KB Output is correct
16 Correct 3006 ms 103400 KB Output is correct
17 Correct 3094 ms 102056 KB Output is correct
18 Correct 3383 ms 92364 KB Output is correct
19 Correct 3423 ms 92180 KB Output is correct
20 Correct 3388 ms 92172 KB Output is correct
21 Correct 2914 ms 91980 KB Output is correct
22 Correct 2904 ms 92092 KB Output is correct
23 Correct 2825 ms 91968 KB Output is correct
24 Correct 2891 ms 92308 KB Output is correct
25 Correct 2821 ms 91492 KB Output is correct
26 Correct 2897 ms 91040 KB Output is correct
27 Correct 2847 ms 91224 KB Output is correct
28 Correct 2309 ms 93364 KB Output is correct
29 Correct 1904 ms 91456 KB Output is correct
30 Correct 2417 ms 93324 KB Output is correct
31 Correct 2362 ms 91632 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 53056 KB Output is correct
2 Correct 99 ms 52816 KB Output is correct
3 Correct 98 ms 52832 KB Output is correct
4 Correct 95 ms 48980 KB Output is correct
5 Correct 1927 ms 96312 KB Output is correct
6 Correct 1785 ms 95516 KB Output is correct
7 Correct 1986 ms 84480 KB Output is correct
8 Correct 2907 ms 104640 KB Output is correct
9 Correct 2975 ms 104656 KB Output is correct
10 Correct 3171 ms 104556 KB Output is correct
11 Correct 2430 ms 104028 KB Output is correct
12 Correct 2329 ms 103956 KB Output is correct
13 Correct 2406 ms 102424 KB Output is correct
14 Correct 2115 ms 102100 KB Output is correct
15 Correct 1959 ms 101708 KB Output is correct
16 Correct 2183 ms 102556 KB Output is correct
17 Correct 2247 ms 102352 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 50060 KB Output is correct
2 Correct 68 ms 47964 KB Output is correct
3 Correct 66 ms 45916 KB Output is correct
4 Correct 65 ms 45760 KB Output is correct
5 Correct 91 ms 46596 KB Output is correct
6 Correct 115 ms 46764 KB Output is correct
7 Correct 95 ms 46488 KB Output is correct
8 Correct 102 ms 46688 KB Output is correct
9 Correct 105 ms 46692 KB Output is correct
10 Correct 106 ms 46736 KB Output is correct
11 Correct 98 ms 46680 KB Output is correct
12 Correct 107 ms 46684 KB Output is correct
13 Correct 97 ms 46944 KB Output is correct
14 Correct 95 ms 46936 KB Output is correct
15 Correct 96 ms 46680 KB Output is correct
16 Correct 98 ms 46736 KB Output is correct
17 Correct 100 ms 46824 KB Output is correct
18 Correct 103 ms 46864 KB Output is correct
19 Correct 98 ms 42844 KB Output is correct
20 Correct 105 ms 46700 KB Output is correct
21 Correct 99 ms 46800 KB Output is correct
22 Correct 97 ms 46680 KB Output is correct
23 Correct 106 ms 46704 KB Output is correct
24 Correct 96 ms 46784 KB Output is correct
25 Correct 97 ms 42952 KB Output is correct
26 Correct 95 ms 46736 KB Output is correct
27 Correct 101 ms 46720 KB Output is correct
28 Correct 96 ms 46792 KB Output is correct
29 Correct 89 ms 50768 KB Output is correct
30 Correct 99 ms 48724 KB Output is correct
31 Correct 100 ms 46792 KB Output is correct
32 Correct 97 ms 50772 KB Output is correct
33 Correct 102 ms 46956 KB Output is correct
34 Correct 89 ms 47152 KB Output is correct
35 Correct 109 ms 46928 KB Output is correct
36 Correct 62 ms 45824 KB Output is correct
37 Correct 102 ms 46584 KB Output is correct
38 Correct 104 ms 46768 KB Output is correct
39 Correct 105 ms 47024 KB Output is correct
40 Correct 2463 ms 83732 KB Output is correct
41 Correct 2532 ms 80592 KB Output is correct
42 Correct 2607 ms 84672 KB Output is correct
43 Correct 2140 ms 81760 KB Output is correct
44 Correct 2125 ms 81380 KB Output is correct
45 Correct 3582 ms 91528 KB Output is correct
46 Correct 3477 ms 91820 KB Output is correct
47 Correct 3462 ms 91608 KB Output is correct
48 Correct 3391 ms 91716 KB Output is correct
49 Correct 3338 ms 91600 KB Output is correct
50 Correct 3010 ms 102736 KB Output is correct
51 Correct 3006 ms 103400 KB Output is correct
52 Correct 3094 ms 102056 KB Output is correct
53 Correct 3383 ms 92364 KB Output is correct
54 Correct 3423 ms 92180 KB Output is correct
55 Correct 3388 ms 92172 KB Output is correct
56 Correct 2914 ms 91980 KB Output is correct
57 Correct 2904 ms 92092 KB Output is correct
58 Correct 2825 ms 91968 KB Output is correct
59 Correct 2891 ms 92308 KB Output is correct
60 Correct 2821 ms 91492 KB Output is correct
61 Correct 2897 ms 91040 KB Output is correct
62 Correct 2847 ms 91224 KB Output is correct
63 Correct 2309 ms 93364 KB Output is correct
64 Correct 1904 ms 91456 KB Output is correct
65 Correct 2417 ms 93324 KB Output is correct
66 Correct 2362 ms 91632 KB Output is correct
67 Correct 72 ms 53056 KB Output is correct
68 Correct 99 ms 52816 KB Output is correct
69 Correct 98 ms 52832 KB Output is correct
70 Correct 95 ms 48980 KB Output is correct
71 Correct 1927 ms 96312 KB Output is correct
72 Correct 1785 ms 95516 KB Output is correct
73 Correct 1986 ms 84480 KB Output is correct
74 Correct 2907 ms 104640 KB Output is correct
75 Correct 2975 ms 104656 KB Output is correct
76 Correct 3171 ms 104556 KB Output is correct
77 Correct 2430 ms 104028 KB Output is correct
78 Correct 2329 ms 103956 KB Output is correct
79 Correct 2406 ms 102424 KB Output is correct
80 Correct 2115 ms 102100 KB Output is correct
81 Correct 1959 ms 101708 KB Output is correct
82 Correct 2183 ms 102556 KB Output is correct
83 Correct 2247 ms 102352 KB Output is correct
84 Correct 2476 ms 82280 KB Output is correct
85 Correct 2252 ms 74820 KB Output is correct
86 Correct 2045 ms 73332 KB Output is correct
87 Correct 3811 ms 91600 KB Output is correct
88 Correct 3636 ms 91624 KB Output is correct
89 Correct 3578 ms 91564 KB Output is correct
90 Correct 4062 ms 91588 KB Output is correct
91 Correct 3753 ms 93480 KB Output is correct
92 Correct 3558 ms 100960 KB Output is correct
93 Correct 3284 ms 103696 KB Output is correct
94 Correct 3755 ms 93952 KB Output is correct
95 Correct 3605 ms 94264 KB Output is correct
96 Correct 3613 ms 94052 KB Output is correct
97 Correct 3720 ms 93988 KB Output is correct
98 Correct 3487 ms 93612 KB Output is correct
99 Correct 3408 ms 93528 KB Output is correct
100 Correct 3396 ms 91848 KB Output is correct
101 Correct 3512 ms 92212 KB Output is correct
102 Correct 2953 ms 91944 KB Output is correct
103 Correct 3038 ms 91648 KB Output is correct
104 Correct 2947 ms 91956 KB Output is correct
105 Correct 2674 ms 89612 KB Output is correct
106 Correct 2411 ms 90576 KB Output is correct
107 Correct 2394 ms 89440 KB Output is correct
108 Correct 2458 ms 89720 KB Output is correct