# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48923 | Benq | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1947 ms | 79048 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.
#include <stdio.h>
#include <stdlib.h>
#define F0R(i, a) for (int i=0; i<(a); i++)
int num[2772], tot = (1<<12)-1;
void gen() {
int nex = 0;
F0R(i,1<<12) if (__builtin_popcount(i) == 6) num[nex++] = i;
}
int encode (int N, int x, int y) {
if (!num[0]) gen();
int z = num[x]&(tot^num[y]);
F0R(i,12) if (z&(1<<i)) return i+1;
}
#include <stdio.h>
#include <stdlib.h>
#define F0R(i, a) for (int i=0; i<(a); i++)
int num[2772], tot = (1<<12)-1;
void gen() {
int nex = 0;
F0R(i,1<<12) if (__builtin_popcount(i) == 6) num[nex++] = i;
}
int decode (int N, int q, int h) {
if (!num[0]) gen();
h --;
if (num[q]&(1<<h)) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |