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 "messy.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 300;
bool f[nax];
vector<int> restore_permutation(int n, int w, int r) {
vector<int> ans(n);
string tmp,cur;
for(int i=0;i<n;i++)
tmp += '0';
cur = tmp;
for(int i=0;i<n;i++){
tmp[i] = '1';
add_element(tmp);
}
compile_set();
printf("\n");
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(f[j])continue;
cur[j] = '1';
if(check_element(cur)){
ans[j] = i;
f[j] = 1;
break;
}
cur[j] = '0';
}
}
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... |