# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347088 | 2021-01-11T17:40:45 Z | ACmachine | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 2251 ms | 24492 KB |
int sets[1000], 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; } } for(int i = 0; i < 12; ++i){ if((sets[x]&(1 << i)) && !(sets[y]&(1 << i))) return i + 1; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2251 ms | 24492 KB | wrong answer |
2 | Incorrect | 2242 ms | 24428 KB | wrong answer |