2688097_ac_125ms_72k.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int pos, head;
int t, n, d;
int x, y, z;
char dir[10];
char alpa[] = "n1n3n0nnnnn4nnnnn5nn2";

char turn[6][6][7] = 
{
	{
		"n12n45","0n23n5","01n34n","n12n45","0n23n5","01n34n"
	},
	{
		"n45n12","3n50n2","34n01n","n45n12","3n50n2","34n01n"
	},
	{
		"n00n00","1n11n1","22n22n","n33n33","4n44n4","55n55n"
	},
	{
		"n33n33","4n44n4","55n55n","n00n00","1n11n1","22n22n"
	},
	{
		"n51n24","2n35n0","40n13n","n24n51","5n02n3","13n40n"
	},
	{
		"n24n51","5n02n3","13n40n","n51n24","2n35n0","40n13n"
	}
};

int opp(int t)
{
	if(t>2)
		return t - 3;
	else
		return t + 3;
}

void go()
{
	switch(pos)
	{
	case 0: x += d;break;
	case 1: y += d;break;
	case 2: z += d;break;
	case 3: x -= d;break;
	case 4: y -= d;break;
	case 5: z -= d;break;
	}
}

int main()
{
	int tmp;

	scanf("%d",&t);
	while (t--)
	{
		pos = x = y = z = 0;
		head = 2;
		scanf("%d",&n);
		while (n--)
		{
			scanf("%s%d",dir,&d);
			tmp = pos;
			pos = turn[alpa[dir[0]-'a']-'0'][head][pos]-'0';
			if(dir[0]=='u')
				head = opp(tmp);
			if(dir[0]=='d')
				head = tmp;
			go();
		}
		printf("%d %d %d %d\n",x,y,z,pos);
	}
	return 0;
}