#include<bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int n, int m[])
{
for(int i = 0; i < n; i++)
{
for(int k = 7; k >= 0; k--)
if(m[i] & (1 << k)) send(k + 8 * i);
}
}
#include<bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int n, int l, int x[])
{
int ans[40];
for(int i = 0; i < n; i++) ans[i] = 0;
for(int i = 0; i < l; i++)
ans[x[i] / 8] += (1 << (x[i] % 8));
for(int i = 0; i < n; i++) output(ans[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
936 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 |
9 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 |
11 ms |
1536 KB |
Output is correct |
5 |
Correct |
12 ms |
1792 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 |
11 ms |
1536 KB |
Output is partially correct - P = 8.000000 |
3 |
Incorrect |
8 ms |
1008 KB |
Error : Bad encoded integer |
4 |
Incorrect |
8 ms |
900 KB |
Error : Bad encoded integer |
5 |
Incorrect |
8 ms |
900 KB |
Error : Bad encoded integer |
6 |
Incorrect |
8 ms |
1008 KB |
Error : Bad encoded integer |
7 |
Incorrect |
9 ms |
1004 KB |
Error : Bad encoded integer |