#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=7;j>=0;j--){
if(M[i]/(1<<j)==1)send(i*8+7-j);
M[i]%=(1<<j);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int s[1010];
void decode(int N, int L, int X[]){
memset(s,0,sizeof(s));
for (int i=0;i<L;i++)s[X[i]]=1;
for (int i=0;i<N;i++){
int ans=0;
for (int j=0;j<=7;j++)ans+=s[i*8+j]*(1<<(7-j));
output(ans);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
892 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1520 KB |
Output is correct |
2 |
Correct |
5 ms |
1568 KB |
Output is correct |
3 |
Correct |
5 ms |
1520 KB |
Output is correct |
4 |
Correct |
5 ms |
1520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1520 KB |
Output is correct |
2 |
Correct |
5 ms |
1600 KB |
Output is correct |
3 |
Correct |
6 ms |
1520 KB |
Output is correct |
4 |
Correct |
5 ms |
1520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1528 KB |
Output is correct |
2 |
Correct |
5 ms |
1528 KB |
Output is correct |
3 |
Correct |
5 ms |
1528 KB |
Output is correct |
4 |
Correct |
7 ms |
1520 KB |
Output is correct |
5 |
Correct |
7 ms |
1520 KB |
Output is correct |
6 |
Correct |
7 ms |
1528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
6 ms |
1520 KB |
Output is partially correct - P = 8.000000 |
2 |
Partially correct |
8 ms |
1520 KB |
Output is partially correct - P = 8.000000 |
3 |
Incorrect |
4 ms |
892 KB |
Error : Bad encoded integer |
4 |
Incorrect |
4 ms |
892 KB |
Error : Bad encoded integer |
5 |
Incorrect |
4 ms |
900 KB |
Error : Bad encoded integer |
6 |
Incorrect |
4 ms |
900 KB |
Error : Bad encoded integer |
7 |
Incorrect |
4 ms |
764 KB |
Error : Bad encoded integer |