Submission #448291

#TimeUsernameProblemLanguageResultExecution timeMemory
448291M_WCave (IOI13_cave)C++14
12 / 100
536 ms464 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N){
	int a[N], pos[N];
	bool mark[N];
	memset(mark, 0, sizeof mark);
	for(int i = 0; i < N; i++){
		for(int j = 0; j < N; j++)
			if(!mark[j]) a[j] = 0;
		int zero = tryCombination(a), state;
		if(zero != i) state = 0;
		else state = 1;
		
		int l = 0, r = N-1;
		while(l < r){
			int mid = (l + r) / 2;
			for(int j = 0; j <= mid; j++)
				if(!mark[j]) a[j] = state;
			for(int j = mid + 1; j < N; j++)
				if(!mark[j]) a[j] = 1 - state;
			int ret = tryCombination(a);
			if(ret != i) r = mid;
			else l = mid + 1;
		}
		pos[i] = l;
		a[l] = state;
		mark[l] = true;
	}
	answer(a, pos);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...