제출 #57603

#제출 시각아이디문제언어결과실행 시간메모리
57603kimjg1119앵무새 (IOI11_parrots)C++17
34 / 100
8 ms2008 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <stdio.h>

void encode(int N, int M[])
{
	int i, res[16];
	for (i = 0; i < N; i++)
	{
		res[i] = (M[i] << 8) + i;
		send(res[i]);
	}
}
#include "decoder.h"
#include "decoderlib.h"
#include <stdio.h>

void decode(int N, int L, int X[])
{
  int i, b;
  for (i = 0; i < L; i++) {
	  for (int j = 0; j < L; j++)
	  {
		  b = X[j];
		  if (b % 256 == i)
		  {
			  b = b >> 8;

			  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...