Submission #962787

#TimeUsernameProblemLanguageResultExecution timeMemory
962787stev2005Cave (IOI13_cave)C++17
13 / 100
10 ms528 KiB
#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();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...