Submission #868842

#TimeUsernameProblemLanguageResultExecution timeMemory
868842AtabayRajabliCave (IOI13_cave)C++17
0 / 100
193 ms544 KiB
#include "cave.h"

void exploreCave(int n) {
	int a[n] = {0}, ans[n], d[n];
	int q = 0;
	
	int j = 0;
	while(q != -1)
	{
		int q = tryCombination(a);
		for(; j<q; j++)
		{
			ans[j] = a[j];
			d[j] = j;
		}
		a[j] ^= a[j];
	}
	
	answer(ans, 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...