Submission #7095

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
7095	2014-07-23T14:29:54 Z	tncks0121	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++	100 / 100	1706 ms	27360 KB

encoder

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

decoder

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

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1706 ms	27360 KB	Output is correct - maxh = 12
2	Correct	1675 ms	27360 KB	Output is correct - maxh = 12