제출 #672827

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

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int n){
	int pos[n];
	int switched[n];
	for(int i = 0;i<n;i++) 
	{
		pos[i] = 0;
		switched[i] = 0;
	}
	
	vector<bool> vis(n,0);
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			if(!vis[j])
				switched[j] = 0;
		}
		int l = 0;
		int r = n-1;
		int x = tryCombination(switched);
		int mid = 0;
		int flag = 0;
		if(x == i){
			flag = 1;
		}
		while(l<r){
			mid = (l+r) /2;
			for(int h = l;h<=mid;h++){
				if(!vis[h])
					switched[h] = flag;
			}
			for(int h = 0;h<l;h++){
				if(!vis[h])
					switched[h] = !flag;
			}
			for(int h = mid+1;h<n;h++){
				if(!vis[h])
					switched[h] = !flag;
			}
			x = tryCombination(switched);
			if(x == i)
				l = mid;
			else r = mid;
		}
		vis[r] = 1;
		pos[r] = i;
		switched[i] = flag; 
	}
	answer(switched,pos);
}

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