# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
130284 | UserIsUndefined | Rice Hub (IOI11_ricehub) | C++11 | 1073 ms | 2172 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>
#include <iostream>
#include <algorithm>
#include <vector>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
int X[100005];
int D[100005];
bool visited[100005];
int gethalf(int n){
int hal = (n)/2;
D[0] = hal;
int ind = 1;
for (int i = 1 ; i < n/2+2 ; i++){
if (hal+i < n){
D[ind] = hal+i;
ind++;
}
if (hal-i >= 0){
D[ind] = hal-i;
ind++;
}
}
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... |