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>
using namespace std;
void encode(int N, int M[])
{
for(int i=0;i<N;i++)
{
for(int j=0;j<8;j++)
{
if(M[i]&(1<<j))
{
send(j*100+i);
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
#include <iostream>
using namespace std;
void decode(int N, int L, int X[])
{
int a[260];
for(int i=0;i<N;i++)
a[i]=0;
int ind;
for(int i=0;i<N;i++)
{
if(X[i]!=0)
{
ind=(X[i]%100);
X[i]/=100;
}
else
ind=0;
if(ind<0||ind>70)
while(1)
cerr<<i<<endl;
a[ind]+=(1<<X[i]);
}
for(int i=0;i<N;i++)
output(a[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... |