| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1302904 | Mamikonm1 | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 1 ms | 348 KiB |
#include <bits//stdc++.h>
#include "messy.h"
using namespace std;
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;
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';
if(check_element(cur)){
ans[it]=i;
ind.erase(begin(ind)+id);
break;
}
cur[it]='0';
}
}
return ans;
}
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... | ||||
