Submission #216204

#	Time	Username	Problem	Language	Result	Execution time	Memory
216204		MODDI	Cave (IOI13_cave)	C++14	46 / 100	25 ms	512 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vll vector<pll>
#define vii vector<pii>
using namespace std;
 
void exploreCave(int n){
	int arr[n], door[n];
	memset(arr, 0, sizeof(arr));
	memset(door,-1,sizeof(door));
	bool vis[n];
	memset(vis,false,sizeof(vis));
	while(true){
		int pos = tryCombination(arr);
		if(pos == -1){
			break;
		}
		else if(vis[pos])
		{
			int random = rand() % n;
			while(door[random] != -1)
				random = rand() % n;
			arr[random] = 1 - arr[random];
			int pl = tryCombination(arr);
			if(pl == -1)
				break;
			
			if(pl <= pos)
				arr[random] = 1 - arr[random];
			else{
				door[random] = pos;
				vis[pl] = true;
			}
		}
		else{
		arr[pos] = 1 - arr[pos];
			vis[pos] = true;
		}
	}
	for(int i = 0; i < n; i++){
		if(door[i] != -1)
			continue;
			
		arr[i] = 1 - arr[i];
		int pos = tryCombination(arr);
		//for(int j = 0; j < n;j++)
		//	cout<<arr[j]<<" ";
			
		//cout<<pos<<endl;
		door[i] = pos;
		arr[i] = 1 - arr[i];
	}
	answer(arr, door);
}

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