제출 #216181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
216181		MODDI	동굴 (IOI13_cave)	C++14	0 / 100	5 ms	384 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];
	bool found[n];
	memset(found,0,sizeof(found));
	memset(arr, 0, sizeof(arr));
	memset(door,0,sizeof(door));
	int	idx = 0;
	while(true){
		int pos = tryCombination(arr);
		if(pos == -1){
			break;
		}
		else{
			if(pos >= idx)
				for(int i = idx; i < pos;i++)
					door[i] = arr[i];
					
			arr[pos] = 1 - arr[pos];
			//door[pos] = arr[pos];
			idx = pos;
		}
	}
	/*for(int i = 0; i < n; i++){
		arr[i] = 1 - arr[i];
		int pos = tryCombination(arr);
		//for(int j = 0; j < n;j++)
		//	cout<<arr[j]<<" ";
			
		//cout<<pos<<endl;
		door[i] = pos;
		arr[i] = 1 - arr[i];
	}*/
	answer(arr, door);
}

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