Submission #590104

#	Time	Username	Problem	Language	Result	Execution time	Memory
590104		shezitt	Cave (IOI13_cave)	C++14	46 / 100	501 ms	832 KiB

cave

#include "cave.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <set>

using namespace std;

void exploreCave(int N) {
	int a[N], b[N];

	for(int i=0; i<N; ++i){
		a[i] = 0;
		b[i] = -1;
	}

	int p = tryCombination(a);

	set<int> found; 


	while(p != -1){
		bool flag = 1;
		

		for(int i=0; i<N; ++i){
			if(found.count(i)){
				continue;
			}
			
			a[i] = !a[i]; 
			int aux = tryCombination(a); 
			if(aux > p || aux == -1){  
				b[i] = p;
				p = aux;
				flag = 0;
				found.insert(i);
				break;
			}
			if(aux < p){ 
				b[i] = aux;
				found.insert(i);
			}
			a[i] = !a[i]; 

		}
		if(flag){
			p = tryCombination(a);
		}
	}


	for(int i=0; i<N; ++i){
		if(found.count(i)){
			continue;
		}
		a[i] = !a[i];
		b[i] = tryCombination(a);
		a[i] = !a[i];
	}

	answer(a, b);
}

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