# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150242 | emptypringlescan | Real Mountains (CCO23_day1problem2) | C++20 | 2935 ms | 219596 KiB |
#include <bits/stdc++.h>
using namespace std;
const long long mod=1000003;
int n;
long long arr[1000005],ans;
struct node{
int s,e,m;
node *l,*r;
long long val;
node(int S, int E){
s=S; e=E; m=(s+e)/2;
if(s!=e){
l=new node(s,m);
r=new node(m+1,e);
val=min(l->val,r->val);
}
else val=arr[s];
}
void update(int S, long long V){
if(s==e){
val=V;
return;
}
if(S<=m) l->update(S,V);
else r->update(S,V);
val=min(l->val,r->val);
}
long long query(int S, int E){
if(S<=s&&e<=E) return val;
if(E<=m) return l->query(S,E);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |