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 ll long long
using namespace std;
string str;
int koji[130];
bool zakljucan[130];
vector<int> ret;
vector<int> restore_permutation(int N, int w, int r) {
for(int i=1;i<=N;i++)
str.push_back('0');
for(int i=0;i<N-1;i++){
str[i]='1';
add_element(str);
}
compile_set();
for(int i=0;i<N;i++){
str[i]='0';
koji[i]=-1;
}
for(int i=0;i<N-1;i++){
for(int j=0;j<N;j++){
if(j!=0){
if(zakljucan[j-1]==false)
str[j-1]='0';
}
if(zakljucan[j])
continue;
str[j]='1';
if(check_element(str)){
// cout<<"IMA GA"<<endl;
koji[j]=i;
zakljucan[j]=true;
break;
}
}
}
for(int i=0;i<N;i++)
if(koji[i]==-1)
koji[i]=N-1;
for(int i=0;i<N;i++)
ret.push_back(koji[i]);
return ret;
}
# | 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... |