#include<bits/stdc++.h>
#include "messy.h"
using namespace std;
vector<int> restore_permutation(int n, int w, int r){
for(int i=1;i<=n;i++){
string s;
for(int j=1;j<=i;j++){
s.push_back('1');
}
for(int j=i+1;j<=n;j++){
s.push_back('0');
}
add_element(s);
}
compile_set();
vector<int> answer_List;
for(int i=0;i<n;i++){
string s;
for(int j=1;j<=n;j++) s.push_back('0');
for(int j=0;j<i;j++){
s[answer_List[j]]='1';
}
for(int j=0;j<n;j++){
if(s[j]=='1') continue;
s[j]='1';
if(check_element(s)) {answer_List.push_back(j);break;}
s[j]='0';
}
}
return answer_List;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 8 |
2 |
Correct |
0 ms |
212 KB |
n = 8 |
3 |
Correct |
1 ms |
212 KB |
n = 8 |
4 |
Correct |
0 ms |
212 KB |
n = 8 |
5 |
Correct |
0 ms |
212 KB |
n = 8 |
6 |
Correct |
0 ms |
212 KB |
n = 8 |
7 |
Correct |
1 ms |
212 KB |
n = 8 |
8 |
Correct |
1 ms |
212 KB |
n = 8 |
9 |
Correct |
1 ms |
212 KB |
n = 8 |
10 |
Correct |
1 ms |
212 KB |
n = 8 |
11 |
Correct |
0 ms |
212 KB |
n = 8 |
12 |
Correct |
1 ms |
304 KB |
n = 8 |
13 |
Correct |
1 ms |
216 KB |
n = 8 |
14 |
Correct |
0 ms |
212 KB |
n = 8 |
15 |
Correct |
1 ms |
212 KB |
n = 8 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
296 KB |
n = 32 |
2 |
Correct |
1 ms |
300 KB |
n = 32 |
3 |
Incorrect |
0 ms |
212 KB |
grader returned WA |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
296 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
324 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |