제출 #131224

#제출 시각아이디문제언어결과실행 시간메모리
131224arthurconmy앵무새 (IOI11_parrots)C++14
81 / 100
7 ms1672 KiB
/* Arthur Conmy / arthurconmy */
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>
using namespace std;

#ifndef ARTHUR_LOCAL
	#include "encoder.h"
	#include "encoderlib.h"
#endif

void encode(int N, int M[])
{
	for(int i=0; i<N; i++)
	{
		for(int j=0; j<8; j++)
		{
			if(1<<j & M[i]) send((8*i) + j);
		}
	}
}
/* Arthur Conmy / arthurconmy */
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>
using namespace std;

#ifndef ARTHUR_LOCAL
	#include "decoder.h"
	#include "decoderlib.h"
#endif

void decode(int N, int L, int X[])
{
	vector<int> ans(N);

	for(int ind=0; ind<L; ind++)
	{
		int i=int(X[ind]/8);
		int j=X[ind]%8;

		ans[i]+=1<<j;
	}

	for(auto u:ans) output(u);

 	// int i, b;
 	// for(i=0; i<L; i++)
 	// {
  	//   	b = X[i];
  	//   	output(b);
  	// }
}
#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...