Submission #602220

#	Time	Username	Problem	Language	Result	Execution time	Memory
602220		vh50	Parrots (IOI11_parrots)	C++17	81 / 100	7 ms	1260 KiB

encoder

#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
    for(int i = 0; i < N; i++)
        for(int j = 0; j < 3; j++)
        {
            if(j >= 0)  send((i << 3) + (((M[i] >> (3 * j)) & 7)));
            if(j >= 1)  send((i << 3) + (((M[i] >> (3 * j)) & 7)));
            if(j >= 2)  
            {
                send((i << 3) + (((M[i] >> (3 * j)) & 7)));
                send((i << 3) + (((M[i] >> (3 * j)) & 7)));
            }
        }            
}

decoder

#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[])
{
    int marc[300], v[300];
    for(int i = 0; i < 270; i++)    marc[i] = v[i] = 0;
    sort(X, X + L);
    for(int i = 0; i < L; i++)
        marc[X[i]]++;
    for(int i = 0; i < 256; i++)
    {
        if(!marc[i])    continue; 
        if(marc[i] & (1 << 0))  
            v[i >> 3] += ((i & 7) << ((0) * 3));
        if(marc[i] & (1 << 1))
            v[i >> 3] += ((i & 7) << ((1) * 3));
        if(marc[i] & (1 << 2))
            v[i >> 3] += ((i & 7) << ((2) * 3));
    }
    for(int i = 0; i < N; i++)  output(v[i]);
}

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