제출 #992873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992873		kokoxuya	앵무새 (IOI11_parrots)	C++14	52 / 100	2 ms	1336 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define pii pair<int,int>
#define ss second
#define ff first
#define debu(x) (cerr << #x  << " = "<< x << "\n")
#define bitout(x,y) {\
	cerr << #x << " : ";\
	for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
	cout << "\n";\
}

void encode(int N, int M[])
{
  for (int a = 0; a < N; a++)
  {
	  for (int b = 0; b < 8; b++)
	  {
		  int thenum = (a << 4);
		  //cout << a << " , ";
		  //bitout(a,8);
		  thenum += (b << 1);
		  thenum += (((1 << b) & M[a]) >=1);
		  //bitout(thenum,8);
		  send(thenum);
	  }
  }
}

decoder

//#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define pii pair<int,int>
#define ss second
#define ff first
#define debu(x) (cerr << #x  << " = "<< x << "\n")
#define bitout(x,y) {\
	cerr << #x << " : ";\
	for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
	cout << "\n";\
}
#include "decoder.h"
#include "decoderlib.h"

void decode(int N, int L, int X[])
{
  vector<int>thenums(N,0);
  for (int a = 0; a < L; a++)
  {
	  int pos = (X[a] >> 4);
	  //debu(pos);
	  X[a]-=(pos << 4);
	  int inpos = (X[a] >> 1);
	  X[a] -= (inpos << 1);
	  thenums[pos] = (thenums[pos] | (X[a] << inpos));
  }
  for(int i=0; i<N; i++) 
  {
    int b = thenums[i];
    output(b);
  }
}

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