제출 #235562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235562		DavidDamian	앵무새 (IOI11_parrots)	C++11	81 / 100	12 ms	1536 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
using namespace std;
///Subtask 4
///Represent the numbers as a binary string and send positions of 1's
void encode(int N, int M[])
{
    int idx=0;
    for(int i=0;i<N;i++){
        for(int bit=0;bit<8;bit++){
            if(M[i]&(1<<bit))
                send(idx+bit);
        }
        idx+=8;
    }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
using namespace std;
///Subtask 4
///Represent the numbers as a binary string and send positions of 1's
void decode(int N, int L, int X[])
{
    vector<int> binary(8*N,0);
    sort(X,X+L);
    for(int i=0;i<L;i++){
        binary[X[i]]=1;
    }
    for(int i=0;i<8*N;i+=8){
        int number=0;
        for(int bit=0;bit<8;bit++){
            if(binary[i+bit]) number+=(1<<bit);
        }
        output(number);
    }
}

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