Submission #1199854

#TimeUsernameProblemLanguageResultExecution timeMemory
1199854raphaelpParrots (IOI11_parrots)C++20
0 / 100
2 ms836 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

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

void decode(int N, int L, int X[])
{
    vector<int> Tab;
    for (int i = 0; i < L; i++)
        Tab.push_back(X[i]);
    sort(Tab.begin(), Tab.end());
    int buff = 0, buff2 = 0;
    for (int i = 0; i < N; i++)
    {
        int x = 0;
        for (int j = 0; j < 8; j++)
        {
            x *= 2;
            if (Tab[buff] == buff2)
                x++, buff++;
            buff2++;
        }
        output(x);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...