Submission #1268855

#TimeUsernameProblemLanguageResultExecution timeMemory
1268855nerrrminParrots (IOI11_parrots)C++20
81 / 100
2 ms840 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
int n, a[maxn];
void encode(int N, int M[])
{
  n = N;

    for (int i = 0; i < n; ++ i)
    {
        a[i] = M[i];
        for (int j = 0; j < 8; ++ j)
        {
            if(a[i] & (1 << j))send(i*8 + j);
        }
    }
}
#include "decoder.h"
#include "decoderlib.h"
using namespace std;

int ans[505];
void decode(int N, int L, int X[])
{
    int n = N;
    int l = L;
    int a;
    for (int i = 0; i < n; ++ i)
        ans[i] = 0;
    for (int i = 0; i < L; ++ i)
    {
        a = X[i];
       int pos = a / 8;
        int bit = a % 8;
        ans[pos] += (1 << bit);
    }
    for (int i = 0; i < n; ++ i)
        output(ans[i]);
}
#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...