제출 #970004

#제출 시각아이디문제언어결과실행 시간메모리
970004tamir1Cave (IOI13_cave)C++17
25 / 100
11 ms604 KiB
#include "cave.h"
#include<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
	int i;
	if(tryCombination(S)==-1){
		for(i=0;i<N;i++){
			S[i]=1;
			int x=tryCombination(S);
			S[i]=0;
			D[i]=x;
		}
		answer(S,D);
	}
	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...