Submission #347093

#TimeUsernameProblemLanguageResultExecution timeMemory
347093ACmachineQuestion (Grader is different from the original contest) (CEOI14_question_grader)C++17
100 / 100
4673 ms24524 KiB
int sets[10001], id = 1; int encode (int n, int x, int y) { if(id == 1){ for(int i = 0; i < (1 << 12); ++i){ if(__builtin_popcount(i) == 6) sets[id++] = i; } } x = sets[x]; y = sets[y]; for(int i = 0; i < 12; ++i){ if((x&(1 << i)) && !(y&(1 << i))) return i + 1; } return 0; }
int sets[10001], id = 1; int decode (int n, int q, int h) { if(id == 1){ for(int i = 0; i < (1 << 12); ++i){ if(__builtin_popcount(i) == 6) sets[id++] = i; } } q = sets[q]; return ((q>>(h-1))&1); }
#Verdict Execution timeMemoryGrader output
Fetching results...