# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
565215 | RealSnake | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 3147 ms | 24260 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_testcase = 1;
bool a[13][924];
int encode(int n, int x, int y) {
if(first_testcase) {
first_testcase = 0;
int k = 0;
for(int i = 0; i < (1 << 12); i++) {
if(__builtin_popcount(i) == 6) {
for(int j = 0; j <= 12; j++)
a[j][k] = (i & (1 << j));
k++;
}
}
}
for(int i = 0; i < 12; i++) {
if(a[i][x] == 1 && a[i][y] == 0)
return i + 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |