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;
std::vector<int> restore_permutation(int n, int w, int r) {
string s(n,'1');
for(int i=0;i<n-1;i++){
s[i] = '0';
add_element(s);
}
compile_set();
set<int>st;
for(int i=0;i<n;i++)
st.insert(i);
vector<int>vec(n,-1);
s = string(n,'1');
for(int i=0;i<n-1;i++){
for(int j=0;j<n;j++){
if(s[j]=='1'){
s[j] = '0';
if(check_element(s)){
vec[j] = i;
st.erase(i);
break;
}
else
s[j] = '1';
}
}
}
for(int i=0;i<n;i++)
if(vec[i]==-1)
vec[i] = *st.begin();
return vec;
}
# | 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... |