# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233446 | crossing0ver | 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<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
int i;
for(i=0; i<N; i++) {
send(M[i]);
val = i*16;
for (int j = 0; j < 16; j++)
if ( ( 1 << j) & M[i])
send(val + j);
}
}
#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[])
{
int i, b , pos;
vector<int> v(10);
vector<int> ans(N);
for(i=0; i<L; i++) {
b = X[i];
pos = b/16;
ans[pos] += (1 << (X[i]%16) );
}
for (int i = 0; i < N; i++)
output(ans[pos]);
}