# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31042 | TAMREF | 트리 (KOI16_tree) | C++11 | 929 ms | 51424 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;
const int mx=400005, ms=1049000;
struct Segtree{
int arr[mx], seg[ms];
int n, l, r, i, v;
int _geti(){
int now=1,s=0,e=n-1;
while(s<=e){
if(seg[now]){
if(s==e) arr[s]=max(arr[s],seg[now]);
else{
seg[now<<1]=max(seg[now<<1],seg[now]);
seg[now<<1|1]=max(seg[now<<1|1],seg[now]);
}
seg[now]=0;
}
if(s==e) return arr[s];
int m=(s+e)>>1;
now<<=1;
i>m?(now|=1,s=m+1):e=m;
}
}
int geti(int _i){
i=_i;
return _geti();
}
void _upd(int now, int s, int e){
if(seg[now]){
if(s==e) arr[s]=max(arr[s],seg[now]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |