oj.uz

Submission #962787

# Submission time Handle Problem Language Result Execution time Memory
962787 2024-04-14T08:17:53 Z stev2005 Cave (IOI13_cave) C++17
13 / 100
 10 ms 528 KB 
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;

int n;

inline void subtaask2(){
	/// correct combination is 0, 0 ... 0, 0
	int comb[n];
	int Ans[n];
	memset(comb, 0, sizeof(comb));
	for (int i = 0; i < n; ++i){
		comb[i] = 1;
		Ans[i] = tryCombination(comb);
		comb[i] = 0; 
	}
	answer(comb, Ans);
}

void exploreCave(int N) {
    n = N;
    subtaask2();
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 528 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 10 ms 348 KB Output is correct
9 Correct 8 ms 524 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 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 0 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 0 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 344 KB Answer is wrong
2 Halted 0 ms 0 KB -