Submission #43727

#	Time	Username	Problem	Language	Result	Execution time	Memory
43727		baactree	Parrots (IOI11_parrots)	C++14	17 / 100	6 ms	1960 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[]){
	for (int i = 0; i < N; i++) {
		int a = M[i] >> 4;
		int b = M[i] & (0xf);
		send(((i * 2) << 2) + (a >> 2));
		send(((i * 2) << 2) + (a >> 2));
		send(((i * 2) << 2) + (a & 3));
		send(((i * 2 + 1) << 2) + (b >> 2));
		send(((i * 2 + 1) << 2) + (b >> 2));
		send(((i * 2 + 1) << 2) + (b & 3));
	}
}

decoder

#include "decoder.h"
#include "decoderlib.h"

void decode(int N, int L, int X[]){
	int ans[32] = { 0, }, cnt[64][4] = { 0, };
	for (int i = 0; i < L; i++) 
		cnt[X[i] >> 2][X[i] & 3]++;
	for (int i = 0; i < 64; i++) {
		for (int j = 0; j < 4; j++) {
			if (cnt[i][j] == 1) {
				ans[i / 2] |= i & 1 ? j : j << 4;
			}
			else if (cnt[i][j] == 2) {
				ans[i / 2] |= i & 1 ? j << 2 : j << 6;
			}
		}
	}
	for (int i = 0; i < N; i++)
		output(ans[i]);
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 29
• Subtask 5: 0 / 19