# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282139 | thtsshz_bgwrswh | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 4318 ms | 48072 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<algorithm>
#include<string>
using namespace std;
static bool first=1;
static string s[925];
int encode(int n,int x,int y){
if(first){
first=0;
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<algorithm>
#include<string>
using namespace std;
static bool first=1;
static string s[925];
int decode(int n,int q,int h){
if(first){
first=0;
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... |