#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
int B = 0;
for(int i=0; i<N; i++) {
for (int j=0; j<8; j++) {
if (M[i] & (1<<j)) {send(B);}
B++;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[])
{
int freq[256]={}, B = 0;
for (int i=0; i<L; i++) {
freq[X[i]]++;
}
for (int i=0; i<N; i++) {
int resi = 0;
for (int j=0; j<8; j++) {
if (freq[B]) {resi+=(1<<j);}
B++;
}
output(resi);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
820 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1536 KB |
Output is correct |
2 |
Correct |
10 ms |
1536 KB |
Output is correct |
3 |
Correct |
10 ms |
1536 KB |
Output is correct |
4 |
Correct |
10 ms |
1536 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1536 KB |
Output is correct |
2 |
Correct |
10 ms |
1536 KB |
Output is correct |
3 |
Correct |
10 ms |
1536 KB |
Output is correct |
4 |
Correct |
10 ms |
1536 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1536 KB |
Output is correct |
2 |
Correct |
11 ms |
1536 KB |
Output is correct |
3 |
Correct |
11 ms |
1536 KB |
Output is correct |
4 |
Correct |
12 ms |
1536 KB |
Output is correct |
5 |
Correct |
11 ms |
1536 KB |
Output is correct |
6 |
Correct |
11 ms |
1536 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
10 ms |
1536 KB |
Output is partially correct - P = 8.000000 |
2 |
Partially correct |
13 ms |
1536 KB |
Output is partially correct - P = 8.000000 |
3 |
Incorrect |
8 ms |
904 KB |
Error : Bad encoded integer |
4 |
Incorrect |
9 ms |
908 KB |
Error : Bad encoded integer |
5 |
Incorrect |
9 ms |
920 KB |
Error : Bad encoded integer |
6 |
Incorrect |
9 ms |
904 KB |
Error : Bad encoded integer |
7 |
Incorrect |
9 ms |
1032 KB |
Error : Bad encoded integer |