Submission #1105166

#	Time	Username	Problem	Language	Result	Execution time	Memory
1105166		jadai007	Cave (IOI13_cave)	C++17	25 / 100	31 ms	560 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int state[N] = {0}, link[N] = {0};
    vector<pair<int, int>> keep;
    for(int i = 0; i < N; ++i){
		int ft = tryCombination(state);
		state[i] = 1;
		int nd = tryCombination(state);
		if(ft == -1){
			state[i] = 0;
			break;
		}
		else if(nd == -1) break;
		if(ft > nd) state[i] = 0; 
	}
	for(int i = 0; i < N; ++i){
		state[i] = !state[i];
		int ck = tryCombination(state);
		link[i] = ck;
		state[i] = !state[i];
	}
	answer(state, link);
}

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