# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235178 | moondarkside | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 0 ms | 0 KiB |
void add_element(string x);
void compile_set();
bool check_element(string x);
void AddT(int pos,vector<bool>& Base,int n){
string test;
for(int i=0;i<n;i++){
test+='0' + (Base[i] ^ (pos==i));
}
add_element(test);
}
bool CheckT(int pos,vector<bool>& Base,int n){
string test;
for(int i=0;i<n;i++){
test+='0' + (Base[i] ^ (pos==i));
}
return check_element(test);
}
vector<int> restore_permutation(int n, int w, int r){
vector<bool> Base(n,false);
for(int i=0;i<6;i++){
vector<bool> NewBase=Base;
int mult=1<<i;
for(int j=0;j<n;j++){
if((j & mult) !=0){
NewBase[j]=1;
AddT(j,Base,n);
}
}
Base=NewBase;
}
Base = vector<bool>(n,true);
int mult=n/2;
for(int j=0;j<n;j++){
if((j & mult) !=0){
AddT(j,Base,n);
}
}
compile_set();
vector<int> Permutation(n,0);
Base = vector<bool>(n,false);
for(int i=0;i<6;i++){
vector<bool> NewBase=Base;
int mult=1<<i;
for(int j=0;j<n;j++){
if(CheckT(j,Base,n)){
NewBase[j]=1;
Permutation[j]+=mult;
}
}
Base=NewBase;
}
Base = vector<bool>(n,true);
mult=n/2;
for(int j=0;j<n;j++){
if(CheckT(j,Base,n)){
Permutation[j]+=mult;
}
}
return Permutation;
}