Submission #402682

#	Time	Username	Problem	Language	Result	Execution time	Memory
402682		prvocislo	Cave (IOI13_cave)	C++17	33 / 100	52 ms	384 KiB

cave

#include "cave.h"
#include <vector>
using namespace std;
void answer(int S[], int D[]);
int tryCombination(int S[]);

int s[5000], d[5000];
void exploreCave(int n) {
	for (int i = 0; i < n; i++) s[i] = 0, d[i] = -1;
	for (int i = 0; i < n; i++)
	{
		for (int sw = 0; sw < n; sw++)
		{
			if (d[sw] != -1) continue;
			s[sw] = 0;
			int ans0 = tryCombination(s);
			if (ans0 == -1) ans0 = n;
			s[sw] = 1;
			int ans1 = tryCombination(s);
			if (ans1 == -1) ans1 = n;
			if (min(ans0, ans1) > i || max(ans0, ans1) <= i) continue;
			if (ans0 > i) s[sw] = 0, d[sw] = i;
			else s[sw] = 1, d[sw] = i;
			break;
		}
	}
	answer(s, d);
}

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