Submission #310789

#	Time	Username	Problem	Language	Result	Execution time	Memory
310789		LucaDantas	Parrots (IOI11_parrots)	C++17	88 / 100	11 ms	1792 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include<cstdio>
 
void encode(int N, int M[])
{
	if(N <= 32) {
		for(int i = 0; i < N; i++) {
			for(int bit = 0; bit < 8; bit++)
				if(M[i]&(1<<bit))
					send(8*i+bit);
		}
	} else {
		for(int i = 0; i < N; i++) {
			for(int bit = 0; bit < 4; bit++) {
				int cnt = (M[i] >> (2*bit))&3;
				while(cnt--) send(4*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[])
{
	memset(BIT, 0, sizeof BIT);
	if(N <= 32) {
		std::sort(X, X+L);
		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);
		}
	} else {
		for(int i = 0; i < L; i++)
			BIT[X[i]]++;
		for(int i = 0; i < N; i++) {
			int here = 0;
			for(int bit = 0; bit < 4; bit++) {
				here += (BIT[4*i+bit]) << (2*bit);
			}
			output(here);
		}
	}
}

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