# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
449724 | BT21tata | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 1 ms | 332 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;
vector<int> restore_permutation(int n, int w, int r)
{
int pos=n-1;
string s, ans;
vector<int> p;
for(int i=0; i<n; i++) s+='1', ans+='0', p.push_back(0);
for(int i=0; i<n-1; i++)
{
s[i]='0';
add_element(s);
}
compile_set();
for(int j=n-1; j>0; j--)
{
for(int i=0; i<n; i++)
{
if(ans[i]=='1') continue;
ans[i]='1';
bool f=check_element(ans);
if(!f) ans[i]='0';
else
{
p[i]=j;
break;
}
}
}
return p;
}
/*
add_element("0");
compile_set();
check_element("0");
*/
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... |