# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057739 | 1ne | 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 "messy.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> restore_permutation(int n, int w, int r) {
string s;
for (int i = 0;i<n;++i){
s+='0';
}
for (int i = 0;i<n;++i){
s[i] = '1';
add_element(s);
}
compile_set();
vector<int>pos(n,-1);
string cur;
for (int i = 0;i<n;++i){
cur+='0';
}
for (int i = 0;i<n;++i){
int left = 0,right = n - 1,pos = -1;
while(left<=right){
int mid = (left + right)>>1;
string new_cur = cur;
for (int j = 0;j<=mid;++j){
new_cur[j] = '1';
}
if (check_element(new_cur)){
right = mid - 1;
pos = mid;
}
else{
left = mid + 1;
}
}
//cur_bit is in the region between 0...pos
//pos is not the last bit of the given bits of numbers
//
for (int j = 0;j<=pos;++j){
if (cur[j] == '1')continue;
cur[j] = '1';
if (check_element(cur)){
pos[i] = j;
break;
}
cur[j] = '0';
}
}
vector<int>inv(n);
for (int i = 0;i<n;++i){
inv[pos[i]] = i;
}
return inv;
}