# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757713 | ttamx | Two Currencies (JOI23_currencies) | C++14 | 1038 ms | 130536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const bool dbg=false;
const int N=1e5+5;
struct node{
ll val;
int freq;
node *l,*r;
node():val(0),freq(0),l(nullptr),r(nullptr){}
node(int val,int freq):val(val),freq(freq),l(nullptr),r(nullptr){}
node(int val,int freq,node *l,node *r):val(val),freq(freq),l(l),r(r){}
};
typedef node* nodeptr;
void build(int l,int r,nodeptr &t){
t=new node();
if(l==r)return;
int m=(l+r)/2;
build(l,m,t->l);
build(m+1,r,t->r);
}
void update(int l,int r,nodeptr &t,nodeptr k,int x,ll val){
t=new node(*k);
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... |