Submission #470423

#	Time	Username	Problem	Language	Result	Execution time	Memory
470423		PiejanVDC	Cave (IOI13_cave)	C++17	0 / 100	69 ms	332 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
	int v[n],d[n];
	memset(v,0,sizeof(v));
	int f = tryCombination(v);
	vector<bool>mark(n,false);
	int t = 0;
	while(true) {
		bool g = false;
		for(int i = t ; i < n ; i+=2) {
			if(mark[i]) continue;
			v[i]=1;
			int com = tryCombination(v);
			if(com == -1) {
				mark[i]=true;
				d[i]=f;
				g=true;
				break;
			}
			if(com < f) {
				v[i]=0;
				d[i]=com;
				mark[i]=true;
			} else if(com > f) {
				d[i]=f;
				f=com;
				mark[i]=true;
				continue;
			}
			v[i]=0;
		}
		if(g) break;
		t=1-t;
	}
	for(int i = 0 ; i < n ; i++) {
		if(mark[i]) continue;
		v[i]=1;
		int cnt = tryCombination(v);
		d[i]=cnt;
		v[i]=0;
	}
	answer(v,d);
}

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