# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
973163 | sleepntsheep | Question (Grader is different from the original contest) (CEOI14_question_grader) | C11 | 1610 ms | 25228 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>
int set[925], iota;
void init()
{
for (int i = 1; i < (1<<12); ++i)
if(__builtin_popcount(i) == 6)
set[++iota] = i;
}
int encode(int n,int x,int y)
{
if (!iota) init();
for(int i=0;i<12;++i)
if((set[x]&(1<<i))&&!(set[y]&(1<<i)))
return i+1;
return- 1;
}
int decode (int n, int q, int h)
{
if (!iota) init();
return(set[q]&(1<<(h-1)));
}
#include <stdio.h>
int set[925], iota;
void init()
{
for (int i = 1; i < (1<<12); ++i)
if(__builtin_popcount(i) == 6)
set[++iota] = i;
}
int encode(int n,int x,int y)
{
if (!iota) init();
for(int i=0;i<12;++i)
if((set[x]&(1<<i))&&!(set[y]&(1<<i)))
return i+1;
return- 1;
}
int decode (int n, int q, int h)
{
if (!iota) init();
return(set[q]&(1<<(h-1)));
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |