# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585440 | IvanJ | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 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<bits/stdc++.h>
#include "messy.h"
#define pb push_back
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
//add_element("0");
//compile_set();
//check_element("0");
vector<int> p, d(n, 0);
string s = "";
for(int i = 0;i < n;i++) s += "0";
for(int i = 1;i < n;i++)
s[i - 1] = '1', add_element(s);
compile_set();
s = "";
int cnt = 0;
for(int i = 0;i < n;i++) s += "0";
for(int i = 1;i < n;i++) {
for(int j = 0;j < n;j++) {
if(s[j] == '1') continue;
s[j] = '1';
int flag = check_element(s);
cnt++;
if(flag) {
p.pb(j), d[j] = 1;
break;
}
s[j] = '0';
}
}
int cnt = 0;
for(int i = 0;i < n;i++) if(!d[i]) p.pb(i), cnt++;
assert(cnt == 1);
return p;
}