Submission #110579

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110579	2019-05-11T08:34:14 Z	MAMBA	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++17	0 / 100	1071 ms	78600 KB

encoder

#include <bits/stdc++.h>

using namespace std;

#define rep(i , j , k) for (int i = j; i < k; i++)

bool init = false;

constexpr int N = 1000;

int arr[N][6], ptr, ptr2, local[6];

void generate(int me = 0) {
	if (me == 12) {
		if (ptr != 6) return;
		memcpy(arr[ptr2++] , local, sizeof(local));
		return;
	}
	if (ptr < 6) {
		local[ptr++] = me;
		generate(me + 1);
		ptr--;
	}
	generate(me + 1);
}

int decode(int junk , int q, int h) {
	if (!init) {
		generate();
		init = true;
	}
	h--;
	rep(i , 0 , 6)
		if (arr[q][i] == h)
			return true;
	return false;
}

int encode(int junk, int x, int y) {
	if (!init) {
		generate();
		init = true;
	}
	rep(i , 0 , 6)
		if (arr[x][i] != arr[y][i])
			return arr[x][i] + 1;
}

decoder

#include <bits/stdc++.h>

using namespace std;

#define rep(i , j , k) for (int i = j; i < k; i++)

bool init = false;

constexpr int N = 1000;

int arr[N][6], ptr, ptr2, local[6];

void generate(int me = 0) {
	if (me == 12) {
		if (ptr != 6) return;
		memcpy(arr[ptr2++] , local, sizeof(local));
		return;
	}
	if (ptr < 6) {
		local[ptr++] = me;
		generate(me + 1);
		ptr--;
	}
	generate(me + 1);
}

int decode(int junk , int q, int h) {
	if (!init) {
		generate();
		init = true;
	}
	h--;
	rep(i , 0 , 6)
		if (arr[q][i] == h)
			return true;
	return false;
}

int encode(int junk, int x, int y) {
	if (!init) {
		generate();
		init = true;
	}
	rep(i , 0 , 6)
		if (arr[x][i] != arr[y][i])
			return arr[x][i] + 1;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

decoder.cpp: In function 'int encode(int, int, int)':
decoder.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1

0.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1071 ms	78576 KB	wrong answer
2	Incorrect	875 ms	78600 KB	wrong answer