| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298204 | tudor_costin | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 2 ms | 364 KiB |
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
bitset<200> viz;
bool check(string x,int poz)
{
x[poz]='1';
return check_element(x);
}
vector<int> restore_permutation(int n,int w,int r)
{
string x="";
for(int i=0;i<n;i++) x=x+'0';
for(int i=0;i<n-1;i++)
{
x[i]='1';
add_element(x);
}
compile_set();
vector<int> perm(n);
string curs="";
for(int i=0;i<n;i++) curs=curs+'0';
for(int bit=1;bit<n;bit++)
{
bitset<200> cur=viz;
int goodbit=0;
while(true)
{
int nwbit=rand()%n;
if(cur[nwbit]) continue;
if(check(curs,nwbit))
{
goodbit=nwbit;
break;
}
else cur[nwbit]=1;
}
perm[goodbit]=bit-1;
curs[goodbit]='1';
viz[goodbit]=1;
}
for(int i=0;i<n;i++) if(!viz[i]) perm[i]=n-1;
return perm;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
