# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347086 | 2021-01-11T17:37:10 Z | ACmachine | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 7000 ms | 4304 KB |
int sets[921]; int encode (int n, int x, int y) { int id = 1; 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 | Execution timed out | 7087 ms | 4260 KB | Time limit exceeded |
2 | Execution timed out | 7086 ms | 4304 KB | Time limit exceeded |