# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308386 | kylych03 | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 0 ms | 0 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 <vector>
#include <bits/stdc++.h>
#include "messy.h"
//#include "grader.cpp"
vector<int> restore_permutation(int n, int w, int r) {
string s;
vector <int > vec;
for(int i =0; i < n ;i++)
s=s+'0';
for(int i = 0 ; i < n;i++){
s[i]='1';
add_element(s);
}
vec.resize(n);
compile_set();
for(int i =0; i <n ;i++)
s[i]='0';
int cnt = 0;
while(cnt < n){
for(int i = 0 ; i < n;i++){
if(s[i]=='0'){
s[i]='1';
if(check_element(s)){
vec[i]=cnt+1;
cnt++;
break;
}
else
s[i]='0';
}
}
}
return vec;
}