oj.uz

Submission #900250

# Submission time Handle Problem Language Result Execution time Memory
900250 2024-01-08T02:35:16 Z boyliguanhan Parrots (IOI11_parrots) C++17
24 / 100
 7 ms 1396 KB 
#include "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[]) {
    for(int i = 0; i < N; i++)
        for(int j = 0; j < 4; j++)
            for(int k = 0; k < (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]{};
    for(int i = 0; i < L; i++)
        res[X[i]>>2] += 1 << (X[i]&3)*2;
    for(auto i: res) output(i);
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 788 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 788 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 788 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 800 KB Error : Encoded message too long
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1328 KB Output is partially correct - P = 12.000000
2 Partially correct 3 ms 1348 KB Output is partially correct - P = 12.000000
3 Partially correct 3 ms 1352 KB Output is partially correct - P = 12.000000
4 Partially correct 5 ms 1368 KB Output is partially correct - P = 12.000000
5 Partially correct 5 ms 1384 KB Output is partially correct - P = 12.000000
6 Partially correct 7 ms 1396 KB Output is partially correct - P = 12.000000
7 Partially correct 5 ms 1388 KB Output is partially correct - P = 12.000000