Submission #979360

#	Time	Username	Problem	Language	Result	Execution time	Memory
979360		c2zi6	동굴 (IOI13_cave)	C++14	100 / 100	572 ms	696 KiB

cave

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "cave.h"

void exploreCave(int n) {
	int s[n];
	int d[n];
	rep(i, n) s[i] = 2;

	int tmp[n];
	for (int cur = 0; cur < n; cur++) {
		rep(i, n) tmp[i] = s[i];
		rep(i, n) if (tmp[i] == 2) tmp[i] = 0;

		int bac = (tryCombination(tmp) == cur);

		int l = -1, r = n-1;
		while (l + 1 < r) {
			int m = (l + r) / 2;

			rep(i, n) tmp[i] = s[i];
			replr(i, 0, m) if (tmp[i] == 2) tmp[i] = 1;
			replr(i, m+1, n-1) if (tmp[i] == 2) tmp[i] = 0;

			if ((tryCombination(tmp) == cur) != bac) r = m;
			else l = m;
		}
		s[r] = bac;
		d[r] = cur;
	}

	answer(s, d);
}

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