#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
string s;
const int c=128;
vector<int> dp;
int n, po;
vector<int> restore_permutation(int x, int w, int r) {
n=x, po=x;
for (int i=0; i<n; i++) s+='0', dp.push_back(0);
while(po>1) {
for (int i=0; i<n; i+=po) {
int mid=i+po/2;
for (int j=0; j<n; j++) {
s[j]='0';
if (j>=i && j<i+po) s[j]='1';
}
for (int j=i; j<mid; j++) {
s[j]='0';
add_element(s);
s[j]='1';
}
}
po/=2;
}
compile_set(), po=x;
while(po>1) {
for (int i=0; i<n; i+=po) {
for (int j=0; j<n; j++) {
s[j]='0';
if (dp[j]==i) s[j]='1';
}
for (int j=0; j<n; j++) {
if (dp[j]==i) {
s[j]='0';
bool f=check_element(s);
s[j]='1';
if (!f) dp[j]+=po/2;
}
}
}
po/=2;
}
return dp;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
256 KB |
n = 8 |
2 |
Correct |
0 ms |
256 KB |
n = 8 |
3 |
Correct |
0 ms |
256 KB |
n = 8 |
4 |
Correct |
1 ms |
256 KB |
n = 8 |
5 |
Correct |
0 ms |
256 KB |
n = 8 |
6 |
Correct |
0 ms |
256 KB |
n = 8 |
7 |
Correct |
1 ms |
256 KB |
n = 8 |
8 |
Correct |
0 ms |
256 KB |
n = 8 |
9 |
Correct |
0 ms |
256 KB |
n = 8 |
10 |
Correct |
0 ms |
256 KB |
n = 8 |
11 |
Correct |
1 ms |
256 KB |
n = 8 |
12 |
Correct |
0 ms |
256 KB |
n = 8 |
13 |
Correct |
0 ms |
256 KB |
n = 8 |
14 |
Correct |
0 ms |
256 KB |
n = 8 |
15 |
Correct |
0 ms |
256 KB |
n = 8 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
n = 32 |
2 |
Correct |
1 ms |
256 KB |
n = 32 |
3 |
Correct |
1 ms |
384 KB |
n = 32 |
4 |
Correct |
1 ms |
384 KB |
n = 32 |
5 |
Correct |
1 ms |
384 KB |
n = 32 |
6 |
Correct |
1 ms |
384 KB |
n = 32 |
7 |
Correct |
1 ms |
384 KB |
n = 32 |
8 |
Correct |
1 ms |
384 KB |
n = 32 |
9 |
Correct |
0 ms |
384 KB |
n = 32 |
10 |
Correct |
1 ms |
384 KB |
n = 32 |
11 |
Correct |
1 ms |
384 KB |
n = 32 |
12 |
Correct |
1 ms |
384 KB |
n = 32 |
13 |
Correct |
1 ms |
384 KB |
n = 32 |
14 |
Correct |
1 ms |
384 KB |
n = 32 |
15 |
Correct |
1 ms |
384 KB |
n = 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
n = 32 |
2 |
Correct |
1 ms |
384 KB |
n = 32 |
3 |
Correct |
0 ms |
384 KB |
n = 32 |
4 |
Correct |
1 ms |
384 KB |
n = 32 |
5 |
Correct |
0 ms |
384 KB |
n = 32 |
6 |
Correct |
1 ms |
384 KB |
n = 32 |
7 |
Correct |
1 ms |
384 KB |
n = 32 |
8 |
Correct |
1 ms |
384 KB |
n = 32 |
9 |
Correct |
1 ms |
384 KB |
n = 32 |
10 |
Correct |
1 ms |
384 KB |
n = 32 |
11 |
Correct |
1 ms |
384 KB |
n = 32 |
12 |
Correct |
1 ms |
384 KB |
n = 32 |
13 |
Correct |
1 ms |
384 KB |
n = 32 |
14 |
Correct |
1 ms |
384 KB |
n = 32 |
15 |
Correct |
1 ms |
384 KB |
n = 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
512 KB |
n = 128 |
2 |
Correct |
2 ms |
512 KB |
n = 128 |
3 |
Correct |
2 ms |
512 KB |
n = 128 |
4 |
Correct |
2 ms |
512 KB |
n = 128 |
5 |
Correct |
2 ms |
512 KB |
n = 128 |
6 |
Correct |
2 ms |
436 KB |
n = 128 |
7 |
Correct |
2 ms |
512 KB |
n = 128 |
8 |
Correct |
2 ms |
512 KB |
n = 128 |
9 |
Correct |
2 ms |
512 KB |
n = 128 |
10 |
Correct |
2 ms |
512 KB |
n = 128 |
11 |
Correct |
2 ms |
512 KB |
n = 128 |
12 |
Correct |
2 ms |
564 KB |
n = 128 |
13 |
Correct |
2 ms |
512 KB |
n = 128 |
14 |
Correct |
2 ms |
512 KB |
n = 128 |
15 |
Correct |
2 ms |
512 KB |
n = 128 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
512 KB |
n = 128 |
2 |
Correct |
2 ms |
544 KB |
n = 128 |
3 |
Correct |
2 ms |
512 KB |
n = 128 |
4 |
Correct |
2 ms |
512 KB |
n = 128 |
5 |
Correct |
2 ms |
512 KB |
n = 128 |
6 |
Correct |
2 ms |
512 KB |
n = 128 |
7 |
Correct |
2 ms |
512 KB |
n = 128 |
8 |
Correct |
3 ms |
512 KB |
n = 128 |
9 |
Correct |
2 ms |
512 KB |
n = 128 |
10 |
Correct |
2 ms |
512 KB |
n = 128 |
11 |
Correct |
2 ms |
512 KB |
n = 128 |
12 |
Correct |
2 ms |
512 KB |
n = 128 |
13 |
Correct |
2 ms |
512 KB |
n = 128 |
14 |
Correct |
2 ms |
512 KB |
n = 128 |
15 |
Correct |
2 ms |
512 KB |
n = 128 |