# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125074 | Tyx2019 | Two Currencies (JOI23_currencies) | C++20 | 2567 ms | 361896 KiB |
#include <bits/stdc++.h>
#define int long long
#define debug(x) if(0) cout << #x << " is " << x << endl;
using namespace std;
int N, M, Q;
struct node{
int32_t S, E, M;
int V;
node *l, *r;
//range add, point query
node(int _S, int _E){
S = _S;
E = _E;
V = 0;
l = r = NULL;
M = (S + E) >> 1;
}
node* cpy(){
node *ret = new node(S, E);
ret->S = S;
ret->E = E;
ret->l = l;
ret->r = r;
ret->M = M;
ret->V = V;
return ret;
}
int query(int start, int end){
if(start == S && end == E){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |