int encode (int n, int x, int y) {
int a=0;
for(int i=0; i<10; i++){
if(((1<<i)&x) && !((1<<i)&y)){
a=i+1;
break;
}
}
if(a){
return a;
}
for(int i=0; i<10; i++){
if(!((1<<i)&x) && ((1<<i)&y)){
a=11+i;
break;
}
}
return a;
}
int decode (int n, int q, int h) {
if(h>10){
h-=11;
if((1<<h)&q){
return 0;
}
return 1;
}
else{
h--;
if((1<<h)&q){
return 1;
}
return 0;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
4711 ms |
24212 KB |
Output is partially correct - maxh = 20 |
2 |
Partially correct |
4481 ms |
24292 KB |
Output is partially correct - maxh = 20 |