oj.uz

Submission #973165

# Submission time Handle Problem Language Result Execution time Memory
973165 2024-05-01T14:56:01 Z sleepntsheep Question (Grader is different from the original contest) (CEOI14_question_grader) C
0 / 100
 1483 ms 25284 KB 
#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;
    __builtin_trap();
}

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;
    __builtin_trap();
}

int decode (int n, int q, int h)
{
    if (!iota) init();
    return(set[q]&(1<<(h-1)));
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1483 ms 25284 KB wrong answer
2 Incorrect 1470 ms 25268 KB wrong answer