# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44559 | wzy | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++11 | 7086 ms | 1612 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.
int encode (int n, int x, int y) {
int m1 = 0 , m2 = 15615165 , qntsfoi = 0;
for(int j = 0 ; j < (1<<12) ; j++){
int xx = 0;
for(int w = 0 ; w < 12 ; w++){
if(1<<w & j) xx++;
}
if(xx == 6){
qntsfoi++;
if(qntsfoi == x){
m1 = j;
}
if(qntsfoi == y) m2 = j;
}
}
for(int j = 0 ; j < 12 ; j++){
if((m1 & 1 <<j) && !(m2 & 1<<j)){
return (j + 1);
}
}
return 0;
}
int decode (int n, int q, int h) {
int m1 = 0 , qntsfoi = 0;
h--;
for(int j = 0 ; j < (1<<12) ; j++){
int xx = 0;
for(int w = 0 ; w < 12 ; w++){
if(1<<w & j) xx++;
}
if(xx == 6){
qntsfoi++;
if(qntsfoi == q){
m1 = j;
break;
}
}
}
if(m1 & 1<<h){
return 1;
}
else return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |