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;
vector<int> restore_permutation(int n, int w, int r) {
vector<int> ans(n);
string s;
s.resize(n, '0');
for (int i = 0; i < n; i++)
{
s[i] = '1';
add_element(s);
}
compile_set();
fill(s.begin(), s.end(), '0');
string tmp;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if(s[j] == '1') continue;
tmp = s;
tmp[j] = '1';
if(check_element(tmp)){
ans[i] = j;
s = tmp;
break;
}
}
}
vector<int> a(n);
for (int i = 0; i < n; i++)
{
a[ans[i]] = i;
}
return a;
}
# | 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... |