Submission #839944

#	Time	Username	Problem	Language	Result	Execution time	Memory
839944		Alihan_8	Cave (IOI13_cave)	C++17	0 / 100	2 ms	724 KiB

cave

#include "cave.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back

using i64 = long long;

template <typename _F, typename _S>
bool chmax(_F &u, const _S &v){
	bool flag = false;
	if ( u < v ){
		u = v;
		flag = true;
	}
	return flag;
}

template <typename _F, typename _S>
bool chmin(_F &u, const _S &v){
	bool flag = false;
	if ( u > v ){
		u = v;
		flag = true;
	}
	return flag;
}

void exploreCave(int n) {
	int ans[n], p[n], used[n];
	
	for ( int i = 0; i < n; i++ )
		ans[i] = p[i] = used[i] = 0;
		
	for ( int i = 0; i < n; i++ ){
		vector <int> a;
		for ( int j = 0; j < n; j++ ){
			if ( !used[j]){
				a.pb(j);
			}
		}	
		int m = (int)a.size(), l = 0, r = m - 1;
		int a_l = tryCombination(ans);
		bool flag = false;
		if ( a_l < i + 1 ) {
			for ( int j = 0; j < n; j++ ) {
				if ( !used[j] ) ans[j] = 1;
			}
			flag = true;
		}
		assert(tryCombination(ans) >= i + 1);
		while ( l < r ){
			int md = (l + r) >> 1;
			for ( int i = l; i <= md; i++ ) ans[a[i]] = flag ^ 1;
			int a_r = tryCombination(ans);
			for ( int i = l; i <= md; i++ ) ans[a[i]] = flag;
			if ( a_r >= i + 1 ) l = md + 1;
			else r = md;
		}
		l = a[l];
		ans[l] = flag;
		p[l] = i; 
		used[l] = true;
	}
	answer(ans, p);
}

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