Submission #216176

#	Time	Username	Problem	Language	Result	Execution time	Memory
216176		MODDI	동굴 (IOI13_cave)	C++14	12 / 100	24 ms	512 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vll vector<pll>
#define vii vector<pii>
using namespace std;
void exploreCave(int n){
	int arr[n], door[n];
	memset(arr, 0, sizeof(arr));
	memset(door,0,sizeof(door));
	while(true){
		int pos = tryCombination(arr);
		if(pos == -1){
			break;
		}
		arr[pos] = 1 - arr[pos];
	}
	for(int i = 0; i < n; i++){
		arr[i] = 1 - arr[i];
		int pos = tryCombination(arr);
		door[pos] = i;
		arr[i] = 1 - arr[i];
	}
	answer(arr, door);
}

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