# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25712 | gs14004 | Cake (CEOI14_cake) | C++11 | 706 ms | 13472 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 <cstdio>
#include <stack>
#include <utility>
#include <set>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;
int n,p,q;
int d[250005];
pi a[250005];
stack<pi> st;
struct tree1{
int tree[530000], lim;
void init(){
for(lim = 1; lim <= p; lim <<= 1);
for(int i=1; i<p; i++){
tree[i+lim] = i;
}
for(int i=lim; i; i--){
if(d[tree[2*i]] < d[tree[2*i+1]]){
tree[i] = tree[2*i+1];
}
else tree[i] = tree[2*i];
}
}
void upd(int p){
p += lim;
while(p > 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... |