oj.uz

Submission #733632

# Submission time Handle Problem Language Result Execution time Memory
733632 2023-05-01T05:59:00 Z khangrl Cave (IOI13_cave) C++14
0 / 100
 26 ms 340 KB 
#include "cave.h"

void exploreCave(int N) {
	int pos[N], ans[N], k, i;
	for(i=0; i<N; i++){
		k=tryCombination(ans);
		if(k==-1){
			ans[i]=1;
			pos[i]=tryCombination(ans);
			ans[i]=0;
			continue ;
		}
		ans[i+1]=1;
		if(k==tryCombination(ans)){
			pos[i]=k;
		}
		else{
			ans[i]=1;
			pos[i]=tryCombination(ans);
			ans[i]=0;
		}
		ans[i+1]=0;
	}
	answer(ans, pos);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 340 KB Output is correct
2 Incorrect 0 ms 212 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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