# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78725 | nxteru | Bulldozer (JOI17_bulldozer) | C++14 | 545 ms | 66556 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 <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
struct segtree{
ll s[1<<12],ma[1<<12],mi[1<<12];
void init(void){
for(int i=0;i<1<<12;i++){
s[i]=0;
ma[i]=-INF;
mi[i]=INF;
}
}
void up(int a,ll x){
a+=(1<<11)-1;
ma[a]=x;
mi[a]=x;
while(a>0){
a=(a-1)/2;
ma[a]=max(ma[a*2+1],ma[a*2+2]);
mi[a]=min(mi[a*2+1],mi[a*2+2]);
s[a]=max(max(s[a*2+1],s[a*2+2]),ma[a*2+2]-mi[a*2+1]);
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... |