제출 #81032

#제출 시각아이디문제언어결과실행 시간메모리
81032arman_ferdous동굴 (IOI13_cave)C++17
34 / 100
62 ms612 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

void exploreCave(int N) {
    int S[N], D[N];
    memset(S,0,sizeof S);
    for(;;) {
    	int bad = tryCombination(S);
    	if(bad == -1) break;
    	for(int i = 0; i < N; i++) {
    		S[i] ^= 1;
    		int door = tryCombination(S);
    		if(door == -1 || door > bad) break;
    		S[i] ^= 1;
    	}
    }
    for(int i = 0; i < N; i++) {
    	S[i] ^= 1;
    	int door = tryCombination(S);
    	S[i] ^= 1;
    	D[i] = door;
    } answer(S,D);
}
#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...