#include "bits/stdc++.h"
#include "messy.h"
using namespace std;
#define pb push_back
void add_element(string x);
void compile_set();
bool check_element(string x);
vector<int> restore_permutation(int n, int w, int r)
{
vector<string> li;
string s = "00000000";
for(int i = 7; i>=0; i--)
{
for(int j = i-1; j>=0; j--)
{
s[j] = '1';
li.pb(s);
s[j] = '0';
}
s[i] = '1';
}
int len = (int)li.size();
for(int i = 0; i<len; i++)
add_element(li[i]);
compile_set();
vector<int> res;
for(int i = 0; i<8; i++)
res.pb(i);
for(int i = 7; i>=1; i--)
{
for(int j = i-1; j>=0; j--)
{
string s1 = "00000000";
string s2 = s1;
s1[j] = '1';
for(int k = i+1; k<8; k++)
s1[k] = '1';
for(int k = i; k<8; k++)
s2[k] = '1';
if(!check_element(s1)&&check_element(s2))
{
res[i] = j;
res[j] = i;
return res;
}
}
}
return res;
}
# |
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 |
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 |
204 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 |
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 |
204 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |