oj.uz

Submission #969249

# Submission time Handle Problem Language Result Execution time Memory
969249 2024-04-24T19:36:57 Z elotelo966 Cave (IOI13_cave) C++17
13 / 100
 10 ms 528 KB 
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int a[N],b[N]; // lock? door
    for(int i=0;i<N;i++){
		a[i]=0;
	}
	
	for(int i=0;i<N;i++){
		a[i]^=1;
		int door=tryCombination(a);
		a[i]^=1;
		b[i]=door;
	}
	
	answer(a,b);
	return ;
}

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 528 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 528 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 9 ms 444 KB Output is correct
11 Correct 9 ms 348 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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