This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// author - alimammadzade
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
vector<int> a(n), res(n);
string s(n, '0');
for (int i = 0; i < n; i++) {
s[n - i - 1] = '1';
add_element(s);
}
compile_set();
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (s[j] != '1') {
string t = s;
t[i] = j;
if (check_element(t)) {
a[i] = j;
s = t;
break;
}
}
for (int i = 0; i < n; i++) res[a[i]] = i;
return res;
}
# | 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... |