Submission #68133

#	Time	Username	Problem	Language	Result	Execution time	Memory
68133		zetapi	Parrots (IOI11_parrots)	C++14	97 / 100	15 ms	2536 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include "bits/stdc++.h"
using namespace std;
 
#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 
 
typedef pair<int,int>  pii;
 
const int MAX=1e5;
 
void encode(int N,int M[])
{
	for(int A=0;A<N;A++)
		for(int B=0;B<8;B+=2)
			if((M[A]&(1<<B)) and (M[A]&(1<<(B+1))))
           		send((8*A+B)/2);		
           	else if(M[A]&(1<<B))
           		send((8*A+B)/2),
           		send((8*A+B)/2);
           	else if(M[A]&(1<<(B+1)))
           		send((8*A+B)/2),
           		send((8*A+B)/2),
           		send((8*A+B)/2);
	return ;
}

decoder

#include "decoder.h"
#include "decoderlib.h"
 
void decode(int N, int L, int X[])
{
	int arr[1000]={0};
	for(int A=0;A<L;A++)
		arr[X[A]]++;
	for(int A=0;A<N;A++)
	{
		int cur=0;
		for(int B=0;B<8;B+=2)
			if(arr[(A*8+B)/2]==1)
				cur+=(1<<B),cur+=(1<<(B+1));
			else if(arr[(A*8+B)/2]==2)
				cur+=(1<<B);
			else if(arr[(A*8+B)/2]==3)
				cur+=(1<<(B+1));
		output(cur);
	}
	return ;
}

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