Submission #283488

#	Time	Username	Problem	Language	Result	Execution time	Memory
283488		Shush	Cave (IOI13_cave)	C++17	33 / 100	140 ms	512 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

int n, *s, *t;

void exploreCave(int N) {
	n = N;
	s = new int[n];
	t = new int[n];
	//Initializing
	for(int i = 0; i < n; i++){
		t[i] = -1;
		s[i] = 0;
	}
	//Subtask 1
//	for(int i = 0; i < n; i++){
//		int c = tryCombination(s);
//		if(c == -1) break;
//		s[c] = 1 - s[c];
//	}
	int j = 0;
	while(j < n){
		int normal_state = tryCombination(s);
		for(int i = 0; i < n; i++){
			if(t[i] != -1) continue;
			s[i] = 1 - s[i]; //Alternation
			int attempt = tryCombination(s);
			if(attempt != normal_state){
				if(attempt == j){
					s[i] = 1 - s[i];
					t[i] = j;
					j++;
					break;
				}
				if(normal_state == j){
					t[i] = j;
					j++;
					break;
				}
			}
			s[i] = 1 - s[i];
		}
	}
	answer(s, t);
}

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