Submission #1142394

#TimeUsernameProblemLanguageResultExecution timeMemory
1142394orzdraiduwuCave (IOI13_cave)C++20
0 / 100
15 ms492 KiB
#include "cave.h"
#include <cstring>

void exploreCave(int n) {
	int s[n]; memset(s, 0, sizeof s);
	int d[n]; memset(d, 0, sizeof d);
	for(int i = 0 ; i < n ; i++) {
		d[i] = i;
		int k = tryCombination(s);
		if(i+1 <= k) s[i] = !s[i];
	}

	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...