Submission #1080781

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080781		Tob	Cave (IOI13_cave)	C++14	0 / 100	253 ms	536 KiB

cave

#include <bits/stdc++.h>

#include "cave.h"

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;

int c[5000], bio[5000], res[5000], sta[5000];

void exploreCave(int n) {
	for (int i = 0; i < n; i++) {
		int lo = 0, hi = n-1;
		memset(c, 0, sizeof c);
		for (int j = 0; j < n; j++) c[j] = (bio[j] ? sta[j] : 0);
		int x = tryCombination(c);
		while (lo < hi) {
			int mid = (lo + hi) / 2;
			memset(c, 0, sizeof c);
			for (int j = 0; j < n; j++) c[j] = (bio[j] ? bio[j] : (j <= mid));
			int y = tryCombination(c);
			if ((x == i && y != i) || (x != i && y == i)) hi = mid;
			else lo = mid+1;
		}
		sta[lo] = (x == i);
		res[lo] = i;
		bio[lo] = 1;
	}
	answer(sta, res);
}

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