제출 #230282

#제출 시각아이디문제언어결과실행 시간메모리
230282Amy313Cave (IOI13_cave)C++14
0 / 100
5 ms384 KiB
#include "cave.h"
using namespace std;
void exploreCave(int N) {
    int S[N];
    int D[N];
    for(int i=0; i<N; i++)
	{
		S[i] = 0;
		D[i] = 1;
	}
	for(int i=0; i<N; i++)
	{
		int x =tryCombination(S);
		if(x==-1){break;}
		if(x==i){S[i]=i;}
	}
	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...