# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26554 | model_code | Bulldozer (JOI17_bulldozer) | C++11 | 539 ms | 50068 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>
using namespace std;
typedef long long ll;
const int MAX_N = 4002;
const int seg_siz = 1<<13;
const ll INF = 10000000000000;
struct SEG{
ll s[seg_siz],t[seg_siz],u[seg_siz];
int siz = seg_siz>>1;
void init(){
for(int i = 0 ; i < siz*2-1 ; i ++){
s[i] = -INF;
t[i] = INF;
u[i] = 0;
}
}
void update(int k,ll x){
k += siz-1;
s[k] = x;
t[k] = x;
while(k > 0){
k = (k-1)/2;
s[k] = max(s[2*k+1],s[2*k+2]);
t[k] = min(t[2*k+1],t[2*k+2]);
u[k] = max(u[2*k+1],u[2*k+2]);
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... |