oj.uz

Submission #230277

# Submission time Handle Problem Language Result Execution time Memory
230277 2020-05-09T13:23:11 Z Amy313 Cave (IOI13_cave) C++14
0 / 100
 13 ms 384 KB 
#include "cave.h"
using namespace std;
void exploreCave(int N) {
    int S[N];
    int D[N];
    for(int i=0; i<N; i++)
	{
		S[i] = 0;
		D[i] = 1;
	}
	for(int i=0; i<N; i++)
	{
		int x =tryCombination(S);
		if(x==-1)break;
		if(x==i)S[i]=1;
	}
	answer(S, D);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -