Submission #97580

#	Time	Username	Problem	Language	Result	Execution time	Memory
97580		someone_aa	Parrots (IOI11_parrots)	C++17	0 / 100	11 ms	1792 KiB

encoder

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

void encode(int N, int M[]) {
    n = N;
    for(int i=0;i<N;i++) {

        int def = 0;
        for(int bit=0;bit<5;bit++) {
            if(i&(1<<bit)) {
                def |= (1<<bit);
            }
        }

        for(int j=0;j<8;j++) {
            if(M[i] & (1<<j)) {
                // on bit

                int curr = def;
                for(int bit=0;bit<3;bit++) {
                    if(j&(1<<bit)) {
                        curr |= (1<<(bit + 5));
                    }
                }
                send(curr);
            }
        }
    }
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
const int maxn = 35;
int arr[maxn];

void decode(int N, int L, int X[]) {
    for(int i=0;i<L;i++) {
        int position = 0;

        for(int j=0;j<5;j++) {
            if(X[i] & (1<<j)) {
                position |= (1<<j);
            }
        }

        int index = 0;
        for(int j=5;j<8;j++) {
            if(X[i] & (1<<j)) {
                index |= (1<<(j-5));
            }
        }
        arr[position] |= (1<<index);
    }

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

}

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