# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
789147 | Ronin13 | Parrots (IOI11_parrots) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int x[])
{
int ans[N];
fill(ans, ans + N, 0);
for(int i = 0; i < L; i++){
int o = x[i] / 8;
ans[o] += (1 << (x[i] % 8));
}
for(int i = 0; i < N; i++)
output(ans[i]);
}
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
for(int i= 0; i < N; i++){
int x = i * 8;
for(int j = 0; j < 8; j++){
if(M[i] & (1 << j)){
send(x + j);
}
}
}
}