제출 #216183

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

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:16:6: warning: unused variable 'idx' [-Wunused-variable]
  int idx = 0;
      ^~~

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