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 <vector>
#include "messy.h"
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
string s;
s.resize(n, '0');
for (int i = 0; i < n; ++i)
{
s[i] = '1';
add_element(s);
}
for (int i = 0; i < n; ++i) s[i] = '0';
compile_set();
vector<int> p(n);
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (s[j] != '1')
{
s[j] = '1';
if (check_element(s))
{
p[j] = i;
break;
}
s[j] = '0';
}
return p;
}
# | 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... |