Submission #1237532

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237532		SG2Alok	Cave (IOI13_cave)	C++20	46 / 100	14 ms	516 KiB

cave

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

void exploreCave(int N) {
    int a[N], ans[N];
    for(int i = 0; i < N; i++) a[i] = 0, ans[i] = -1;
    
    int cur = tryCombination(a);
    while(cur != -1){
    	int l = 0, r = N - 1;
    	while(l <= r){
    		int mid = (l + r) / 2;
    		
    		bool lf = false;
    		for(int i = l; i <= mid; i++){
    			if(ans[i] != -1) continue;
    			a[i] = 1 - a[i];
    			int judges = tryCombination(a);
    			if(judges > cur || judges == -1){
    				lf = true;
    				ans[i] = cur;
    				cur = judges;
    				break;
				} else if(judges < cur){
					ans[i] = judges;
					a[i] = 1 - a[i];
				}
			}
			
			if(lf){
				break;
			} else {
				l = mid + 1;
			}
		}
	}
	
	for(int i = 0; i < N; i++){
		if(ans[i] == -1){
			a[i] = 1 - a[i];
			ans[i] = tryCombination(a);
			a[i] = 1 - a[i];
		}
	}
    
	answer(a, ans);
}

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