제출 #157288

#제출 시각아이디문제언어결과실행 시간메모리
157288ZikXewen동굴 (IOI13_cave)C++11
100 / 100
366 ms608 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

void exploreCave(int N){
	int st[N] = {}, nw[N] = {}, ga[N] = {}, ct = 0;
	vector<int> lf(N);
	iota(lf.begin(), lf.end(), 0);
	for(int i = 0; i < N; i++) {
		int l = 0, r = lf.size() - 1;
		bool op = (tryCombination(st) == i);
		while(l < r) {
			int m = (l + r) >> 1;
			copy(st, st + N, nw);
			for(int j = l; j <= m; j++) nw[lf[j]] = !st[lf[j]];
			if((tryCombination(nw) == i) != op) r = m;
			else l = m + 1;
		}
		st[lf[l]] = op;
		ga[lf[l]] = i; 
		lf.erase(lf.begin() + l);
	}
	answer(st, ga);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:6:42: warning: unused variable 'ct' [-Wunused-variable]
  int st[N] = {}, nw[N] = {}, ga[N] = {}, ct = 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...