#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=35;
bool vs[nx];
vector<int> restore_permutation(int n, int w, int r) {
vector<int> ans(n);
string s;
for (int i=0; i<n; i++) s+='0', ans[i]=i;
for (int i=0; i<n-1; i++) s[i]='1', add_element(s);
for (int i=0; i<n; i++) s[i]='0';
compile_set();
for (int i=0; i<n-1; i++)
{
for (int j=0; j<n; j++)
{
if (vs[j]) continue;
s[j]='1';
if (check_element(s))
{
vs[j]=1;
ans[j]=i;
break;
}
else s[j]='0';
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n = 8 |
2 |
Correct |
0 ms |
348 KB |
n = 8 |
3 |
Correct |
0 ms |
348 KB |
n = 8 |
4 |
Correct |
0 ms |
348 KB |
n = 8 |
5 |
Correct |
1 ms |
348 KB |
n = 8 |
6 |
Correct |
0 ms |
604 KB |
n = 8 |
7 |
Correct |
0 ms |
348 KB |
n = 8 |
8 |
Correct |
0 ms |
348 KB |
n = 8 |
9 |
Correct |
0 ms |
348 KB |
n = 8 |
10 |
Correct |
0 ms |
348 KB |
n = 8 |
11 |
Correct |
0 ms |
348 KB |
n = 8 |
12 |
Correct |
1 ms |
348 KB |
n = 8 |
13 |
Correct |
0 ms |
348 KB |
n = 8 |
14 |
Correct |
0 ms |
348 KB |
n = 8 |
15 |
Incorrect |
0 ms |
348 KB |
grader returned WA |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n = 32 |
2 |
Correct |
0 ms |
348 KB |
n = 32 |
3 |
Incorrect |
0 ms |
348 KB |
grader returned WA |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |