Submission #1091933

#TimeUsernameProblemLanguageResultExecution timeMemory
1091933BarbarBrickParrots (IOI11_parrots)C++14
81 / 100
3 ms1344 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

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

void decode(int N, int L, int X[])
{
    vector<int> vec;
    for (int i = 0; i < L; i++)
    {
        vec.push_back(X[i]);
    }
    sort(vec.begin(), vec.end(), greater<int>());
    int mask = 8;
    for (int i = 0; i < N; i++)
    {
        int sum = 0;
        while (vec.size() && vec.back() < mask)
        {
            sum += (1 << vec.back() % 8);
            vec.pop_back();
        }
        output(sum);
        mask += 8;
    }
}
#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...