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 int long long
using namespace std;
vector<signed> restore_permutation(signed n, signed w, signed r) {
string ss(n,'0');
for(int i = 0; i < n-1; i ++){
ss[i] = '1'; add_element(ss);
}
compile_set();
vector<int> p(n); //where it goes to
ss = string(n,'0');
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';
}
}
for(int j = 0; j < n; j ++){
if(ss[j] == '0'){ p[n-1] = j; break; }
}
vector<signed> ans(n);
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... |