oj.uz

Submission #849

# Submission time Handle Problem Language Result Execution time Memory
849 2013-04-25T08:45:38 Z tncks0121 Parrots (IOI11_parrots) C++
17 / 100
 7 ms 2448 KB 
#include "encoder.h"
#include "encoderlib.h"

void encode (int N, int M[]) {
	for(int i = 0; i < N; i++) if(M[i]) send(i);
}
#include "decoder.h"
#include "decoderlib.h"

int result[100];

void decode (int N, int L, int X[]) {
	for(int i = 0; i < N; i++) result[i] = 0;
	for(int i = 0; i < L; i++) result[X[i]] = 1;
	for(int i = 0; i < N; i++) output(result[i]);
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1736 KB Error : Output is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2032 KB Error : Output is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2032 KB Error : Output is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2032 KB Error : Output is wrong
2 Incorrect 4 ms 2032 KB Error : Output is wrong
3 Incorrect 5 ms 2032 KB Error : Output is wrong
4 Incorrect 5 ms 2448 KB Error : Output is wrong
5 Incorrect 5 ms 2448 KB Error : Output is wrong
6 Incorrect 7 ms 2448 KB Error : Output is wrong
7 Incorrect 7 ms 2448 KB Error : Output is wrong