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) {
srand(clock());
string found(n, '0');
for(int i = 0; i < n; i++) {
string s(n, '0');
for(int j = 0; j <= i; j++)
s[j] = '1';
add_element(s);
}
compile_set();
vector<int> p(n);
for(int i = 0; i < n; i++) {
vector<int> v;
for(int j = 0; j < n; j++) if(found[j] == '0')
v.push_back(j);
random_shuffle(v.begin(), v.end());
for(int j : v) {
string s = found;
s[j] = '1';
if(check_element(s)) {
p[j] = i;
found[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... |