# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088119 | 2024-09-14T03:09:52 Z | pedroslrey | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7000 ms | 8336 KB |
#include <bits/stdc++.h> using namespace std; int encode (int n, int x, int y) { vector<int> dp(n+1); int cnt = 0; for (int mask = 1; mask < (1 << 12) && cnt <= n; ++mask) if (__builtin_popcount(mask) == 6) dp[++cnt] = mask; int ans; for (int k = 0; k < 12; ++k) if ((dp[x] & (1 << k)) && !(dp[y] & (1 << k))) ans = k; return ans + 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 7074 ms | 7904 KB | Time limit exceeded |
2 | Execution timed out | 7038 ms | 8336 KB | Time limit exceeded |