# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198363 | DavidDamian | Mechanical Doll (IOI18_doll) | C++11 | 204 ms | 42044 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;
#define debug(x) cerr<<#x<<" = "<<x<<endl
struct parent
{
int p,edge;
};
vector<int> Exits[1000006];
vector<int> X;
vector<int> Y;
map<int,parent> memo;
int NEXT_FREE_INDEX=1;
void createTree(int root,int i,int lv,int limit,int sum,int unused)
{
if(lv==limit-1){ //Last level of switches
if(unused==1)
X.push_back(-root);
else{
X.push_back(sum);
parent x={i,0};
memo[sum]=x;
}
sum+=(1<<lv);
parent x={i,1};
Y.push_back(sum);
memo[sum]=x;
}
else{
int child_size=(1<<(limit-lv-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... |