#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(x) x.begin(),x.end()
using ll=long long;
#include "messy.h"
int mask(int x){
return (1<<x)-1;
}
std::vector<int> restore_permutation(int n, int w, int r) {
vector<int> p(n,0);
int b=0;
while((1<<b)!=n)b++;
rep(i,b){
rep(j,n){
if(!((j>>i)&1))continue;
string s="";
rep(k,n){
if((j&mask(i))!=(k&mask(i))){
s=s+"1";
}
else if(j==k){
s=s+"1";
}
else{
s=s+"0";
}
}
add_element(s);
}
}
compile_set();
rep(i,b){
rep(j,n){
string s="";
rep(k,n){
if((p[j]&mask(i))!=(p[k]&mask(i))){
s=s+"1";
}
else if(j==k){
s=s+"1";
}
else{
s=s+"0";
}
}
if(check_element(s)){
p[j]+=1<<i;
}
}
}
return p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
n = 8 |
2 |
Correct |
0 ms |
348 KB |
n = 8 |
3 |
Correct |
0 ms |
348 KB |
n = 8 |
4 |
Correct |
0 ms |
432 KB |
n = 8 |
5 |
Correct |
0 ms |
348 KB |
n = 8 |
6 |
Correct |
0 ms |
348 KB |
n = 8 |
7 |
Correct |
1 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 |
0 ms |
348 KB |
n = 8 |
13 |
Correct |
0 ms |
348 KB |
n = 8 |
14 |
Correct |
0 ms |
348 KB |
n = 8 |
15 |
Correct |
0 ms |
348 KB |
n = 8 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
n = 32 |
2 |
Correct |
1 ms |
348 KB |
n = 32 |
3 |
Correct |
1 ms |
348 KB |
n = 32 |
4 |
Correct |
1 ms |
344 KB |
n = 32 |
5 |
Correct |
1 ms |
348 KB |
n = 32 |
6 |
Correct |
1 ms |
344 KB |
n = 32 |
7 |
Correct |
1 ms |
348 KB |
n = 32 |
8 |
Correct |
1 ms |
348 KB |
n = 32 |
9 |
Correct |
1 ms |
348 KB |
n = 32 |
10 |
Correct |
1 ms |
348 KB |
n = 32 |
11 |
Correct |
1 ms |
348 KB |
n = 32 |
12 |
Correct |
1 ms |
348 KB |
n = 32 |
13 |
Correct |
1 ms |
348 KB |
n = 32 |
14 |
Correct |
1 ms |
348 KB |
n = 32 |
15 |
Correct |
1 ms |
348 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
n = 32 |
2 |
Correct |
1 ms |
512 KB |
n = 32 |
3 |
Correct |
1 ms |
348 KB |
n = 32 |
4 |
Correct |
1 ms |
348 KB |
n = 32 |
5 |
Correct |
1 ms |
348 KB |
n = 32 |
6 |
Correct |
1 ms |
348 KB |
n = 32 |
7 |
Correct |
1 ms |
348 KB |
n = 32 |
8 |
Correct |
1 ms |
348 KB |
n = 32 |
9 |
Correct |
1 ms |
348 KB |
n = 32 |
10 |
Correct |
1 ms |
344 KB |
n = 32 |
11 |
Correct |
1 ms |
344 KB |
n = 32 |
12 |
Correct |
1 ms |
344 KB |
n = 32 |
13 |
Correct |
1 ms |
344 KB |
n = 32 |
14 |
Correct |
1 ms |
348 KB |
n = 32 |
15 |
Correct |
1 ms |
348 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
600 KB |
n = 128 |
2 |
Correct |
10 ms |
604 KB |
n = 128 |
3 |
Correct |
9 ms |
604 KB |
n = 128 |
4 |
Correct |
9 ms |
604 KB |
n = 128 |
5 |
Correct |
8 ms |
604 KB |
n = 128 |
6 |
Correct |
9 ms |
600 KB |
n = 128 |
7 |
Correct |
9 ms |
600 KB |
n = 128 |
8 |
Correct |
9 ms |
604 KB |
n = 128 |
9 |
Correct |
9 ms |
600 KB |
n = 128 |
10 |
Correct |
9 ms |
632 KB |
n = 128 |
11 |
Correct |
9 ms |
604 KB |
n = 128 |
12 |
Correct |
10 ms |
436 KB |
n = 128 |
13 |
Correct |
9 ms |
496 KB |
n = 128 |
14 |
Correct |
9 ms |
604 KB |
n = 128 |
15 |
Correct |
9 ms |
636 KB |
n = 128 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
604 KB |
n = 128 |
2 |
Correct |
9 ms |
628 KB |
n = 128 |
3 |
Correct |
10 ms |
436 KB |
n = 128 |
4 |
Correct |
9 ms |
600 KB |
n = 128 |
5 |
Correct |
9 ms |
604 KB |
n = 128 |
6 |
Correct |
9 ms |
600 KB |
n = 128 |
7 |
Correct |
9 ms |
604 KB |
n = 128 |
8 |
Correct |
9 ms |
604 KB |
n = 128 |
9 |
Correct |
9 ms |
604 KB |
n = 128 |
10 |
Correct |
9 ms |
604 KB |
n = 128 |
11 |
Correct |
9 ms |
600 KB |
n = 128 |
12 |
Correct |
9 ms |
604 KB |
n = 128 |
13 |
Correct |
9 ms |
604 KB |
n = 128 |
14 |
Correct |
9 ms |
636 KB |
n = 128 |
15 |
Correct |
9 ms |
604 KB |
n = 128 |