Submission #762288

#	Time	Username	Problem	Language	Result	Execution time	Memory
762288		SanguineChameleon	Cave (IOI13_cave)	C++17	100 / 100	639 ms	472 KiB

cave

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

const int maxN = 5e3 + 20;
int S[maxN];
int D[maxN];
bool flag[maxN];

void exploreCave(int N) {
	for (int i = 0; i < N; i++) {
		D[i] = -1;
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (!flag[j]) {
				S[j] = 0;
			}
		}
		int state = (tryCombination(S) == i);
		int id = 0;
		for (int k = 0; k < 13; k++) {
			for (int j = 0; j < N; j++) {
				if (!flag[j]) {
					S[j] = state ^ ((j >> k) & 1);
				}
			}
			id |= (tryCombination(S) == i) << k;
		}
		S[id] = state;
		D[id] = i;
		flag[id] = true;
	}
	answer(S, D);
}

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