Submission #799307

#	Time	Username	Problem	Language	Result	Execution time	Memory
799307		Liudas	Parrots (IOI11_parrots)	C++17	52 / 100	3 ms	1048 KiB

encoder

#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
//#include "decoder.h"
//#include "decoderlib.h"
using namespace std;
void encode(int N, int M[]){
    for(int i = 0; i < N; i ++){
        int t = M[i];
        int a = t % 4, b = t / 4 % 4, c = t / 16 % 4, d = t / 64 % 4;
        int aa = i * 4 * 4, bb = (i * 4 + 1) * 4, cc = (i * 4 + 2) * 4, dd = (i * 4 + 3) * 4;
        send(aa + a);
        send(bb + b);
        send(cc + c);
        send(dd + d);
        if(i > 15){
            send(aa + a);
            send(bb + b);
            send(cc + c);
            send(dd + d);
        }
    }
}

decoder

#include <bits/stdc++.h>
//#include "encoder.h"
//#include "encoderlib.h"
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[]){
    map<int, int> arr;
    for(int i = 0; i < L;  i++){
        arr[X[i]]++;
    }
    vector<int> left, right, ans(N), brr;
    for(auto[l, r] : arr){
        if(r % 2){
            left.push_back(l);
        }
        if(r > 1){
            right.push_back(l);
        }
    }
    vector<int> ord = left;
    for(int i: right){
        ord.push_back(i);
    }
    for(int i = 0; i < N; i ++){
        int a = ord[i * 4] % 4 + ord[i * 4 + 1] % 4 * 4 + ord[i * 4 + 2] % 4 * 16 + ord[i * 4 + 3] % 4 * 64;
        output(a);
    }
}

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