Submission #813398

#	Time	Username	Problem	Language	Result	Execution time	Memory
813398		OrazB	Cave (IOI13_cave)	C++14	25 / 100	8 ms	392 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

void exploreCave(int n){
	int S[n], D[n];
	for (int i = 0; i < n; i++){
		S[i] = 0;
		D[i] = i;
	}
	int x = tryCombination(S);
	if (x == -1){
		for (int i = 0; i < n; i++){
			S[i] = 1;
			D[i] = tryCombination(S);
			S[i] = 0;
		}
		answer(S, D);
	}else{
		while(1){
			int j = tryCombination(S);
			if (j == -1){
				answer(S, D);
				return;
			}
			S[j] = !S[j];
		}		
	}
}

// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	cin >> t;
// 	while (t--){
		
// 	}
// }

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