| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 347089 | ACmachine | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 2222 ms | 24840 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 sets[10001], id = 1;
int encode (int n, int x, int y) {
if(id == 1){
for(int i = 0; i < (1 << 12); ++i){
if(__builtin_popcount(i) == 6)
sets[id++] = i;
}
}
x = sets[x];
y = sets[y];
for(int i = 0; i < 12; ++i){
if((x&(1 << i)) && !(y&(1 << i)))
return i + 1;
}
return 0;
}int sets[10001], id = 1;
int decode (int n, int q, int h) {
if(id == 1){
for(int i = 0; i < (1 << 12); ++i){
if(__builtin_popcount(i) == 6)
sets[id++] = i;
}
}
q = sets[q];
return (q &(1 << (h-1)));
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||