제출 #972091

#제출 시각아이디문제언어결과실행 시간메모리
972091tamir1Cave (IOI13_cave)C++17
46 / 100
10 ms752 KiB
#include "cave.h"
#include<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
	int i;
	if(N<=100){
		while(tryCombination(S)!=-1){
			int x=tryCombination(S);
			for(i=0;i<N;i++){
				//if(S[i]==1) continue;
				S[i]=1-S[i];
				int y=tryCombination(S);
				if(y==-1) break;
				if(y<x) S[i]=1-S[i];
			}
		}
	}
	if(tryCombination(S)==-1){
		for(i=0;i<N;i++){
			S[i]=1-S[i];
			int x=tryCombination(S);
			S[i]=1-S[i];
			D[i]=x;
		}
		answer(S,D);
	}
	for(i=0;i<N;i++) D[i]=i;
	for(i=0;i<N;i++){
		int x=tryCombination(S);
		if(x==-1) break;
		S[x]=1;
	}
    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...