# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
451567 | kingfran1907 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7015 ms | 940 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 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);
vector< set< int > > vs;
do {
set< int > tren;
for (int i = 0; i < 12; i++) {
if (v[i] == 1) tren.insert(i);
}
vs.push_back(tren);
} while (next_permutation(v.begin(), v.end()));
for (auto iter : vs[x]) {
if (vs[y].count(iter) == 0) return iter + 1;
}
}
#include <bits/stdc++.h>
using namespace std;
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);
vector< set< int > > vs;
do {
set< int > tren;
for (int i = 0; i < 12; i++) {
if (v[i] == 1) tren.insert(i);
}
vs.push_back(tren);
} while (next_permutation(v.begin(), v.end()));
h--;
return vs[q].count(h);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |