Submission #590077

#	Time	Username	Problem	Language	Result	Execution time	Memory
590077		shezitt	Cave (IOI13_cave)	C++14	13 / 100	12 ms	428 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){
		for(int i=0; i<N; ++i){
			if(found.count(i)){
				continue;
			}
			a[i] = !a[i];
			int aux = tryCombination(a);
			if(aux > p){
				b[i] = p;
				found.insert(p);
				continue;
			}
			if(aux < p){
				b[i] = aux;
				found.insert(aux);
			} 
			a[i] = !a[i];
		}
		p = tryCombination(a);
	}
	for(int i=0; i<N; ++i){
		if(b[i] != -1){
			continue;
		}
		a[i] = !a[i];
		b[i] = tryCombination(a);
		a[i] = !a[i];
	}
	answer(a, b);
}

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