# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
26974 |
2017-07-08T02:30:29 Z |
grands |
Parrots (IOI11_parrots) |
C++14 |
|
13 ms |
2424 KB |
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
int mask[8] = { 1,2,4,8,16,32,64,128 };
for (int i = 0; i < N; i++){
int message = M[i];
int loc = i << 2;
for (int m = 0; m < 8; m+=2){
if (message&mask[m]){
send(loc + m / 2);
}
if (message&mask[m+1]){
send(loc + m / 2);
send(loc + m / 2);
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]){
int M[64] = { 0 };
for (int i = 0; i < L; i++){
int message = X[i];
int loc = message >> 2;
M[loc] += 1<<((message % 4)*2);
}
for (int i = 0; i < N; i++){
output(M[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
752 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
944 KB |
Error : Encoded message too long |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
1128 KB |
Error : Encoded message too long |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
1248 KB |
Error : Encoded message too long |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
6 ms |
2048 KB |
Output is partially correct - P = 12.000000 |
2 |
Partially correct |
10 ms |
2048 KB |
Output is partially correct - P = 12.000000 |
3 |
Partially correct |
10 ms |
2160 KB |
Output is partially correct - P = 12.000000 |
4 |
Partially correct |
11 ms |
2168 KB |
Output is partially correct - P = 12.000000 |
5 |
Partially correct |
12 ms |
2424 KB |
Output is partially correct - P = 12.000000 |
6 |
Partially correct |
12 ms |
2424 KB |
Output is partially correct - P = 12.000000 |
7 |
Partially correct |
13 ms |
2424 KB |
Output is partially correct - P = 12.000000 |