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