제출 #310788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
310788		LucaDantas	Parrots (IOI11_parrots)	C++17	81 / 100	4 ms	1792 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include<cstdio>
#include<cstring>

int colocar[600];

void encode(int N, int M[])
{
	memset(colocar, 0, sizeof colocar);
	int ptr = 0;
	for(int i = 0; i < N; i++) {
		for(int bit = 0; bit < 8; bit++)
			if(M[i]&(1<<bit))
				colocar[8*i+bit] = 1, ptr++;
	}
	if(ptr > 256) {
		send(0), send(0);
		for(int i = 0; i < 512; i++)
			colocar[i] = !colocar[i];
	}
	for (int i = 0; i < 512; i++)
		if(colocar[i])
			send(i);
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include<cstdio>
#include<cstring>
#include<algorithm>

int BIT[10000];

void decode(int N, int L, int X[])
{
	std::sort(X, X+L);
	int start = 0, ok = 1;
	if(L > 1 && X[1] == 0)
		start = 2, ok = 0;
	memset(BIT, 0, sizeof BIT);
	for(int i = start; i < L; i++)
		BIT[X[i]] = 1;
	for(int i = 0; i < N; i++) {
		int here = 0;
		for(int bit = 0; bit < 8; bit++) {
			if(BIT[8*i+bit] == ok)
				here += (1 << bit);
		}
		output(here);
	}
}

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