Submission #282140

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
282140	2020-08-24T03:55:36 Z	thtsshz_bgwrswh	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++17	100 / 100	4409 ms	48384 KB

encoder

#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;
}

decoder

#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]=='1';
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4249 ms	47992 KB	Output is correct - maxh = 12
2	Correct	4409 ms	48384 KB	Output is correct - maxh = 12