Submission #226513

#	Time	Username	Problem	Language	Result	Execution time	Memory
226513		MBmasher	동굴 (IOI13_cave)	C++14	12 / 100	17 ms	460 KiB

cave

#include "cave.h"

void exploreCave(int N) {
    int combination[N] = {0};
	int curHighest = -1;
	while (true) {
		curHighest = tryCombination(combination);
		
		if (curHighest == -1) {
			break;
		} else {
			combination[curHighest] = 1;
		}
	}
	
	int switches[N] = {};
	for (int i=0;i<N;i++) {
		switches[i] = i;
	}
	answer(combination, switches);
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24