제출 #167428

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
167428		nikatamliani	동굴 (IOI13_cave)	C++14	0 / 100	547 ms	584 KiB

cave

# include "cave.h"
# include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
	int fixed[N], ans[N];
	for(int i = 0; i < N; i ++)fixed[i] = -1;
    for(int i = 0; i < N; i ++){
    	int l = 0, r = N - 1;
    	int cur_x[N], res = 0;
    	bool open;
    	for(int j = 0; j < N; j ++)if(fixed[j] == -1)cur_x[j] = 1; else cur_x[j] = fixed[j];
    	if(tryCombination(cur_x) > i) open = 1;
    	else open = 0;
    	bool ok = false;
    	while(l <= r){
    		if(l == r && ok == true) break;
    		if(l == r)ok = true;
    		int m = (l + r) >> 1;
    		for(int j = l; j <= m; j ++) if(fixed[j] == -1) cur_x[j] = open; else cur_x[j] = fixed[j]; 
    		for(int j = 0; j < N; j ++) if(j < l || j > r){if(fixed[j] == -1) cur_x[j] = open ^ 1; else cur_x[j] = fixed[j];}
    		if(tryCombination(cur_x) > i){
    			r = m;
			}else{
				l = m + 1;
			}
		}
		res = l;
		ans[res] = i;
		fixed[res] = open;
	}
	answer(fixed, ans);
}

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