제출 #1237108

#제출 시각아이디문제언어결과실행 시간메모리
1237108SG2Alok동굴 (IOI13_cave)C++20
13 / 100
8 ms516 KiB
#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;
    
    int cur = tryCombination(a);
    while(cur != -1){
    	for(int i = 0; i < N; i++){
    		a[i] = 1;
    		int judges = tryCombination(a);
    		if(judges > cur){
    			a[i] = 0;
    			ans[i] = judges;
			} else if(judges < cur){
				ans[i] = cur;
				judges = cur;
			}
		}
	}
    
    for(int i = 0; i < N; i++){
    	a[i] = 1 - a[i];
		ans[i] = tryCombination(a);
    	a[i] = 1 - a[i];
	}
	
	answer(a, ans);
}
#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...