Submission #1310691

#TimeUsernameProblemLanguageResultExecution timeMemory
1310691ninogogatishvili동굴 (IOI13_cave)C++20
100 / 100
125 ms748 KiB
#include "cave.h"
int w[14][5000],F[5000];
void exploreCave(int N)
{
	int i,j,t,c,ck;
	for(i=0;i<14;i++){
		for(j=0;j<N;j++){
			if((1<<i)&j)w[i][j]=1;
		}
	}
	for(i=0;i<N;i++){
		c=0;
		t=tryCombination(w[13]);
		ck=(t==i);
		for(j=0;j<13;j++){
			t=tryCombination(w[j]);
			if(t==i && !ck)c+=1<<j;
			if(t!=i && ck)c+=1<<j;
		}
		for(j=0;j<14;j++)
			w[j][c]=ck;
		F[c]=i;
	}
	answer(w[0],F);
}
#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...