| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1302896 | Mamikonm1 | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 0 ms | 0 KiB |
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
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;
}
#include <bits//stdc++.h>
using namespace std;
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;
}
mt19937 rg(time(nullptr));
std::vector<int> restore_permutation(int n, int w, int r) {
string a=string(n,'0'),cur=a;
vector<int>ind(n),ans(n);
for(int i=0;i<n;++i){
a[i]='1';
ind[i]=i;
add_element(a);
}
int id,it,cnt=0;
compile_set();
vector<bool>vis(n);
for(int i=0;i<n;++i){
for(int j=0;j<n;++j)vis[j]=0;
for(;;){
id=rg()%ind.size();
if(vis[it=ind[id]])continue;
vis[it]=1;
cur[it]='1';
cnt++;
assert(cnt<=r);
if(check_element(cur)){
ans[i]=it;
ind.erase(begin(ind)+id);
break;
}
cur[it]='0';
}
}
return ans;
}
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 != p) {
printf("WA\n");
}
printf("%d", answer[0]);
for (int i = 1; i < n; i++) {
printf(" %d", answer[i]);
}
printf("\n");
return 0;
}