제출 #67354

#제출 시각아이디문제언어결과실행 시간메모리
67354zetapi앵무새 (IOI11_parrots)C++14
34 / 100
6 ms2160 KiB
#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[])
{
	for(int A=0;A<N;A++)
	{
		int res=A;
		for(int B=0;B<8;B++)
		{
			if(M[A]&(1<<B))
				res+=1<<(B+4);
		}	
		send(res);
	}
	return ;
}
#include "decoder.h"
#include "decoderlib.h"

void decode(int N, int L, int X[])
{
  	int res[1000];
  	for(int A=0;A<N;A++)
  	{
  		int ind=0,num=0;
  		for(int B=0;B<4;B++)
  			if(X[A]&(1<<B))
  				ind+=(1<<B);
  		for(int B=0;B<8;B++)
  			if(X[A]&(1<<(B+4)))
  				num+=(1<<B);
  		res[ind]=num;
  	}
  	for(int A=0;A<N;A++)
  		output(res[A]);
  	return ;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...