# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
771565 | ttamx | Mechanical Doll (IOI18_doll) | C++14 | 79 ms | 12760 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;
void create_circuit(int m,vector<int> a) {
int n = a.size();
vector<int> c(m+1);
vector<int> lg(n+1);
for(int i=2;i<=n;i++)lg[i]=lg[i/2]+1;
c[0]=a[0];
vector<int> x,y;
auto add=[&](int u,int v){
x.emplace_back(u);
y.emplace_back(v);
return -x.size();
};
vector<vector<int>> vec(m+1);
a.emplace_back(0);
for(int i=0;i<n;i++)vec[a[i]].emplace_back(a[i+1]);
for(int i=1;i<=m;i++){
int sz=vec[i].size();
if(sz==0){
c[i]=0;
continue;
}
if(sz==1){
c[i]=vec[i][0];
continue;
}
int lv=lg[sz-1]+1;
vector<int> res;
int cnt=1<<(lv-1);
int tar=-(x.size()+(1<<lv)-1);
int st=(1<<lv)-sz+1;
for(int k=1;k<=cnt;k++){
int u=k;
int v=k+cnt;
res.emplace_back(add(u<st?tar:vec[i][u-st],v<st?tar:vec[i][v-st]));
}
while(res.size()>1){
vector<int> tmp;
for(int i=0;i<res.size();i+=2)tmp.emplace_back(add(res[i],res[i+1]));
res=tmp;
}
c[i]=res[0];
assert(res[0]==tar);
}
answer(c,x,y);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |