# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794224 | Khizri | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 1 ms | 340 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 "messy.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> restore_permutation(int n, int w, int r) {
string s="";
for(int i=0;i<n;i++){
s+='0';
}
for(int i=0;i<n-1;i++){
s[i]='1';
add_element(s);
}
compile_set();
s="";
for(int i=0;i<n;i++){
s+='0';
}
vector<int>ans;
vector<int>idx;
for(int i=0;i<n;i++){
idx.push_back(i);
}
random_shuffle(idx.begin(),idx.end());
for(int i=0;i<n-1;i++){
for(int ij=0;ij<n;ij++){
int j=idx[ij];
if(s[j]=='1') continue;
s[j]='1';
if(check_element(s)){
ans.push_back(j);
break;
}
else{
s[j]='0';
}
}
}
vector<int>vt(n);
for(int i=0;i<s.size();i++){
if(s[i]=='0'){
ans.push_back(i);
break;
}
}
for(int i=0;i<n;i++){
vt[ans[i]]=i;
}
return vt;
}
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... |