제출 #226515

#제출 시각아이디문제언어결과실행 시간메모리
226515MBmasher동굴 (IOI13_cave)C++14
25 / 100
33 ms512 KiB
#include "cave.h"

void exploreCave(int N) {
    int combination[N] = {0};
	int curHighest = -1;
	int switches[N] = {};
	
	curHighest = tryCombination(combination);
		
	if (curHighest == -1) {
		for (int i=0;i<N;i++) {
			int combination[N] = {0};
			combination[i] = 1;
			switches[i] = tryCombination(combination);
		}
		int combination[N] = {0};
	} else {
		while (true) {
			curHighest = tryCombination(combination);
			
			if (curHighest == -1) {
				break;
			} else {
				combination[curHighest] = 1;
			}
		}
		for (int i=0;i<N;i++) {
			switches[i] = i;
		}
	}
	
	
	
	answer(combination, switches);
}

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:16:7: warning: unused variable 'combination' [-Wunused-variable]
   int combination[N] = {0};
       ^~~~~~~~~~~
#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...