# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166668 | 2019-12-03T12:39:24 Z | Lawliet | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7000 ms | 9140 KB |
int mask[930]; bool isActive(int v, int k) { return v & (1 << k); } int encode (int n, int x, int y) { int cnt = 1; for(int m = 0 ; cnt <= n ; m++) if( __builtin_popcount( m ) == 6 ) mask[ cnt++ ] = m; x = mask[ x ]; y = mask[ y ]; for(int j = 0 ; j < 12 ; j++) if( isActive( x , j ) && !isActive( y , j ) ) return j + 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 7025 ms | 9020 KB | Time limit exceeded |
2 | Execution timed out | 7100 ms | 9140 KB | Time limit exceeded |