# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416717 | rumen_m | Mechanical Doll (IOI18_doll) | C++17 | 150 ms | 12928 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 "doll.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
int m,n;
std::vector<int> C;
int num;
vector <int> X,Y;
int times[400004];
const int inf = 1e7;
void solve(int v, int from, int to)
{
// cout<<v<<" "<<from<<" "<<to<<endl;
X.push_back(-1);
Y.push_back(-1);
int mid = (from+to)/2;
if(from<mid&&from<n)
{
num++;
Y[v]=-num-1;
solve(num,from,mid);
}
else
{
if(n<=from)Y[v] = inf;
else
Y[v]=-1;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |