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;
typedef long long ll;
typedef pair<int, int> ii;
random_device rd;
mt19937 g(rd());
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);
}
compile_set();
string known(n, '0');
vector<int> went(n), p(n);
for (int i = 0; i < n; i++) {
vector<int> v;
for (int j = 0; j < n; j++) {
if (known[j] == '0') {
v.push_back(j);
}
}
shuffle(v.begin(), v.end(), g);
for (int it = 0; it < (int)v.size(); it++) {
int j = v[it];
known[j] = '1';
bool res = (it == (int)v.size() - 1 or check_element(known));
if (res) {
went[i] = j;
break;
}
known[j] = '0';
}
}
for (int i = 0; i < n; i++) {
p[went[i]] = i;
}
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... |