# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100952 | E869120 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1641 ms | 79128 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 T0, E0[924][12];
int encode (int n, int x, int y) {
if (T0 == 0) {
for (int i = 0; i < 4096; i++) {
int bit[12]; for (int j = 0; j < 12; j++) bit[j] = (i / (1 << j)) % 2;
int cnt = 0;
for (int j = 0; j < 12; j++) cnt += bit[j];
if (cnt == 6) {
for (int j = 0; j < 12; j++) E0[T0][j] = bit[j];
T0++;
}
}
}
for (int i = 0; i < 12; i++) {
if (E0[x][i] == 1 && E0[y][i] == 0) return i + 1;
}
}
int T1 = 0, E1[924][12];
int decode (int n, int q, int h) {
if (T1 == 0) {
for (int i = 0; i < 4096; i++) {
int bit[12]; for (int j = 0; j < 12; j++) bit[j] = (i / (1 << j)) % 2;
int cnt = 0;
for (int j = 0; j < 12; j++) cnt += bit[j];
if (cnt == 6) {
for (int j = 0; j < 12; j++) E1[T1][j] = bit[j];
T1++;
}
}
}
return E1[q][h - 1];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |