oj.uz

답안 #972217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972217 2024-04-30T08:49:15 Z vjudge1 Two Currencies (JOI23_currencies) C++17
68 / 100
 5000 ms 88276 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[200005];
ll p[100005], c[100005], s[100005], t[100005], x[100005], y[100005], h[100005], lk[1000006], pred[100005];
pair<ll, ll> sum[1000005];
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[1000005];

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[1000005], rg[1000005];
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 >= 0; 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 < 20; i++){    
        for(int j = 1; j <= m; j++) 
            d[j].clear();
        for(int j = 1; j <= 4 * dl; 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);
            // if(i == 0) cout << pp[j].first << " " << a << " " << b << "\n";
            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(s[to] != lca) dist1 += sbor(1, dl, lf[lca] + 1, lf[s[to]], 1).first;
                if(t[to] != lca) dist1 += sbor(1, dl, lf[lca] + 1, lf[t[to]], 1).first;
                if(s[to] != lca) dist2 += sbor(1, dl, lf[lca] + 1, lf[s[to]], 1).second;
                if(t[to] != lca) dist2 += sbor(1, dl, lf[lca] + 1, lf[t[to]], 1).second;
                // if(i == 0) cout << dist1 << " " << dist2 << " " << s[to] << " " << t[to] << " " << j << " " << lca << "\n";
                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;
        int dist = kol[s[i]] - kol[lca] + kol[t[i]] - kol[lca];
        if(x[i] - max(0, dist - res[i]) >= 0) cout << x[i] - max(0, dist - res[i]) << "\n";
        else cout << -1 << "\n";
    }
}

Compilation message

currencies.cpp: In function 'int main()':
currencies.cpp:147:90: warning: unused variable 'lc' [-Wunused-variable]
  147 |             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 4 ms 21852 KB Output is correct
2 Correct 4 ms 20060 KB Output is correct
3 Correct 4 ms 21852 KB Output is correct
4 Correct 4 ms 21852 KB Output is correct
5 Correct 35 ms 22588 KB Output is correct
6 Correct 48 ms 22796 KB Output is correct
7 Correct 41 ms 22596 KB Output is correct
8 Correct 52 ms 22620 KB Output is correct
9 Correct 52 ms 24664 KB Output is correct
10 Correct 52 ms 22752 KB Output is correct
11 Correct 51 ms 22620 KB Output is correct
12 Correct 55 ms 22728 KB Output is correct
13 Correct 42 ms 22872 KB Output is correct
14 Correct 43 ms 22908 KB Output is correct
15 Correct 46 ms 22844 KB Output is correct
16 Correct 48 ms 20824 KB Output is correct
17 Correct 49 ms 18856 KB Output is correct
18 Correct 48 ms 18780 KB Output is correct
19 Correct 49 ms 18776 KB Output is correct
20 Correct 50 ms 18832 KB Output is correct
21 Correct 49 ms 18780 KB Output is correct
22 Correct 57 ms 18804 KB Output is correct
23 Correct 43 ms 18780 KB Output is correct
24 Correct 46 ms 20568 KB Output is correct
25 Correct 44 ms 18820 KB Output is correct
26 Correct 43 ms 18776 KB Output is correct
27 Correct 39 ms 18776 KB Output is correct
28 Correct 48 ms 18984 KB Output is correct
29 Correct 35 ms 18776 KB Output is correct
30 Correct 51 ms 18780 KB Output is correct
31 Correct 50 ms 18768 KB Output is correct
32 Correct 50 ms 20816 KB Output is correct
33 Correct 38 ms 19024 KB Output is correct
34 Correct 43 ms 19036 KB Output is correct
35 Correct 39 ms 20828 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17848 KB Output is correct
2 Correct 53 ms 18684 KB Output is correct
3 Correct 50 ms 18752 KB Output is correct
4 Correct 50 ms 18780 KB Output is correct
5 Correct 3006 ms 70792 KB Output is correct
6 Correct 3496 ms 63228 KB Output is correct
7 Correct 3729 ms 67404 KB Output is correct
8 Correct 2846 ms 65320 KB Output is correct
9 Correct 2777 ms 64960 KB Output is correct
10 Correct 4355 ms 76308 KB Output is correct
11 Correct 4444 ms 76824 KB Output is correct
12 Correct 4453 ms 76796 KB Output is correct
13 Correct 4501 ms 76776 KB Output is correct
14 Correct 4481 ms 76892 KB Output is correct
15 Correct 3628 ms 87412 KB Output is correct
16 Correct 3431 ms 87984 KB Output is correct
17 Correct 3725 ms 87020 KB Output is correct
18 Correct 4421 ms 77180 KB Output is correct
19 Correct 4406 ms 76988 KB Output is correct
20 Correct 4389 ms 77260 KB Output is correct
21 Correct 3812 ms 76628 KB Output is correct
22 Correct 3873 ms 76868 KB Output is correct
23 Correct 3922 ms 76996 KB Output is correct
24 Correct 3776 ms 77032 KB Output is correct
25 Correct 3862 ms 76136 KB Output is correct
26 Correct 3805 ms 76084 KB Output is correct
27 Correct 3658 ms 76028 KB Output is correct
28 Correct 3088 ms 75116 KB Output is correct
29 Correct 2636 ms 74444 KB Output is correct
30 Correct 3311 ms 75464 KB Output is correct
31 Correct 3232 ms 74748 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 20312 KB Output is correct
2 Correct 41 ms 18776 KB Output is correct
3 Correct 42 ms 19028 KB Output is correct
4 Correct 40 ms 19036 KB Output is correct
5 Correct 2382 ms 79016 KB Output is correct
6 Correct 2471 ms 77952 KB Output is correct
7 Correct 2731 ms 62432 KB Output is correct
8 Correct 3725 ms 88276 KB Output is correct
9 Correct 3694 ms 88156 KB Output is correct
10 Correct 3791 ms 88112 KB Output is correct
11 Correct 3070 ms 87736 KB Output is correct
12 Correct 2997 ms 87924 KB Output is correct
13 Correct 2998 ms 87716 KB Output is correct
14 Correct 2595 ms 87572 KB Output is correct
15 Correct 2672 ms 87212 KB Output is correct
16 Correct 2859 ms 88140 KB Output is correct
17 Correct 2755 ms 87976 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21852 KB Output is correct
2 Correct 4 ms 20060 KB Output is correct
3 Correct 4 ms 21852 KB Output is correct
4 Correct 4 ms 21852 KB Output is correct
5 Correct 35 ms 22588 KB Output is correct
6 Correct 48 ms 22796 KB Output is correct
7 Correct 41 ms 22596 KB Output is correct
8 Correct 52 ms 22620 KB Output is correct
9 Correct 52 ms 24664 KB Output is correct
10 Correct 52 ms 22752 KB Output is correct
11 Correct 51 ms 22620 KB Output is correct
12 Correct 55 ms 22728 KB Output is correct
13 Correct 42 ms 22872 KB Output is correct
14 Correct 43 ms 22908 KB Output is correct
15 Correct 46 ms 22844 KB Output is correct
16 Correct 48 ms 20824 KB Output is correct
17 Correct 49 ms 18856 KB Output is correct
18 Correct 48 ms 18780 KB Output is correct
19 Correct 49 ms 18776 KB Output is correct
20 Correct 50 ms 18832 KB Output is correct
21 Correct 49 ms 18780 KB Output is correct
22 Correct 57 ms 18804 KB Output is correct
23 Correct 43 ms 18780 KB Output is correct
24 Correct 46 ms 20568 KB Output is correct
25 Correct 44 ms 18820 KB Output is correct
26 Correct 43 ms 18776 KB Output is correct
27 Correct 39 ms 18776 KB Output is correct
28 Correct 48 ms 18984 KB Output is correct
29 Correct 35 ms 18776 KB Output is correct
30 Correct 51 ms 18780 KB Output is correct
31 Correct 50 ms 18768 KB Output is correct
32 Correct 50 ms 20816 KB Output is correct
33 Correct 38 ms 19024 KB Output is correct
34 Correct 43 ms 19036 KB Output is correct
35 Correct 39 ms 20828 KB Output is correct
36 Correct 4 ms 17848 KB Output is correct
37 Correct 53 ms 18684 KB Output is correct
38 Correct 50 ms 18752 KB Output is correct
39 Correct 50 ms 18780 KB Output is correct
40 Correct 3006 ms 70792 KB Output is correct
41 Correct 3496 ms 63228 KB Output is correct
42 Correct 3729 ms 67404 KB Output is correct
43 Correct 2846 ms 65320 KB Output is correct
44 Correct 2777 ms 64960 KB Output is correct
45 Correct 4355 ms 76308 KB Output is correct
46 Correct 4444 ms 76824 KB Output is correct
47 Correct 4453 ms 76796 KB Output is correct
48 Correct 4501 ms 76776 KB Output is correct
49 Correct 4481 ms 76892 KB Output is correct
50 Correct 3628 ms 87412 KB Output is correct
51 Correct 3431 ms 87984 KB Output is correct
52 Correct 3725 ms 87020 KB Output is correct
53 Correct 4421 ms 77180 KB Output is correct
54 Correct 4406 ms 76988 KB Output is correct
55 Correct 4389 ms 77260 KB Output is correct
56 Correct 3812 ms 76628 KB Output is correct
57 Correct 3873 ms 76868 KB Output is correct
58 Correct 3922 ms 76996 KB Output is correct
59 Correct 3776 ms 77032 KB Output is correct
60 Correct 3862 ms 76136 KB Output is correct
61 Correct 3805 ms 76084 KB Output is correct
62 Correct 3658 ms 76028 KB Output is correct
63 Correct 3088 ms 75116 KB Output is correct
64 Correct 2636 ms 74444 KB Output is correct
65 Correct 3311 ms 75464 KB Output is correct
66 Correct 3232 ms 74748 KB Output is correct
67 Correct 4 ms 20312 KB Output is correct
68 Correct 41 ms 18776 KB Output is correct
69 Correct 42 ms 19028 KB Output is correct
70 Correct 40 ms 19036 KB Output is correct
71 Correct 2382 ms 79016 KB Output is correct
72 Correct 2471 ms 77952 KB Output is correct
73 Correct 2731 ms 62432 KB Output is correct
74 Correct 3725 ms 88276 KB Output is correct
75 Correct 3694 ms 88156 KB Output is correct
76 Correct 3791 ms 88112 KB Output is correct
77 Correct 3070 ms 87736 KB Output is correct
78 Correct 2997 ms 87924 KB Output is correct
79 Correct 2998 ms 87716 KB Output is correct
80 Correct 2595 ms 87572 KB Output is correct
81 Correct 2672 ms 87212 KB Output is correct
82 Correct 2859 ms 88140 KB Output is correct
83 Correct 2755 ms 87976 KB Output is correct
84 Correct 3230 ms 66308 KB Output is correct
85 Correct 3087 ms 55812 KB Output is correct
86 Correct 2815 ms 53120 KB Output is correct
87 Correct 4872 ms 76612 KB Output is correct
88 Correct 4800 ms 78004 KB Output is correct
89 Correct 4819 ms 76692 KB Output is correct
90 Correct 4985 ms 76612 KB Output is correct
91 Correct 4966 ms 76692 KB Output is correct
92 Correct 4301 ms 84244 KB Output is correct
93 Correct 4279 ms 86908 KB Output is correct
94 Correct 4953 ms 77152 KB Output is correct
95 Execution timed out 5057 ms 76672 KB Time limit exceeded
96 Halted 0 ms 0 KB -