제출 #1237522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237522		SG2Alok	Cave (IOI13_cave)	C++20	33 / 100	17 ms	520 KiB

cave

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

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 mt(seed);

void exploreCave(int N) {
    int a[N], ans[N];
    for(int i = 0; i < N; i++) a[i] = mt()%2, ans[i] = -1;
    
    int cur = tryCombination(a);
    while(cur != -1){
    	for(int i = 0; i < N; i++){
    		if(ans[i] != -1) continue;
    		a[i] = 1 - a[i];
    		int judges = tryCombination(a);
    		if(judges == -1){
    			cur = judges;
    			break;
			}
    		if(judges < cur){
    			a[i] = 1 - a[i];
    			ans[i] = judges;
			} else if(judges > cur){
				ans[i] = judges;
				cur = judges;
			}
		}
	}
    
    for(int i = 0; i < N; i++){
		a[i] = 1 - a[i];
		ans[i] = tryCombination(a);
    	a[i] = 1 - a[i];
	}
	
	answer(a, ans);
}

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