Submission #946008

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
946008	2024-03-14 09:32:12	peteza	Two Currencies (JOI23_currencies)	C++14	100 / 100	664 ms	124904 KiB

currencies

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct node {
    node *l = NULL, *r = NULL;
    int sz = 0;
    ll sum = 0;
} *root[100005];
int n, m, q;
ll a, b, c, d;
pair<int, int> edges[100005];
vector<int> prices[100005];
vector<int> adj[100005];
int par[100005][22], dep[100005];
node* build(int l, int r) {
    auto it = new node();
    if(l == r) return it;
    int mid = (l+r) >> 1;
    it->l = build(l, mid); it->r = build(mid+1, r);
    return it;
}
node *upd(node*&old, int l, int r, int tgt, int val) {
    auto it = new node();
    if(l == r) {it->sz=1; it->sum = val; return it;}
    int mid = (l+r) >> 1;
    if(tgt <= mid) it->l = upd(old->l, l, mid, tgt, val), it->r = old->r;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 28 / 28
• Subtask 3: 30 / 30
• Subtask 4: 32 / 32