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) {
string s;
s.resize(n, '0');
for(int i = 1; i <= n; i++){
s[i-1] = '1';
add_element(s);
}
compile_set();
string t;
t.resize(n, '0');
vector<int> p;
p.resize(n, 0);
for(int i = 1; i <= n; i++){
for(int j = 0; j < n; j++){
if(t[j] == '1') continue;
t[j] = '1';
if(check_element(t)){
p[j] = i-1;
break;
}else{
t[j] = '0';
}
}
}
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... |