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> p(n);
iota(p.begin(), p.end(), 0);
for (int i = 1; i < n; ++i) {
string s = string(i, '1') + string(n - i, '0');
add_element(s);
}
compile_set();
int idx[n];
memset(idx, -1, sizeof idx);
string s = string(n, '0');
for (int i = 0; i < n; ++i) {
if (~idx[i]) {
s[idx[i]] = '1';
continue;
}
for (int j = 0; j < n; ++j) {
if (s[j] == '0') {
string w = s;
w[j] = '1';
if (check_element(w)) {
idx[j] = i;
swap(p[i], p[j]);
s[j] = '1';
break;
}
}
}
}
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... |