Submission #928740

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
928740	2024-02-17T03:30:53 Z	Juanchoki	Cave (IOI13_cave)	C++14	12 / 100	8 ms	604 KB

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.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	7 ms	348 KB	Output is correct
3	Correct	8 ms	568 KB	Output is correct
4	Correct	6 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	8 ms	504 KB	Output is correct
7	Correct	1 ms	448 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	6 ms	564 KB	Output is correct
13	Correct	6 ms	348 KB	Output is correct
14	Correct	6 ms	348 KB	Output is correct

Subtask #2

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	352 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Incorrect	1 ms	348 KB	Answer is wrong
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	Answer is wrong
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	Answer is wrong
4	Halted	0 ms	0 KB	-

Subtask #5

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	7 ms	348 KB	Output is correct
3	Correct	8 ms	568 KB	Output is correct
4	Correct	6 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	8 ms	504 KB	Output is correct
7	Correct	1 ms	448 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	6 ms	564 KB	Output is correct
13	Correct	6 ms	348 KB	Output is correct
14	Correct	6 ms	348 KB	Output is correct
15	Correct	2 ms	352 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Incorrect	1 ms	348 KB	Answer is wrong
18	Halted	0 ms	0 KB	-