# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609751 | sword060 | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 1 ms | 340 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 "messy.h";
#include <bits/stdc++.h>
using namespace std;
vector<int> restore_permutation(int x, int w, int r){
vector<int> ans(x);
for(int i=0;i<x;i++)ans[i]=i+1;
string p="";
for(int i=0;i<x;i++)p+='0';
for(int i=0;i<p.size()-1;i++){
p[i]='1';p[i+1]='1';
add_element(p);
p[i]='0';p[i+1]='0';
}
compile_set();
string lst="-1";
bool m=0;
for(int i=1;i<=min(r,(1<<x));i++){
string l="";
int xd=i,zz=x;
while(zz--)l+=(xd%2?'1':'0'),xd/=2;
reverse(l.begin(),l.end());
bool f=check_element(l);
if(!f)continue;
for(int i=0;i<x;i++){
if(l[i]!='1'||i==x-1||l[i+1]!='1')continue;
for(int j=i+2;j<x;j++){
if(l[j]=='1'){
swap(ans[j],ans[i+1]);
}
}
}
lst=l;
}
return ans;
}
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... |