# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545148 | rainboy | Question (Grader is different from the original contest) (CEOI14_question_grader) | C11 | 76 ms | 23908 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.
#define L 12
#define N 924 /* N = choose(L, L / 2) */
static int cnt[1 << L], bb[N], n;
void init() {
int b;
cnt[0] = 0;
for (b = 1; b < 1 << L; b++)
if ((cnt[b] = cnt[b & b - 1] + 1) == L / 2)
bb[n++] = b;
}
int encode(int n, int x, int y) {
int l;
x--, y--;
init();
for (l = 0; l < L; l++)
if ((bb[x] & 1 << l) == 0 && (bb[y] & 1 << l) != 0)
return l + 1;
return 0;
}
#define L 12
#define N 924 /* N = choose(L, L / 2) */
static int cnt[1 << L], bb[N], n;
void init() {
int b;
cnt[0] = 0;
for (b = 1; b < 1 << L; b++)
if ((cnt[b] = cnt[b & b - 1] + 1) == L / 2)
bb[n++] = b;
}
int decode(int n, int x, int y) {
init();
x--, y--;
return (bb[x] & 1 << y) == 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |