Submission #962832

#	Time	Username	Problem	Language	Result	Execution time	Memory
962832		stev2005	동굴 (IOI13_cave)	C++17	12 / 100	8 ms	564 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
using namespace std;

int n;

inline void subtask1(){
    ///every ith door -- ith switch
    int comb[n];
    int switchd[n];
    memset(comb, 0, sizeof(comb));
	for (int i = 0; i < n; ++i)
		switchd[i] = i;
	int door = tryCombination(comb);
	while (door != -1){
		comb[door] = 1;
		door = tryCombination(comb);
	}
	answer(comb, switchd);
}

inline void subtask2(){
	/// correct combination is 0, 0 ... 0, 0
	int comb[n];
	int Ans[n];
	memset(comb, 0, sizeof(comb));
	for (int i = 0; i < n; ++i){
		comb[i] = 1;
		Ans[i] = tryCombination(comb);
		comb[i] = 0; 
	}
	answer(comb, Ans);
}

void exploreCave(int N) {
    n = N;
    subtask1();
}

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