Submission #969571

#TimeUsernameProblemLanguageResultExecution timeMemory
969571tamir1Cave (IOI13_cave)C++17
12 / 100
9 ms768 KiB
#include "cave.h"
#include<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
	int i;
	for(i=0;i<N;i++) D[i]=i;
	for(i=0;i<N;i++){
		int x=tryCombination(S);
		if(x==-1) break;
		S[x]=1;
	}
    answer(S,D);
}
#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...