제출 #1243424

#제출 시각아이디문제언어결과실행 시간메모리
1243424whatisdp앵무새 (IOI11_parrots)C++17
34 / 100
1 ms840 KiB
#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[])
{
  int i;
  for(i=0; i<N; i++) {
    // right part M[i] & 15
    //left part M[i] >> 4
    send(((2*i) << 4) | M[i] >> 4);
    send(((2*i+1) << 4) | M[i] & 15);
  }
}
#include "decoder.h"
#include "decoderlib.h"
#include <vector>
void decode(int N, int L, int X[])
{
  int i, b, p;
  std::vector<int> vl(N);
  for(i=0; i<L; i++) {
    b = X[i] & 15;
    p = X[i] >> 4;
    if (p%2==0) {
		vl[p/2]|=b<<4;
	}
    else {
		vl[p/2]|=b;
	}
  }
  for(auto &c:vl) output(c);
}
#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...