Submission #973165

#TimeUsernameProblemLanguageResultExecution timeMemory
973165sleepntsheepQuestion (Grader is different from the original contest) (CEOI14_question_grader)C11
0 / 100
1483 ms25284 KiB
#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))); }
#Verdict Execution timeMemoryGrader output
Fetching results...