Submission #100865

#	Time	Username	Problem	Language	Result	Execution time	Memory
100865		Lawliet	Parrots (IOI11_parrots)	C++14	81 / 100	7 ms	1792 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

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

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>

using namespace std;

void decode(int N, int L, int X[])
{
	sort(X , X + L);
	
	int ans = 0;
	int p = 0;
	
	for(int g = 0 ; g < N*8 ; g++)
	{
		if(p < L && X[p] == g) ans += (1 << (X[p++]%8));
		if(g%8 == 7) output(ans), ans = 0;
	}
}

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