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 "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
#define MAX 10000
using namespace std;
void encode(int N, int M[])
{
for( int i = 0; i < N; i ++ )
for( int j = 0; j < 8; j ++ )
{
// Manda el num
int tmp = 0;
if( ( M[i] & ( 1 << j ) ) == 0 )
continue;
tmp += j;
tmp <<= 5;
tmp += i;
send( tmp );
}
}
#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
#define MAX 10000
using namespace std;
int ans[MAX];
void decode(int N, int L, int X[])
{
for( int i = 0; i < N; i ++ )
ans[i] = 0;
for( int i = 0; i < L; i ++ )
{
int pos = ( X[i] & 31 );
X[i] >>= 5;
int bit = ( X[i] & 7 );
X[i] >>= 3;
ans[pos] += ( 1 << bit );
}
for( int i = 0; i < N; i ++ )
output( ans[i] );
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |