# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118696 | giaminh2211 | Advertisement 2 (JOI23_ho_t2) | C++14 | 331 ms | 30444 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>
#define fi first
#define se second
using namespace std;
using ll=long long;
const int N=5e5+13;
struct Segtree{
int st[N << 2];
Segtree(){
fill(begin(st), end(st), -INT_MAX);
}
void update(int id, int l, int r, int i, int val){
if(l > i || r < i) return;
if(l==r){
st[id]=max(st[id], val);
return;
}
int mid=l+r >> 1;
update(id << 1, l, mid, i, val);
update(id << 1 | 1, mid+1, r, i, val);
st[id]=max(st[id << 1], st[id << 1 | 1]);
}
int get(int id, int l, int r, int u, int v){
if(l > v || r < u) return -INT_MAX;
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... |