# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713071 | lam | 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 <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"
using namespace std;
namespace helper {
set<string> set_;
bool compiled = false;
int n;
vector<int> p;
int w;
int r;
int read_int() {
int x;
cin >> x;
return x;
}
}
using namespace helper;
// A convenience function.
int get_p(int i) {
int ret = p[i];
return ret;
}
int main() {
n = read_int();
w = read_int();
r = read_int();
p = vector<int>(n);
for (int i = 0; i < n; i++) {
p[i] = read_int();
}
vector<int> answer = restore_permutation(n, w, r);
if (answer.size() != n) {
printf("WA\n");
return 0;
}
printf("%d", answer[0]);
for (int i = 1; i < n; i++) {
printf(" %d", answer[i]);
}
printf("\n");
return 0;
}
void wa() {
printf("WA\n");
exit(0);
}
bool check(const string& x) {
if ((int)x.length() != n) {
return false;
}
for (int i = 0; i < n; i++) {
if (x[i] != '0' && x[i] != '1') {
return false;
}
}
return true;
}
void add_element(string x) {
if (--w < 0 || compiled || !check(x)) {
wa();
}
set_.insert(x);
}
bool check_element(string x) {
if (--r < 0 || !compiled || !check(x)) {
wa();
}
return set_.count(x);
}
void compile_set() {
if (compiled) {
wa();
}
compiled = true;
set<string> compiledSet;
string compiledElement = string(n, ' ');
for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
string s = *it;
for (int i = 0; i < n; i++) {
compiledElement[i] = s[get_p(i)];
}
compiledSet.insert(compiledElement);
}
set_ = compiledSet;
}
using namespace std;
inline bool checkbit(int i, int j)
{
return i>>j&1;
}
inline string tostring(int x, int n)
{
string s="";
for (int i=0; i<n; i++)
{
if (x%2==0) s+='0';
else s+='1';
x/=2;
}
return s;
}
vector<int> restore_permutation(int n, int w, int r) {
string s="";
for (int i=0; i<n; i++) s+='0';
for (int i=n-1; i>=1; i--)
{
s[i] = '1';
add_element(s);
}
compile_set();
vector <int> res(n);
int mask = 0;
for (int it=0; it<n; it++)
{
for (int j=0; j<n; j++)
{
if (checkbit(mask,j)) continue;
mask^=(1<<j);
bool check = check_element(tostring(mask,n));
if (!check)
{
mask^=(1<<j);
continue;
}
for (int j=0; j<n; j++)
if (checkbit(mask,j)) res[j]++;
break;
}
}
return res;
}