Submission #64752

#TimeUsernameProblemLanguageResultExecution timeMemory
64752bazsi700Question (Grader is different from the original contest) (CEOI14_question_grader)C++14
100 / 100
2046 ms79168 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int mask[930]; int encode(int n, int x, int y) { if(mask[1] == 0) { int nxt = 1; for(int i = 0; i < (1<<12); i++) { int cn = 0; for(int j = 0; j < 12; j++) { if(i&(1<<j)) { cn++; } } if(cn == 6) { mask[nxt++] = i; } } } for(int j = 0; j < 12; j++) { if((mask[x]&(1<<j)) && !(mask[y]&(1<<j))) { return j+1; } } }
#include <bits/stdc++.h> using namespace std; #define ll long long int mask[930]; int decode(int n, int q, int h) { if(mask[1] == 0) { int nxt = 1; for(int i = 0; i < (1<<12); i++) { int cn = 0; for(int j = 0; j < 12; j++) { if(i&(1<<j)) { cn++; } } if(cn == 6) { mask[nxt++] = i; } } } if(mask[q]&(1<<(h-1))) { return 1; } else { return 0; } }

Compilation message (stderr)

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...