| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 343730 | amunduzbaev | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 2176 ms | 24584 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 ans[1000], pos;
int encode (int n, int x, int y) {
if(pos == 0){
for(int i=0;i<(1<<12);i++){
int tmp = 0, tt = i;
while(tt) tmp += (tt%2), tt /= 2;
if(tmp == 6) ans[pos++] = i;
}
}
x = ans[x-1], y = ans[y-1];
for(int i=0;i<12;i++)if(x&(1<<i) && !(y&(1<<i))) return i+1;
return 0;
}
int ans[1000], pos;
int decode (int n, int q, int h) {
if(pos == 0){
for(int i=0;i<(1<<12);i++){
int tmp = 0, tt = i;
while(tt) tmp += (tt%2), tt /= 2;
if(tmp == 6) ans[pos++] = i;
}
}
q = ans[q-1];
return (q&(1<<(h-1)));
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||