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