Submission #1310667

#TimeUsernameProblemLanguageResultExecution timeMemory
1310667dimitri.shengeliaCave (IOI13_cave)C++20
25 / 100
14 ms500 KiB
#include <bits/stdc++.h>
#include"cave.h"

using namespace std;

int tryCombination ( int S[] );

void answer( int S[], int D[] );

void exploreCave( int n ) {

	int a[n], b[n];
	fill ( a, a + n, 0 );

	if ( tryCombination ( a ) != -1 ) {

		for ( int i = 0; i < n; i++ ) {

			a[i] = 0;

			b[i] = i;

			if ( tryCombination ( a ) == i ) {

				a[i] = 1;

			}

		}

		answer( a, b );

	} else {

		for ( int i = 0; i < n; i++ ) {

			a[i] = 1;

			b[i] = tryCombination ( a );

			a[i] = 0;

		}

		answer( a, b );

	}

	return;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...