#include <vector>
#include "messy.h"
#include <iostream>
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
vector<string> s(n);
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++)
(i%2==0)? s[i].push_back('0') : s[i].push_back('1');
for(int j=0; j<=i; j++)
(i%2==0)? s[i][j] = '1' : s[i][j] = '0';
add_element(s[i]);
}
compile_set();
vector<int> ans(n);
for(int i=0; i<n; i++) ans[i] = i;
bool flag = false;
for(int i=0; i<n; i++) {
for(int j=i+1; j<n; j++) {
swap(s[i][i], s[i][j]);
if(check_element(s[i])) {
swap(ans[i], ans[j]);
flag = true;
break;
}
swap(s[i][i], s[i][j]);
}
if(flag) break;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
n = 8 |
2 |
Correct |
1 ms |
204 KB |
n = 8 |
3 |
Correct |
1 ms |
204 KB |
n = 8 |
4 |
Correct |
1 ms |
204 KB |
n = 8 |
5 |
Correct |
1 ms |
204 KB |
n = 8 |
6 |
Correct |
1 ms |
204 KB |
n = 8 |
7 |
Correct |
0 ms |
204 KB |
n = 8 |
8 |
Correct |
1 ms |
288 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 |
0 ms |
288 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 |
Incorrect |
1 ms |
204 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
292 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 |
- |