제출 #231001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231001		peijar	동굴 (IOI13_cave)	C++17	0 / 100	161 ms	448 KiB

cave

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

#define SZ(v) ((int)(v).size())

//void answer(int S[], int D[]);
//int tryCombination(int S[]);

void exploreCave(int nb_portes)
{
	int switches[nb_portes], portes[nb_portes];
	for (int i(0); i < nb_portes; ++i)
		switches[i] = 0;
	vector<bool> fixed(nb_portes);
	int lst_ans(tryCombination(switches));

	auto flip_range = [&](int left, int right)
	{
		for (int i(left); i <= right; ++i)
			if (!fixed[i])
				switches[i] ^= 1;
	};


	for (int i(0); i < nb_portes; ++i)
	{
		int lft(0), rgt(nb_portes);
		while (lft < rgt)
		{
			int mid = (lft + rgt)/2;
			flip_range(lft, mid);
			int nxt_ans = tryCombination(switches);
			if (nxt_ans == -1)
				nxt_ans = nb_portes + 1;
			flip_range(lft, mid);
			if ((lst_ans <= i+1 and nxt_ans > i+1) or (lst_ans > i+1 and nxt_ans <= i+1))
				rgt = mid;
			else
				lft = mid+1;
		}
		if (lst_ans <= i+1)
		{
			switches[lft] ^= 1;
			lst_ans = tryCombination(switches);
			if (lst_ans == -1)
				lst_ans = nb_portes+1;
		}
		fixed[lft] = true;
		portes[i] = lft;
	}
	answer(switches, portes);
}

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