Submission #255494

#	Time	Username	Problem	Language	Result	Execution time	Memory
255494		babo	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++14	0 / 100	2253 ms	48120 KiB

encoder

int encode(int n,int x,int y){
	//printf("x %d y %d\n",x,y);
	int i;
	int xx[10]={};
	int yy[10]={};
	int xc[10]={};
	int yc[10]={};
	for(i=0;i<10;i++)
	{
		xx[i]=(x&(1<<i))?1:0;
		yy[i]=(y&(1<<i))?1:0;
		//printf("%d %d\n",xx[i],yy[i]);
	}
	//puts("");
	for(i=0;i<10;i++)
	{
		xc[i]=xx[i]!=xx[(i+1)%10]?1:0;
		yc[i]=yy[i]!=yy[(i+1)%10]?1:0;
		//printf("%d %d\n",xc[i],yc[i]);
	}
	//puts("");
	for(i=0;i<10;i++)
		if(xc[i]&&!yc[i]) return i+1;
	if(x&1) return 11;
	return 12;
}

decoder

int decode(int n,int q,int h){
	//printf("h %lld\n",h);
	if(h==11) return (q&1)==1;
	if(h==12) return (q&1)==0;
	int i;
	int qq[10]={};
	for(i=0;i<10;i++)
	{
		qq[i]=(q&(1<<i))?1:0;
	}
	return qq[h-1]!=qq[h%10];
}

• Subtask 1: 0 / 100