# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49147 | 3zp | Cake (CEOI14_cake) | C++14 | 1569 ms | 18644 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>
#pragma GCC optimize ("O3")
using namespace std;
int A[2000009];
int T[2000009];
void build(int x, int l, int r){
if(l == r){
T[x] = A[l];
return;
}
int mid = (l + r) /2;
build(2*x+1, l , mid);
build(2*x+2, mid + 1, r );
T[x] = max(T[2*x+2], T[2*x+1]);
}
void upd(int x, int l, int r, int p, int v){
if(l > p || r < p) return;
if(l == r){
T[x] = v;
return;
}
int mid = (l + r)/2;
upd(2*x+1,l,mid,p,v);
upd(2*x+2,mid+1,r,p,v);
T[x] = max(T[2*x+2], T[2*x+1]);
}
int fin1(int x, int l, int r, int A){
if(l == r) return l;
int mid = (l + r)/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... |