Submission #39291

#	Time	Username	Problem	Language	Result	Execution time	Memory
39291		ykmyou	Parrots (IOI11_parrots)	C++14	81 / 100	7 ms	2272 KiB

encoder

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

const int cand[] = { 128, 64, 32, 16, 8, 4, 2, 1 };
void encode(int N, int M[])
{
	for (int i = 0; i < N; i++) {
		int val = M[i];
		for (int j = 0; j < 8; j++) {
			if (cand[j] <= val) {
				if (32 <= i) {
					send(i * 8 + j);
					send(i * 8 + j);
				}
				else
					send(i * 8 + j);
				val -= cand[j];
			}
		}
	}
}

decoder

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


const int cand[] = { 128, 64, 32, 16, 8, 4, 2, 1 };
void decode(int N, int L, int X[])
{
	int cnt[256] = { 0, };
	for (int i = 0; i < L; i++) cnt[X[i]]++;

	for (int i = 0; i < N; i++) {
		int val = 0;
		for (int j = 0; j < L; j++) {
			int b = X[j];
			if (i < 32){
				if (b / 8 ==i && (cnt[b] == 1 || cnt[b] == 3))
					val += cand[b % 8];
			}
			else {
				if (b / 8 == i && (cnt[b] == 2 || cnt[b] == 3))
					val += cand[b % 8];
			}
		}
		output(val);
	}
}

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