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) {
string s(n, '0');
for (int i = 0; i < n; i++){
s[i] = '1';
add_element(s);
}
vector<int> p(n, -1), q(n, -1);
compile_set();
s = string(n, '0');
for (int i = 0; i < n; i++){
s[i] = '1';
string t(n, '0');
for (int j = 0; j < i; j++){
t[q[j]] = '1';
}
for (int j = 0; j < n; j++){
if (t[j] == '1') continue;
t[j] = '1';
if (check_element(t)){
p[j] = i;
q[i] = j;
break;
}
t[j] = '0';
}
}
return p;
}
/*
8 256 256
0 1 5 3 4 2 6 7
*/
# | 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... |