제출 #928740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928740		Juanchoki	동굴 (IOI13_cave)	C++14	12 / 100	8 ms	604 KiB

cave

#include"cave.h"
#include <bits/stdc++.h>
using namespace std;
/*
int S[1<<20], D[1<<20];
int N; 
int tryCombination(int comb[])
{
	for (int i = 0; i < N; i++)
		if (S[i] != comb[i]) 	
			return i;
	return -1;
}
void answer (int arr[], int otro[])
{
	for (int i = 0; i < N; i++)
		if (arr[i] != S[i])
		{
			cout << "WA";
			return;
		}
	for (int i = 0; i < N; i++)
		if (otro[i] != D[i])
		{
			cout << "WA";
			return;
		}
	cout << "AC";
}
void imprime (int arr[])
{
	for (int i = 0; i < N; i++)
		cout << arr[i] << " ";
	cout << '\n';
}
*/
void exploreCave(int N)
{
	int arr[N];
	int otro[N];
	for (int i = 0; i < N; i++)
	{
		arr[i] = 0;
		otro[i] = i;
	}
		
	int last = 0;
	while (last < N)
	{
		int temp = tryCombination(arr);
		if (temp == -1)
		{
			answer(arr, otro);
			return;
		}
		if (temp == last)
		{	
			arr[last++] = 1;
			continue;
		} 
		last = temp;
	}
//	imprime(arr);
//	imprime(otro);
	answer(arr, otro);
}

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