#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[]) {
int sum=0;
for(int i = 0; i < N; i++)
for(int j = 0; j < 4; j++)
sum+=(M[i]>>j*2)&3;
if(sum>6*N)
send(0),send(0),send(0),send(0);
for(int i = 0; i < N; i++)
for(int j = 0; j < 4; j++)
for(int k = 0; k < (((sum>6*N?255-M[i]:M[i])>>j*2)&3); k++)
send(i*4+j);
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]) {
int res[N]{},cnt[256]{}, inv=0;
for(int i = 0; i < L; i++) {
cnt[X[i]]++,res[X[i]/4] += 1 << (X[i]&3)*2;
if(cnt[X[i]]==4)
res[0]-=4,inv=1;
}
for(auto i: res)
output(inv?255-i:i);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
780 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1056 KB |
Output is correct |
2 |
Correct |
1 ms |
1312 KB |
Output is correct |
3 |
Correct |
1 ms |
1320 KB |
Output is correct |
4 |
Correct |
1 ms |
1312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1304 KB |
Output is correct |
2 |
Correct |
1 ms |
1316 KB |
Output is correct |
3 |
Correct |
1 ms |
1312 KB |
Output is correct |
4 |
Correct |
1 ms |
1312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1304 KB |
Output is correct |
2 |
Correct |
1 ms |
1320 KB |
Output is correct |
3 |
Correct |
1 ms |
1568 KB |
Output is correct |
4 |
Correct |
4 ms |
1336 KB |
Output is correct |
5 |
Correct |
3 ms |
1332 KB |
Output is correct |
6 |
Correct |
3 ms |
1336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
3 ms |
1464 KB |
Output is partially correct - P = 6.187500 |
2 |
Partially correct |
3 ms |
1328 KB |
Output is partially correct - P = 6.093750 |
3 |
Partially correct |
3 ms |
1328 KB |
Output is partially correct - P = 6.090909 |
4 |
Partially correct |
4 ms |
1348 KB |
Output is partially correct - P = 6.020000 |
5 |
Partially correct |
5 ms |
1368 KB |
Output is partially correct - P = 6.033333 |
6 |
Partially correct |
6 ms |
1372 KB |
Output is partially correct - P = 6.047619 |
7 |
Partially correct |
5 ms |
1368 KB |
Output is partially correct - P = 6.031250 |