# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282125 | thtsshz_bgwrswh | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
bool first=1;
string s[925];
int encode(int n,int x,int y){
int i;
if(first){
first=0;
s[1]="000000111111";
for(i=2;i<=920;i++){
s[i]=s[i-1];
next_permutation(s[i].begin(),s[i].end());
}
}
for(i=0;i<12;i++)
if(s[x][i]=='1'&&s[y][i]=='0')
return i+1;
}
bool first=1;
string s[925];
int decode(int n,int q,int h){
int i;
if(first){
first=0;
s[1]="000000111111";
for(i=2;i<=920;i++){
s[i]=s[i-1];
next_permutation(s[i].begin(),s[i].end());
}
}
return q>>(h-1)&1;
}