제출 #766347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766347		anaduguleanu	앵무새 (IOI11_parrots)	C++14	98 / 100	8 ms	1360 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#include <iostream>
#include <vector>
using namespace std;
void encode(int N, int M[])
{
    vector <int> v1, v2 = {255, 255, 255, 255};
    for (int i = 0; i < N; i++)
        for (int j = 0; j < 4; j++)
        {
            bool bit1 = M[i] & (1 << (2 * j));
            bool bit2 = M[i] & (1 << (2 * j + 1));
            int val = bit1 + 2 * bit2;
            int pos = 4 * i + j;
            for (int k = 0; k < val; k++)
                v1.push_back(pos);
            for (int k = 0; k < 3 - val; k++)
                v2.push_back(pos);
        }
    if (v1.size() < v2.size())
        for (auto it : v1)
            send(it);
    else
        for (auto it : v2)
            send(it);
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <iostream>
#include <vector>
using namespace std;
void decode(int N, int L, int X[])
{
    vector <int> freq(260, 0);
    for (int i = 0; i < L; i++)
        freq[X[i]]++;
    int ok;
    if (freq[255] < 4)
        ok = 0;
    else
    {
        ok = 1;
        freq[255] = freq[255] - 4;
    }
    for (int i = 0; i < N; i++)
    {
        int val = 0;
        for (int j = 0; j < 4; j++)
        {
            int aux = freq[4 * i + j];
            if (aux == 1)
                val = val | (1 << (2 * j));
            else
                if (aux == 2)
                    val = val | (1 << (2 * j + 1));
                else
                    if (aux == 3)
                    {
                        val = val | (1 << (2 * j));
                        val = val | (1 << (2 * j + 1));
                    }
        }
        if (ok == 1)
            val = (~val) & 255;
        output(val);
    }
}

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