Submission #1124362

#	Time	Username	Problem	Language	Result	Execution time	Memory
1124362		Rainmaker2627	동굴 (IOI13_cave)	C++20	100 / 100	210 ms	572 KiB

cave

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

void exploreCave(int N) {
	int s[N], d[N];
	vector<bool> vis(N, false);
	for(int i = 0; i < N; ++i) {
		int cor;
		vector<int> p;
		for(int j = 0; j < N; ++j) if (!vis[j]) p.push_back(j);
		for(int j = 0; j < N-i; ++j) s[p[j]] = 0;
		if (tryCombination(s)==i) cor=1;
		else cor=0;
		for(int j = 0; j < N-i; ++j) s[p[j]] = cor^1;

		int l=0, r=N-i-1;
		while (l<r) {
			int mid = (l+r)/2;
			for (int j = l; j <= mid; ++j) s[p[j]] = cor;
			int res = tryCombination(s);
			for (int j = l; j <= mid; ++j) s[p[j]] = cor^1;
			if (res==i) l=mid+1;
			else r=mid;
		} d[p[l]]=i; s[p[l]]=cor; vis[p[l]]=true;
	} answer(s, d);
}

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