# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101440 | cheeheng | Cake (CEOI14_cake) | C++14 | 2045 ms | 15764 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;
typedef pair<int, int> ii;
int d[250005];
int o[250005];
int N, a;
set<ii, greater<ii> > di;
set<int> rank1;
void sim(int a){
int l = a;
int r = a;
o[a] = 0;
int cnt = 1;
for(int i = 1; i < N; i ++){
int tempL = l-1;
int tempR = r+1;
if(tempL == -1){
r = tempR;
o[tempR] = cnt++;
//printf("o[%d] = %d\n", tempR, cnt-1);
}else if(tempR == N){
l = tempL;
o[tempL] = cnt++;
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... |