# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
451578 | 2021-08-03T09:17:23 Z | kingfran1907 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7000 ms | 2276 KB |
#include <bits/stdc++.h> using namespace std; int vs[1000]; int encode (int n, int x, int y) { vector< int > v; for (int i = 0; i < 6; i++) v.push_back(0); for (int i = 0; i < 6; i++) v.push_back(1); int ptr = 0; do { int tren = 0; for (int i = 0; i < 12; i++) { if (v[i] == 1) tren |= (1 << i); } vs[ptr++] = tren; } while (next_permutation(v.begin(), v.end())); for (int i = 0; i < 12; i++) { if ((vs[x] & (1 << i)) && !(vs[y] & (1 << i))) { return i + 1; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 7090 ms | 2276 KB | Time limit exceeded |
2 | Execution timed out | 7029 ms | 2072 KB | Time limit exceeded |