# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1124667 | Tyx2019 | Two Currencies (JOI23_currencies) | C++20 | 1602 ms | 1114112 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, ladd;
node *l, *r;
//range add, point query
node(int _S, int _E, int _V = 0, int _ladd = 0){
S = _S;
E = _E;
V = _V;
ladd = _ladd;
l = r = NULL;
M = (S + E) >> 1;
}
node(node *other){
S = other->S;
E = other->E;
V = other->V;
ladd = other->V;
l = other->l;
r = other->r;
M = other->M;
}
void prop(){
if(S == E) return;
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... |