Submission #310778

#	Time	Username	Problem	Language	Result	Execution time	Memory
310778		LucaDantas	Parrots (IOI11_parrots)	C++17	0 / 100	3 ms	1544 KiB

encoder

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

void encode(int N, int M[])
{
	for(int i = 0; i < N; i++) {
		for(int bit = 0; bit < 8; bit++)
			if(M[i]&(1<<bit))
				send(8*i+bit);
	}
}

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+N);
	memset(BIT, 0, sizeof BIT);
	for(int i = 0; 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])
				here += (1 << bit);
		}
		output(here);
	}
}

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