제출 #589971

#제출 시각아이디문제언어결과실행 시간메모리
589971shezitt동굴 (IOI13_cave)C++14
12 / 100
8 ms392 KiB
#include "cave.h"
#include <iostream>
#include <algorithm>
#include <cstring>

void exploreCave(int N) {
	int a[N];
	memset(a, 0, sizeof a);
	int p = tryCombination(a);
	while(p != -1){
		a[p] = !a[p];
		p = tryCombination(a);
	}
	int b[N];
	for(int i=0; i<N; ++i){
		b[i] = i;
	}
	answer(a, b);
}
#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...