제출 #230287

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