제출 #456174

#제출 시각아이디문제언어결과실행 시간메모리
456174fuad27Cave (IOI13_cave)C++14
25 / 100
20 ms420 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
	int S[N+1];
	int t[N+1];
	for(int i = 0 ; i < N ; ++i) S[i] = 0, t[i] = i;
	int val = tryCombination(S);
	if(val == -1)
	{
		for(int i = 0 ; i < N ; ++i){
			S[i] = 1;
			t[i] = tryCombination(S);
			S[i] = 0;
		}
		}	
	else{
		while(val != -1) {
			S[val] = !S[val];
			val = tryCombination(S);
		}
	}
	answer(S, t);
}
#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...