Submission #602226

#	Time	Username	Problem	Language	Result	Execution time	Memory
602226		ThegeekKnight16	Parrots (IOI11_parrots)	C++14	81 / 100	5 ms	1204 KiB

encoder

#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;

void encode(int N, int M[])
{
    int R = 0;
    for (int i = 0; i < N; i++)
    {
        R = (i << 3) + (M[i] & 7);
        send(R);
        R = (i << 3) + ((M[i] >> 3) & 7);
        send(R);
        send(R);
        R = (i << 3) + ((M[i] >> 6) & 7);
        send(R);
        send(R);
        send(R);
        send(R);
        //cerr << "AAAAA" << '\n';
    }
}

decoder

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

void decode(int N, int L, int X[])
{
    int M[300], Marc[300];
    for (int i = 0; i < 266; i++) {M[i] = 0; Marc[i] = 0;}
    sort(X, X+L);

    //cerr << "BBBBBBB" << '\n';
    for (int i = 0; i < L; i++)
    {
        Marc[X[i]]++;
    }

    for (int i = 0; i <= 255; i++)
    {
        if (Marc[i] == 0) continue;

        //cerr << "Marc[" << i << "]: " << Marc[i] << '\n';

        if (Marc[i] & 1) M[(i >> 3)] += ((i & 7) << 0);
        if (Marc[i] & 2) M[(i >> 3)] += ((i & 7) << 3);
        if (Marc[i] & 4) M[(i >> 3)] += ((i & 7) << 6);
    }

    for (int i = 0; i < N; i++) output(M[i]);
}

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