oj.uz

Submission #764108

# Submission time Handle Problem Language Result Execution time Memory
764108 2023-06-23T07:14:08 Z joelgun14 Two Currencies (JOI23_currencies) C++17
100 / 100
 2514 ms 117012 KB 
// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int lim = 1e5 + 5;
struct fenwick {
    ll a[lim];
    fenwick() {
        memset(a, 0, sizeof(a));
    }
    void update(int idx, int val) {
        while(idx < lim) {
            a[idx] += val;
            idx += idx&-idx;
        }
    }
    void update(int l, int r, int val) {
        update(l, val);
        update(r + 1, -val);
    }
    ll query(int idx) {
        ll ret = 0;
        while(idx) {
            ret += a[idx];
            idx -= idx&-idx;
        }
        return ret;
    }
};
vector<int> edges[lim];
int par[17][lim], in[lim], out[lim], ti, depth[lim];
bool vis[lim];
void dfs(int nd) {
    vis[nd] = 1;
    in[nd] = ++ti;
    for(int i = 1; i < 17; ++i) {
        par[i][nd] = par[i - 1][par[i - 1][nd]];
    }
    for(auto i : edges[nd]) {
        if(!vis[i]) {
            depth[i] = depth[nd] + 1;
            par[0][i] = nd;
            dfs(i);
        }
    }
    out[nd] = ti;
}
int lca(int u, int v) {
    if(depth[u] > depth[v])
        swap(u, v);
    for(int i = 16; i >= 0; --i) {
        if(depth[par[i][v]] >= depth[u])
            v = par[i][v];
    }
    if(u == v)
        return u;
    for(int i = 16; i >= 0; --i) {
        if(par[i][u] != par[i][v])
            u = par[i][u], v = par[i][v];
    }
    return par[0][u];
}
struct query {
    int l, r, m, num, s, t;
    ll x, y;
    bool operator<(const query& rhs) const {
        return m > rhs.m;
    };
};
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    // dsu on tree dr min weight, nanti bisa di paralel binser berapa max yg bs didapat
    // find count of "used" edges in a path
    // HLD + binser -> Nlog^3N
    // coba non HLD atau coba HLD tapi ga pake binsernya
    // find count of "used" in path, sum edgesnya berapa?
    // simpan dist i ke root dan j ke root
    // nanti di update lazy seg, terus simpen LCA
    // jadinya binser + mst + ett + seg/fen
    // greedy edge dr yg cost terkecil ke terbesar, nanti simpan count used edges berapa (bisa pakai teknik yg sama juga)
    // bisa pakai segtree biasa, difference array style
    int n, m, q;
    cin >> n >> m >> q;
    pair<int, int> adj[n];
    for(int i = 1; i <= n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        edges[u].pb(v);
        edges[v].pb(u);
        adj[i] = mp(u, v);
    }
    dfs(1);
    for(auto &i : adj) {
        if(depth[i.fi] < depth[i.se])
            swap(i.fi, i.se);
    }
    // fi -> price
    // se -> idx
    fenwick cost, count;
    pair<int, int> periksa[m];
    for(int i = 0; i < m; ++i) {
        cin >> periksa[i].se >> periksa[i].fi;
    }
    sort(periksa, periksa + m);
    ll ans[q];
    memset(ans, -1, sizeof(ans));
    vector<query> queries[2][m + 1];
    for(int i = 0; i < q; ++i) {
        ll s, t, x, y;
        cin >> s >> t >> x >> y;
        query a;
        a.x = x, a.y = y, a.l = 0, a.r = m, a.m = (a.l + a.r) >> 1, a.num = i;
        a.s = s, a.t = t;
        queries[1][a.m].pb(a);
    }
    for(int iter = 0; iter < 18; ++iter) {
        // coba jalanin paralel binser
        // count: jumlah emas yg digunakan
        int idx = iter & 1;
        for(int i = 0; i < m; ++i)
            queries[idx][i].clear();
        for(auto i : periksa) {
            count.update(in[adj[i.se].fi], out[adj[i.se].fi], 1);
        }
        for(int i = 0; i < m; ++i) {
            // before update di proses dulu
            for(auto j : queries[idx ^ 1][i]) {
                int r = lca(j.s, j.t);
                ll perak = cost.query(in[j.s]) + cost.query(in[j.t]) - 2 * cost.query(in[r]);
                int emas = count.query(in[j.s]) + count.query(in[j.t]) - 2 * count.query(in[r]);       
                //cout << j.num << endl;
                //cout << "INDEX " << i << endl;
                //cout << "PERAK " << perak << " " << j.y << endl;
                //cout << "EMAS " << emas << " " << j.x << endl;
                if(perak <= j.y && emas <= j.x) {
                    ans[j.num] = max(ans[j.num], j.x - emas);
                }
                if(perak <= j.y) {
                    j.l = j.m + 1;
                }
                else {
                    j.r = j.m - 1;
                }
                j.m = (j.l + j.r) >> 1;
                queries[idx][j.m].pb(j);
            }
            // update cost/count
            // u higher depth
            int u = adj[periksa[i].se].fi, v = adj[periksa[i].se].se;
            ll harga = periksa[i].fi;
            count.update(in[u], out[u], -1);
            cost.update(in[u], out[u], harga);
        }
        for(auto j : queries[idx ^ 1][m]) {
            int r = lca(j.s, j.t);
            ll perak = cost.query(in[j.s]) + cost.query(in[j.t]) - 2 * cost.query(in[r]);
            int emas = count.query(in[j.s]) + count.query(in[j.t]) - 2 * count.query(in[r]);       
            //cout << j.num << endl;
            //cout << "INDEX " << i << endl;
            //cout << "PERAK " << perak << " " << j.y << endl;
            //cout << "EMAS " << emas << " " << j.x << endl;
            if(perak <= j.y && emas <= j.x) {
                ans[j.num] = max(ans[j.num], j.x - emas);
            }
            if(perak <= j.y) {
                j.l = j.m + 1;
            }
            else {
                j.r = j.m - 1;
            }
            j.m = (j.l + j.r) >> 1;
            queries[idx][j.m].pb(j);
        }
        memset(cost.a, 0, sizeof(cost.a));
        memset(count.a, 0, sizeof(count.a));
    }
    for(int i = 0; i < q; ++i)
        cout << ans[i] << endl;
    return 0;
}

Compilation message

currencies.cpp: In function 'int main()':
currencies.cpp:167:44: warning: unused variable 'v' [-Wunused-variable]
  167 |             int u = adj[periksa[i].se].fi, v = adj[periksa[i].se].se;
      |                                            ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 3 ms 4436 KB Output is correct
3 Correct 4 ms 4996 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 22 ms 6416 KB Output is correct
6 Correct 29 ms 7736 KB Output is correct
7 Correct 22 ms 7600 KB Output is correct
8 Correct 18 ms 6356 KB Output is correct
9 Correct 18 ms 6348 KB Output is correct
10 Correct 20 ms 6392 KB Output is correct
11 Correct 18 ms 6284 KB Output is correct
12 Correct 18 ms 6292 KB Output is correct
13 Correct 17 ms 5952 KB Output is correct
14 Correct 18 ms 5972 KB Output is correct
15 Correct 19 ms 5932 KB Output is correct
16 Correct 20 ms 5996 KB Output is correct
17 Correct 23 ms 5984 KB Output is correct
18 Correct 20 ms 5976 KB Output is correct
19 Correct 21 ms 7852 KB Output is correct
20 Correct 21 ms 7836 KB Output is correct
21 Correct 21 ms 7784 KB Output is correct
22 Correct 21 ms 7724 KB Output is correct
23 Correct 16 ms 6220 KB Output is correct
24 Correct 17 ms 6356 KB Output is correct
25 Correct 18 ms 6608 KB Output is correct
26 Correct 13 ms 6228 KB Output is correct
27 Correct 13 ms 6356 KB Output is correct
28 Correct 15 ms 6356 KB Output is correct
29 Correct 27 ms 9904 KB Output is correct
30 Correct 18 ms 6356 KB Output is correct
31 Correct 18 ms 6320 KB Output is correct
32 Correct 19 ms 6356 KB Output is correct
33 Correct 15 ms 6064 KB Output is correct
34 Correct 15 ms 5912 KB Output is correct
35 Correct 16 ms 6036 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4436 KB Output is correct
2 Correct 18 ms 6344 KB Output is correct
3 Correct 18 ms 6356 KB Output is correct
4 Correct 22 ms 6356 KB Output is correct
5 Correct 1085 ms 80072 KB Output is correct
6 Correct 1229 ms 110000 KB Output is correct
7 Correct 1273 ms 102412 KB Output is correct
8 Correct 1031 ms 84896 KB Output is correct
9 Correct 1050 ms 76452 KB Output is correct
10 Correct 1619 ms 111764 KB Output is correct
11 Correct 1791 ms 111828 KB Output is correct
12 Correct 1645 ms 111420 KB Output is correct
13 Correct 1681 ms 112020 KB Output is correct
14 Correct 1610 ms 111260 KB Output is correct
15 Correct 1810 ms 113500 KB Output is correct
16 Correct 2105 ms 114264 KB Output is correct
17 Correct 1977 ms 112760 KB Output is correct
18 Correct 2019 ms 113848 KB Output is correct
19 Correct 2023 ms 113532 KB Output is correct
20 Correct 2055 ms 114780 KB Output is correct
21 Correct 1245 ms 115980 KB Output is correct
22 Correct 1289 ms 117012 KB Output is correct
23 Correct 1256 ms 116888 KB Output is correct
24 Correct 1252 ms 116120 KB Output is correct
25 Correct 1363 ms 110640 KB Output is correct
26 Correct 1236 ms 109548 KB Output is correct
27 Correct 1516 ms 111888 KB Output is correct
28 Correct 704 ms 112172 KB Output is correct
29 Correct 672 ms 109184 KB Output is correct
30 Correct 833 ms 103220 KB Output is correct
31 Correct 844 ms 103300 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4936 KB Output is correct
2 Correct 15 ms 6012 KB Output is correct
3 Correct 15 ms 6008 KB Output is correct
4 Correct 15 ms 5972 KB Output is correct
5 Correct 1094 ms 85372 KB Output is correct
6 Correct 1022 ms 89660 KB Output is correct
7 Correct 1084 ms 95236 KB Output is correct
8 Correct 1652 ms 114392 KB Output is correct
9 Correct 1655 ms 114236 KB Output is correct
10 Correct 1624 ms 114624 KB Output is correct
11 Correct 1043 ms 114720 KB Output is correct
12 Correct 1064 ms 114284 KB Output is correct
13 Correct 965 ms 114484 KB Output is correct
14 Correct 570 ms 116004 KB Output is correct
15 Correct 571 ms 116744 KB Output is correct
16 Correct 843 ms 115492 KB Output is correct
17 Correct 780 ms 115832 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 3 ms 4436 KB Output is correct
3 Correct 4 ms 4996 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 22 ms 6416 KB Output is correct
6 Correct 29 ms 7736 KB Output is correct
7 Correct 22 ms 7600 KB Output is correct
8 Correct 18 ms 6356 KB Output is correct
9 Correct 18 ms 6348 KB Output is correct
10 Correct 20 ms 6392 KB Output is correct
11 Correct 18 ms 6284 KB Output is correct
12 Correct 18 ms 6292 KB Output is correct
13 Correct 17 ms 5952 KB Output is correct
14 Correct 18 ms 5972 KB Output is correct
15 Correct 19 ms 5932 KB Output is correct
16 Correct 20 ms 5996 KB Output is correct
17 Correct 23 ms 5984 KB Output is correct
18 Correct 20 ms 5976 KB Output is correct
19 Correct 21 ms 7852 KB Output is correct
20 Correct 21 ms 7836 KB Output is correct
21 Correct 21 ms 7784 KB Output is correct
22 Correct 21 ms 7724 KB Output is correct
23 Correct 16 ms 6220 KB Output is correct
24 Correct 17 ms 6356 KB Output is correct
25 Correct 18 ms 6608 KB Output is correct
26 Correct 13 ms 6228 KB Output is correct
27 Correct 13 ms 6356 KB Output is correct
28 Correct 15 ms 6356 KB Output is correct
29 Correct 27 ms 9904 KB Output is correct
30 Correct 18 ms 6356 KB Output is correct
31 Correct 18 ms 6320 KB Output is correct
32 Correct 19 ms 6356 KB Output is correct
33 Correct 15 ms 6064 KB Output is correct
34 Correct 15 ms 5912 KB Output is correct
35 Correct 16 ms 6036 KB Output is correct
36 Correct 3 ms 4436 KB Output is correct
37 Correct 18 ms 6344 KB Output is correct
38 Correct 18 ms 6356 KB Output is correct
39 Correct 22 ms 6356 KB Output is correct
40 Correct 1085 ms 80072 KB Output is correct
41 Correct 1229 ms 110000 KB Output is correct
42 Correct 1273 ms 102412 KB Output is correct
43 Correct 1031 ms 84896 KB Output is correct
44 Correct 1050 ms 76452 KB Output is correct
45 Correct 1619 ms 111764 KB Output is correct
46 Correct 1791 ms 111828 KB Output is correct
47 Correct 1645 ms 111420 KB Output is correct
48 Correct 1681 ms 112020 KB Output is correct
49 Correct 1610 ms 111260 KB Output is correct
50 Correct 1810 ms 113500 KB Output is correct
51 Correct 2105 ms 114264 KB Output is correct
52 Correct 1977 ms 112760 KB Output is correct
53 Correct 2019 ms 113848 KB Output is correct
54 Correct 2023 ms 113532 KB Output is correct
55 Correct 2055 ms 114780 KB Output is correct
56 Correct 1245 ms 115980 KB Output is correct
57 Correct 1289 ms 117012 KB Output is correct
58 Correct 1256 ms 116888 KB Output is correct
59 Correct 1252 ms 116120 KB Output is correct
60 Correct 1363 ms 110640 KB Output is correct
61 Correct 1236 ms 109548 KB Output is correct
62 Correct 1516 ms 111888 KB Output is correct
63 Correct 704 ms 112172 KB Output is correct
64 Correct 672 ms 109184 KB Output is correct
65 Correct 833 ms 103220 KB Output is correct
66 Correct 844 ms 103300 KB Output is correct
67 Correct 4 ms 4936 KB Output is correct
68 Correct 15 ms 6012 KB Output is correct
69 Correct 15 ms 6008 KB Output is correct
70 Correct 15 ms 5972 KB Output is correct
71 Correct 1094 ms 85372 KB Output is correct
72 Correct 1022 ms 89660 KB Output is correct
73 Correct 1084 ms 95236 KB Output is correct
74 Correct 1652 ms 114392 KB Output is correct
75 Correct 1655 ms 114236 KB Output is correct
76 Correct 1624 ms 114624 KB Output is correct
77 Correct 1043 ms 114720 KB Output is correct
78 Correct 1064 ms 114284 KB Output is correct
79 Correct 965 ms 114484 KB Output is correct
80 Correct 570 ms 116004 KB Output is correct
81 Correct 571 ms 116744 KB Output is correct
82 Correct 843 ms 115492 KB Output is correct
83 Correct 780 ms 115832 KB Output is correct
84 Correct 1129 ms 80596 KB Output is correct
85 Correct 1048 ms 86444 KB Output is correct
86 Correct 1030 ms 90400 KB Output is correct
87 Correct 1835 ms 111448 KB Output is correct
88 Correct 1812 ms 111876 KB Output is correct
89 Correct 1793 ms 112312 KB Output is correct
90 Correct 1773 ms 112144 KB Output is correct
91 Correct 1759 ms 112188 KB Output is correct
92 Correct 2102 ms 112744 KB Output is correct
93 Correct 1960 ms 113016 KB Output is correct
94 Correct 2228 ms 113380 KB Output is correct
95 Correct 2514 ms 113764 KB Output is correct
96 Correct 2218 ms 113636 KB Output is correct
97 Correct 2331 ms 113640 KB Output is correct
98 Correct 1743 ms 116084 KB Output is correct
99 Correct 1767 ms 114660 KB Output is correct
100 Correct 1551 ms 115248 KB Output is correct
101 Correct 1667 ms 116000 KB Output is correct
102 Correct 1587 ms 111812 KB Output is correct
103 Correct 1572 ms 111640 KB Output is correct
104 Correct 1510 ms 112620 KB Output is correct
105 Correct 784 ms 102916 KB Output is correct
106 Correct 789 ms 105128 KB Output is correct
107 Correct 946 ms 102064 KB Output is correct
108 Correct 849 ms 102036 KB Output is correct