oj.uz

Submission #928739

# Submission time Handle Problem Language Result Execution time Memory
928739 2024-02-17T03:24:44 Z Juanchoki Cave (IOI13_cave) C++14
0 / 100
 5 ms 348 KB 
#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 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);
		}
		if (temp == last)
		{	
			arr[last++] = 1;
			continue;
		} 
		last = temp;
	}
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 5 ms 348 KB answer() 함수를 반드시 호출해야 합니다.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 348 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 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB answer() 함수를 반드시 호출해야 합니다.
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB answer() 함수를 반드시 호출해야 합니다.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 5 ms 348 KB answer() 함수를 반드시 호출해야 합니다.
3 Halted 0 ms 0 KB -