# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47379 | TAMREF | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++11 | 1772 ms | 170176 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;
static string S[921];
static bool init = true;
int encode (int n, int x, int y) {
if(init){
init = false;
S[1] = "000000111111";
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 <bits/stdc++.h>
using namespace std;
static string S[921];
static bool init = true;
int decode (int n, int q, int h) {
if(init){
init = false;
S[1] = "000000111111";
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] - '0';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |