oj.uz

Submission #958940

# Submission time Handle Problem Language Result Execution time Memory
958940 2024-04-07T08:19:12 Z Valaki2 Two Currencies (JOI23_currencies) C++14
100 / 100
 1532 ms 59272 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int maxn = 1e5 + 1;

int n, m, q;
vector<pii > ori_graph[1 + maxn];
int conv[1 + maxn];
vector<pii > graph[1 + maxn];
int road[1 + maxn];
int cost[1 + maxn];
vector<int> by_road[1 + maxn];
int node_cnt;
int from[1 + maxn];
int to[1 + maxn];
int gold[1 + maxn];
int silver[1 + maxn];

void virtual_dfs(int cur, int par) {
    for(pii nei : ori_graph[cur]) {
        if(nei.fi == par) {
            continue;
        }
        if(by_road[nei.se].empty()) {
            conv[nei.fi] = conv[cur];
            virtual_dfs(nei.fi, cur);
        } else {
            int last = conv[cur];
            for(int check_id : by_road[nei.se]) {
                node_cnt++;
                int nxt = node_cnt;
                graph[last].pb(mp(nxt, check_id));
                graph[nxt].pb(mp(last, check_id));
                last = nxt;
            }
            conv[nei.fi] = last;
            virtual_dfs(nei.fi, cur);
        }
    }
}

int visit_time;
int in[1 + maxn];
int out[1 + maxn];
int par_edge[1 + maxn];
int which[1 + 2 * maxn];

void dfs_euler(int cur, int par) {
    visit_time++;
    in[cur] = visit_time;
    for(pii nei : graph[cur]) {
        if(nei.fi == par) {
            par_edge[cur] = nei.se;
        } else {
            dfs_euler(nei.fi, cur);
        }
    }
    visit_time++;
    out[cur] = visit_time;
}

const int block_size = 320;
const int blocks = 320;

int block(int pos) {
    return (pos - 1) / block_size + 1;
}

struct query {
    int l, r, idx;
    bool except;
    bool operator < (const query &other) const {
        if(block(l) != block(other.l)) {
            return block(l) < block(other.l);
        }
        return r < other.r;
    }
};

int ans[1 + maxn];
bool counted_in[1 + maxn];
int block_sum[1 + maxn];
int single_sum[1 + 2 * maxn];
int block_cnt[1 + maxn];
int single_cnt[1 + 2 * maxn];
int ord[1 + maxn];
int ord_cost[1 + maxn];
int total_cnt;

void add(int cur) {
    cur = par_edge[cur];
    cur = ord[cur];
    block_sum[block(cur)] += ord_cost[cur];
    single_sum[cur] += ord_cost[cur];
    block_cnt[block(cur)]++;
    single_cnt[cur]++;
    total_cnt++;
}

void rem(int cur) {
    cur = par_edge[cur];
    cur = ord[cur];
    block_sum[block(cur)] -= ord_cost[cur];
    single_sum[cur] -= ord_cost[cur];
    block_cnt[block(cur)]--;
    single_cnt[cur]--;
    total_cnt--;
}

void toggle(int cur) {
    cur = which[cur];
    if(cur == 1) {
        return;
    }
    if(!counted_in[cur]) {
        add(cur);
        counted_in[cur] = true;
    } else {
        rem(cur);
        counted_in[cur] = false;
    }
}

void solve_queries() {
    vector<query> queries;
    for(int i = 1; i <= q; i++) {
        int a = from[i], b = to[i];
        if(in[a] > in[b]) {
            swap(a, b);
        }
        if(in[a] <= in[b] && out[b] <= out[a]) {
            queries.pb(query {in[a], in[b], i, true});
        } else {
            queries.pb(query {out[a], in[b], i, false});
        }
    }
    sort(queries.begin(), queries.end());
    int l = 1, r = 0;
    for(query cur : queries) {
        if(from[cur.idx] == to[cur.idx]) {
            ans[cur.idx] = gold[cur.idx];
            continue;
        }
        while(l > cur.l) {
            l--;
            toggle(l);
        }
        while(r < cur.r) {
            r++;
            toggle(r);
        }
        while(l < cur.l) {
            toggle(l);
            l++;
        }
        while(r > cur.r) {
            toggle(r);
            r--;
        }
        if(cur.except) {
            toggle(l);
        }
        int limit = silver[cur.idx];
        /*if(cur.idx == 1) {
            cout << from[cur.idx] << " " << to[cur.idx] << "\n";
            cout << total_cnt << "\n";
            for(int i = 1; i <= m; i++) {
                cout << counted_in[i];
            }
            cout << "\n";
        }*/
        int cur_sum = 0, cur_cnt = 0;
        int res = 0;
        for(int i = 1; i <= blocks; i++) {
            if(cur_sum + block_sum[i] <= limit) {
                cur_sum += block_sum[i];
                cur_cnt += block_cnt[i];
            } else {
                for(int j = block_size * (i - 1) + 1; j <= block_size * i; j++) {
                    if(cur_sum <= limit) {
                        // if(cur.idx == 1) cout << "! " << res << " " << cur_cnt << "\n";
                        res = max(res, cur_cnt);
                    } else {
                        break;
                    }
                    if(cur.idx == 1) {
                        // cout << j << " - " << single_sum[j] << " - " << single_cnt[j] << "\n";
                        // pedig kellene kiirnia valamit
                    }
                    cur_sum += single_sum[j];
                    cur_cnt += single_cnt[j];
                }
            }
        }
        if(cur_sum <= limit) {
            // if(cur.idx == 1) cout << "! " << res << " " << cur_cnt << "\n";
            res = max(res, cur_cnt);
        }
        res = total_cnt - res;
        res = gold[cur.idx] - res;
        if(res < 0) {
            res = -1;
        }
        ans[cur.idx] = res;
        if(cur.except) {
            toggle(l);
        }
    }
}

void solve() {
    cin >> n >> m >> q;
    for(int i = 1; i <= n - 1; i++) {
        int a, b;
        cin >> a >> b;
        ori_graph[a].pb(mp(b, i));
        ori_graph[b].pb(mp(a, i));
    }
    for(int i = 1; i <= m; i++) {
        cin >> road[i] >> cost[i];
        by_road[road[i]].pb(i);
    }
    for(int i = 1; i <= q; i++) {
        cin >> from[i] >> to[i] >> gold[i] >> silver[i];
    }
    conv[1] = 1;
    node_cnt = 1;
    virtual_dfs(1, -1);
    /*for(int i = 1; i <= n; i++) {
        cout << conv[i] << " ";
    }
    cout << "\n" << node_cnt << "\n";
    for(int i = 1; i <= m + 1; i++) {
        cout << i << ":\n";
        for(pii j : graph[i]) {
            cout << j.fi << " " << j.se << "; ";
        }
        cout << "\n";
    }*/
    n = m + 1;
    for(int i = 1; i <= q; i++) {
        from[i] = conv[from[i]];
        to[i] = conv[to[i]];
    }
    dfs_euler(1, -1);
    for(int i = 1; i <= n; i++) {
        which[in[i]] = which[out[i]] = i;
    }
    vector<pii > cost_order;
    for(int i = 1; i <= m; i++) {
        cost_order.pb(mp(cost[i], i));
    }
    sort(cost_order.begin(), cost_order.end());
    for(int i = 0; i < m; i++) {
        ord[cost_order[i].se] = i + 1;
        ord_cost[i + 1] = cost_order[i].fi;
    }
    /*for(int i = 1; i <= m; i++) {
        cout << ord[i] << " " << ord_cost[i] << "\n";
    }
    cout << "\n";*/
    solve_queries();
    for(int i = 1; i <= q; i++) {
        cout << ans[i] << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21596 KB Output is correct
2 Correct 4 ms 21596 KB Output is correct
3 Correct 4 ms 21596 KB Output is correct
4 Correct 4 ms 21596 KB Output is correct
5 Correct 8 ms 22108 KB Output is correct
6 Correct 8 ms 22108 KB Output is correct
7 Correct 10 ms 22112 KB Output is correct
8 Correct 8 ms 22104 KB Output is correct
9 Correct 12 ms 22108 KB Output is correct
10 Correct 8 ms 22108 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 10 ms 22108 KB Output is correct
13 Correct 8 ms 22584 KB Output is correct
14 Correct 8 ms 22364 KB Output is correct
15 Correct 11 ms 22364 KB Output is correct
16 Correct 8 ms 22364 KB Output is correct
17 Correct 11 ms 22172 KB Output is correct
18 Correct 8 ms 22364 KB Output is correct
19 Correct 8 ms 22108 KB Output is correct
20 Correct 9 ms 22104 KB Output is correct
21 Correct 9 ms 22108 KB Output is correct
22 Correct 7 ms 22108 KB Output is correct
23 Correct 7 ms 22364 KB Output is correct
24 Correct 8 ms 22364 KB Output is correct
25 Correct 7 ms 22360 KB Output is correct
26 Correct 7 ms 22108 KB Output is correct
27 Correct 6 ms 22108 KB Output is correct
28 Correct 7 ms 22108 KB Output is correct
29 Correct 7 ms 22104 KB Output is correct
30 Correct 9 ms 22348 KB Output is correct
31 Correct 8 ms 22108 KB Output is correct
32 Correct 12 ms 22284 KB Output is correct
33 Correct 8 ms 22364 KB Output is correct
34 Correct 8 ms 22620 KB Output is correct
35 Correct 8 ms 22496 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 21592 KB Output is correct
2 Correct 8 ms 22108 KB Output is correct
3 Correct 11 ms 22108 KB Output is correct
4 Correct 11 ms 22368 KB Output is correct
5 Correct 1170 ms 41788 KB Output is correct
6 Correct 1004 ms 41484 KB Output is correct
7 Correct 770 ms 40476 KB Output is correct
8 Correct 644 ms 38872 KB Output is correct
9 Correct 731 ms 38584 KB Output is correct
10 Correct 1422 ms 44608 KB Output is correct
11 Correct 1514 ms 44744 KB Output is correct
12 Correct 1490 ms 44592 KB Output is correct
13 Correct 1513 ms 44996 KB Output is correct
14 Correct 1457 ms 44592 KB Output is correct
15 Correct 538 ms 58172 KB Output is correct
16 Correct 606 ms 58444 KB Output is correct
17 Correct 558 ms 56896 KB Output is correct
18 Correct 1165 ms 44608 KB Output is correct
19 Correct 1158 ms 44856 KB Output is correct
20 Correct 1216 ms 44820 KB Output is correct
21 Correct 1365 ms 44216 KB Output is correct
22 Correct 1408 ms 43320 KB Output is correct
23 Correct 1320 ms 43456 KB Output is correct
24 Correct 1374 ms 43456 KB Output is correct
25 Correct 349 ms 46784 KB Output is correct
26 Correct 269 ms 46656 KB Output is correct
27 Correct 210 ms 46736 KB Output is correct
28 Correct 159 ms 44860 KB Output is correct
29 Correct 157 ms 44612 KB Output is correct
30 Correct 1275 ms 45120 KB Output is correct
31 Correct 1233 ms 45120 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 21596 KB Output is correct
2 Correct 8 ms 22364 KB Output is correct
3 Correct 10 ms 22576 KB Output is correct
4 Correct 8 ms 22620 KB Output is correct
5 Correct 277 ms 52112 KB Output is correct
6 Correct 242 ms 51004 KB Output is correct
7 Correct 451 ms 48160 KB Output is correct
8 Correct 479 ms 58940 KB Output is correct
9 Correct 518 ms 59272 KB Output is correct
10 Correct 530 ms 59152 KB Output is correct
11 Correct 270 ms 58108 KB Output is correct
12 Correct 286 ms 59068 KB Output is correct
13 Correct 271 ms 58580 KB Output is correct
14 Correct 160 ms 59204 KB Output is correct
15 Correct 176 ms 58484 KB Output is correct
16 Correct 465 ms 58512 KB Output is correct
17 Correct 441 ms 58536 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21596 KB Output is correct
2 Correct 4 ms 21596 KB Output is correct
3 Correct 4 ms 21596 KB Output is correct
4 Correct 4 ms 21596 KB Output is correct
5 Correct 8 ms 22108 KB Output is correct
6 Correct 8 ms 22108 KB Output is correct
7 Correct 10 ms 22112 KB Output is correct
8 Correct 8 ms 22104 KB Output is correct
9 Correct 12 ms 22108 KB Output is correct
10 Correct 8 ms 22108 KB Output is correct
11 Correct 9 ms 22364 KB Output is correct
12 Correct 10 ms 22108 KB Output is correct
13 Correct 8 ms 22584 KB Output is correct
14 Correct 8 ms 22364 KB Output is correct
15 Correct 11 ms 22364 KB Output is correct
16 Correct 8 ms 22364 KB Output is correct
17 Correct 11 ms 22172 KB Output is correct
18 Correct 8 ms 22364 KB Output is correct
19 Correct 8 ms 22108 KB Output is correct
20 Correct 9 ms 22104 KB Output is correct
21 Correct 9 ms 22108 KB Output is correct
22 Correct 7 ms 22108 KB Output is correct
23 Correct 7 ms 22364 KB Output is correct
24 Correct 8 ms 22364 KB Output is correct
25 Correct 7 ms 22360 KB Output is correct
26 Correct 7 ms 22108 KB Output is correct
27 Correct 6 ms 22108 KB Output is correct
28 Correct 7 ms 22108 KB Output is correct
29 Correct 7 ms 22104 KB Output is correct
30 Correct 9 ms 22348 KB Output is correct
31 Correct 8 ms 22108 KB Output is correct
32 Correct 12 ms 22284 KB Output is correct
33 Correct 8 ms 22364 KB Output is correct
34 Correct 8 ms 22620 KB Output is correct
35 Correct 8 ms 22496 KB Output is correct
36 Correct 4 ms 21592 KB Output is correct
37 Correct 8 ms 22108 KB Output is correct
38 Correct 11 ms 22108 KB Output is correct
39 Correct 11 ms 22368 KB Output is correct
40 Correct 1170 ms 41788 KB Output is correct
41 Correct 1004 ms 41484 KB Output is correct
42 Correct 770 ms 40476 KB Output is correct
43 Correct 644 ms 38872 KB Output is correct
44 Correct 731 ms 38584 KB Output is correct
45 Correct 1422 ms 44608 KB Output is correct
46 Correct 1514 ms 44744 KB Output is correct
47 Correct 1490 ms 44592 KB Output is correct
48 Correct 1513 ms 44996 KB Output is correct
49 Correct 1457 ms 44592 KB Output is correct
50 Correct 538 ms 58172 KB Output is correct
51 Correct 606 ms 58444 KB Output is correct
52 Correct 558 ms 56896 KB Output is correct
53 Correct 1165 ms 44608 KB Output is correct
54 Correct 1158 ms 44856 KB Output is correct
55 Correct 1216 ms 44820 KB Output is correct
56 Correct 1365 ms 44216 KB Output is correct
57 Correct 1408 ms 43320 KB Output is correct
58 Correct 1320 ms 43456 KB Output is correct
59 Correct 1374 ms 43456 KB Output is correct
60 Correct 349 ms 46784 KB Output is correct
61 Correct 269 ms 46656 KB Output is correct
62 Correct 210 ms 46736 KB Output is correct
63 Correct 159 ms 44860 KB Output is correct
64 Correct 157 ms 44612 KB Output is correct
65 Correct 1275 ms 45120 KB Output is correct
66 Correct 1233 ms 45120 KB Output is correct
67 Correct 4 ms 21596 KB Output is correct
68 Correct 8 ms 22364 KB Output is correct
69 Correct 10 ms 22576 KB Output is correct
70 Correct 8 ms 22620 KB Output is correct
71 Correct 277 ms 52112 KB Output is correct
72 Correct 242 ms 51004 KB Output is correct
73 Correct 451 ms 48160 KB Output is correct
74 Correct 479 ms 58940 KB Output is correct
75 Correct 518 ms 59272 KB Output is correct
76 Correct 530 ms 59152 KB Output is correct
77 Correct 270 ms 58108 KB Output is correct
78 Correct 286 ms 59068 KB Output is correct
79 Correct 271 ms 58580 KB Output is correct
80 Correct 160 ms 59204 KB Output is correct
81 Correct 176 ms 58484 KB Output is correct
82 Correct 465 ms 58512 KB Output is correct
83 Correct 441 ms 58536 KB Output is correct
84 Correct 1255 ms 41276 KB Output is correct
85 Correct 970 ms 39492 KB Output is correct
86 Correct 556 ms 37288 KB Output is correct
87 Correct 1487 ms 44600 KB Output is correct
88 Correct 1532 ms 44604 KB Output is correct
89 Correct 1474 ms 44648 KB Output is correct
90 Correct 1525 ms 44864 KB Output is correct
91 Correct 1481 ms 44636 KB Output is correct
92 Correct 536 ms 54332 KB Output is correct
93 Correct 525 ms 57312 KB Output is correct
94 Correct 1216 ms 44736 KB Output is correct
95 Correct 1064 ms 45628 KB Output is correct
96 Correct 1206 ms 45124 KB Output is correct
97 Correct 1210 ms 45124 KB Output is correct
98 Correct 1292 ms 44344 KB Output is correct
99 Correct 1299 ms 43452 KB Output is correct
100 Correct 1346 ms 43440 KB Output is correct
101 Correct 1405 ms 43708 KB Output is correct
102 Correct 269 ms 47068 KB Output is correct
103 Correct 223 ms 46576 KB Output is correct
104 Correct 404 ms 46564 KB Output is correct
105 Correct 170 ms 45296 KB Output is correct
106 Correct 186 ms 44540 KB Output is correct
107 Correct 1250 ms 44736 KB Output is correct
108 Correct 1245 ms 45224 KB Output is correct