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;
int t;
string scb(int b){
string s = "";
for(int i=0;i<b;i++) s+="1";
for(int i=b;i<t;i++) s+="0";
return s;
}
bool used[10000];
vector<int> p;
string sb(int b){
string s = "";
for(int i=0;i<b;i++){ if(!used[i]) s+="0"; else s+="1";}
s+="1";
for(int i=b+1;i<t;i++){ if(!used[i]) s+="0"; else s+="1";}
return s;
}
vector<int> restore_permutation(int n, int w, int r) {
t = n;
p.assign(n,0);
for(int i=0;i<n;i++){
string s;
//cout<<"Sending "<<scb(i+1)<<endl;
add_element(scb(i+1));
}
compile_set();
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
//cout<<i<<" "<<j<<" "<<used[j]<<" check "<<sb(j)<<": "<<check_element(sb(j))<<endl;
if(!used[j] && check_element(sb(j))){ used[j] = true, p[j] = i; break;}
}
}
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... |