# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166451 | 2019-12-02T13:21:51 Z | dolphingarlic | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 4 ms | 828 KB |
int encode(int n, int x, int y) { int sets[925][12]; // Creates a unique set for each integer from 1 to 920 with 6 elements from 1 to 12 for (int i = 0, cnt = 1; i < (1<<12); i++) { if (__builtin_popcount(i) == 6) { for (int j = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][j] = 1; else sets[cnt][j] = 0; cnt++; } } // Returns a number that is in sets[x] but not sets[y] for (int i = 0; i < 12; i++) if (sets[x][i] && !sets[y][i]) return i; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 828 KB | Output isn't correct |
2 | Incorrect | 4 ms | 828 KB | Output isn't correct |