제출 #68131

#제출 시각아이디문제언어결과실행 시간메모리
68131zetapi앵무새 (IOI11_parrots)C++14
81 / 100
9 ms2632 KiB
#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++)
			if(M[A]&(1<<B))
           	{
           		//assert(8*A+B<256);
				send(8*A+B);		
           	}
	return ;
}
#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]]=1;
	for(int A=0;A<N;A++)
	{
		int cur=0;
		for(int B=0;B<8;B++)
			if(arr[A*8+B])
				cur+=(1<<B);
		output(cur);
	}
	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...