#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[]) {
for(int i = 0; i < N; i++)
for(int j = 0; j < 8; j++)
if((1 << j) & M[i]) // se o bit tá ativo
send(i*8 + j);
}
#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]) {
int M[N];
memset(M, 0, sizeof(M));
for(int i = 0; i < L; i++)
M[X[i]/8] += (1 << (X[i]%8));
for(int i = 0; i < N; i++)
output(M[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
792 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1312 KB |
Output is correct |
2 |
Correct |
1 ms |
1300 KB |
Output is correct |
3 |
Correct |
2 ms |
1312 KB |
Output is correct |
4 |
Correct |
2 ms |
1316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1296 KB |
Output is correct |
2 |
Correct |
2 ms |
1308 KB |
Output is correct |
3 |
Correct |
1 ms |
1312 KB |
Output is correct |
4 |
Correct |
2 ms |
1320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1308 KB |
Output is correct |
2 |
Correct |
2 ms |
1328 KB |
Output is correct |
3 |
Correct |
2 ms |
1324 KB |
Output is correct |
4 |
Correct |
3 ms |
1320 KB |
Output is correct |
5 |
Correct |
2 ms |
1328 KB |
Output is correct |
6 |
Correct |
2 ms |
1332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
1316 KB |
Output is partially correct - P = 8.000000 |
2 |
Partially correct |
3 ms |
1328 KB |
Output is partially correct - P = 8.000000 |
3 |
Incorrect |
0 ms |
796 KB |
Error : Bad encoded integer |
4 |
Incorrect |
0 ms |
796 KB |
Error : Bad encoded integer |
5 |
Incorrect |
1 ms |
780 KB |
Error : Bad encoded integer |
6 |
Incorrect |
1 ms |
1036 KB |
Error : Bad encoded integer |
7 |
Incorrect |
0 ms |
780 KB |
Error : Bad encoded integer |