# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
451578 | kingfran1907 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7090 ms | 2276 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
}
}
#include <bits/stdc++.h>
using namespace std;
int vs[1000];
int decode (int n, int q, int h) {
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()));
h--;
if (vs[q] & (1 << h)) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |