| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 477230 | ponytail | 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"
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;
void add_element(std::string x);
bool check_element(std::string x);
void compile_set();
std::vector<int> restore_permutation(int n, int w, int r);
// 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) {
cout << "Added " << x << "\n";
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;
}
//TODO: Implement
int fastlog(int n) {
return 32 - __builtin_clz(n) - 1;
}
std::vector<int> restore_permutation(int n, int w, int r) {
vector<int> p(n);
string empty;
for(int i=0; i<n; i++) empty += '0';
for(int i=1; i<n; i+=2) {
empty[i] = '1';
add_element(empty);
empty[i] = '0';
}
for(int i=1; i<fastlog(n); i++) {
for(int j=0; j<n; j++) {
if((j&(1<<i)) != 0) {
int v = j % (1<<i);
v = (1<<i) - 1 - v;
for(int k=0; k<n; k++) {
if(k % (1<<i) == v % (1<<i)) {
empty[k] = '1';
}
}
empty[j] = '1';
add_element(empty);
for(int k=0; k<n; k++) {
empty[k] = '0';
}
}
}
}
compile_set();
for(int i=0; i<n; i++) {
empty[i] = '1';
if(check_element(empty)) {
p[i]++;
}
empty[i] = '0';
}
for(int i=1; i<fastlog(n); i++) {
for(int j=0; j<n; j++) {
int v = (1<<i) - 1 - p[j];
for(int k=0; k<n; k++) {
if(p[k] % (1<<i) == v % (1<<i)) {
empty[k] = '1';
}
}
empty[j] = '1';
if(check_element(empty)) {
p[j] += (1<<i);
}
for(int k=0; k<n; k++) {
empty[k] = '0';
}
}
}
return p;
}