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"
#define see(x) cerr<<#x<<"="<<x<<"\n";
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
string s = "";
for (int i = 0; i < n; i ++) s += "0";
for (int i = n - 1; i >= 0; i --) {
s[i] = '1';
add_element(s);
}
compile_set();
vector<bool> used(n);
vector<int> ans(n);
for (int i = 0; i < n; i ++) s[i] = '0';
srand(time(0));
for (int i = n - 1; i >= 0; i --) {
while (true) {
int j = rand() % n;
if (!used[j]) {
s[j] = '1';
if (check_element(s)) {
ans[j] = i;
used[j] = true;
break;
}
else s[j] = '0';
}
}
}
return ans;
}
# | 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... |