# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282143 | thtsshz_bgwrswh | 질문 (CEOI14_question_grader) | C++98 | 5079 ms | 48112 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 <string>
#include <algorithm>
using namespace std;
static bool first = true;
static string S[925];
int encode (int N, int x, int y) {
if(first) {
first = false;
for(int i = 0; i < 12; i++) S[1] += (i < 6) ? "0" : "1";
for(int i = 2; i <= 920; i++) S[i] = S[i-1], next_permutation(S[i].begin(), S[i].end());
}
for(int i = 0; i < 12; i++) if(S[x][i] == '1' && S[y][i] == '0') return i+1;
return -1;
}
#include <string>
#include <algorithm>
using namespace std;
static bool first = true;
static string S[925];
int decode (int N, int q, int h) {
if(first) {
first = false;
for(int i = 0; i < 12; i++) S[1] += (i < 6) ? "0" : "1";
for(int i = 2; i <= 920; i++) S[i] = S[i-1], next_permutation(S[i].begin(), S[i].end());
}
return S[q][--h] == '1';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |