제출 #421985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421985		pliam	앵무새 (IOI11_parrots)	C++14	88 / 100	13 ms	1368 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[])
{
  if(N<=32){
    //binary system
    for(int num=0;num<N;num++){
      int pos=0;
      while(M[num]>0){
        if(M[num]&1){
          send((num<<3)|pos);
        }
        M[num]>>=1;
        pos++;
      }
    }
  }else{
    //4-ary system
    for(int num=0;num<N;num++){
      int pos=0;
      while(M[num]>0){
        int cnt=M[num]&3;//mod4=mod(2^2), we keep last 2 digits
        if(cnt>=1){
          send((num<<2)|pos);
        }if(cnt>=2){
          send((num<<2)|pos);
        }if(cnt==3){
          send((num<<2)|pos);
        }
        M[num]>>=2;
        pos++;
      }
    }
  }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void decode(int N, int L, int X[])
{
  map<int,int> freq;
  for(int i=0;i<L;i++){
    freq[X[i]]++;
  }
  if(N<=32){
    //binary system
    for(int num=0;num<N;num++){
      int val=0;
      for(int pos=0;pos<8;pos++){
        int mask=(num<<3)|pos;
        if(freq.count(mask)){
          val|=(1<<pos);
        }
      }
      output(val);
    }
  }else{
    //4-ary system
    for(int num=0;num<N;num++){
      int val=0;
      for(int pos=0;pos<4;pos++){
        int mask=(num<<2)|pos;
        if(freq.count(mask)){
          val|=(1<<(2*pos))*freq[mask];
        }
      }
      output(val);
    }
  }
}

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