# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587094 | jasmin | Mechanical Doll (IOI18_doll) | C++14 | 113 ms | 13756 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;
#include<doll.h>
const int inf=1e9+7;
/*void answer(vector<int> c, vector<int> x, vector<int> y){
cout << c.size() << "\n";
for(auto e: c){
cout << e << " ";
}
cout << "\n";
cout << x.size() << "\n";
for(int i=0; i<(int)x.size(); i++){
cout << x[i] << " " << y[i] << "\n";
}
}*/
int pow2(int x){
int ans=1;
while(ans<x){
ans*=2;
}
return ans;
}
void make_tree(int v, int h, int n, vector<int>& num){
if((1<<h)>=n) return;
num[v*2+1]=num[v];
num[v*2+2]=num[v]+(1<<h);
# | 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... |