# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470028 | luciocf | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 4877 ms | 24072 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 <bits/stdc++.h>
using namespace std;
int mask[1010];
bool flag = 0;
int encode(int n, int x, int y)
{
if (!flag)
{
flag = 1;
int ind = 0;
for (int i = 0; i < (1<<12); i++)
if (__builtin_popcount(i) == 6)
mask[++ind] = i;
}
for (int i = 0; i <= 11; i++)
if ((mask[x]&(1<<i)) && (!(mask[y]&(1<<i))))
return i+1;
}
#include <bits/stdc++.h>
using namespace std;
int mask[1010];
bool flag = 0;
int decode(int n, int q, int h)
{
if (!flag)
{
flag = 1;
int ind = 0;
for (int i = 0; i < (1<<12); i++)
if (__builtin_popcount(i) == 6)
mask[++ind] = i;
}
if (mask[q]&(1<<(h-1))) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |