UVA810 筛子难题 A Dicey Problem

【传送门】

输入格式

输出格式

样例

DICEMAZE1
3 3 1 2 5 1
-1 2 4
5 5 6
6 -1 -1
DICEMAZE2
4 7 2 6 3 6
6 4 6 0 2 6 4
1 2 -1 5 3 6 1
5 3 4 5 6 4 2
4 1 2 0 3 -1 6
DICEMAZE3
3 3 1 1 2 4
2 2 3
4 5 6
-1 -1 -1
END

输出

DICEMAZE1
(1,2),(2,2),(2,3),(3,3),(3,2),(3,1),(2,1),(1,1),(1,2)
DICEMAZE2
(2,6),(2,5),(2,4),(2,3),(2,2),(3,2),(4,2),(4,1),(3,1),
(2,1),(2,2),(2,3),(2,4),(2,5),(1,5),(1,6),(1,7),(2,7),
(3,7),(4,7),(4,6),(3,6),(2,6)
DICEMAZE3
No Solution Possible

思路

骰子的滚动，其实就是交换四个面的值

比如向前，那么就是先保存前面的值temp，前面=上面，上面=后面，后面=底面，底面=temp

然后模拟以下骰子的状态，dfs即可。。。太困了所以只有半成品

代码（未完成

#include <bits/stdc++.h>

using namespace std;

int fw, bk, le, ri, tp, dw, x, y, m, n, X, Y, flag=0;
int a[100][100];
bool vis[100][100];
string ans, ANS;

void toforward()
{
	x--;
	int temp = fw;
	fw = tp;
	tp = bk;
	bk = dw;
	dw = temp;
}

void toback()
{
	x++;
	int temp = bk;
	bk = tp;
	tp = fw;
	fw = dw;
	dw = temp;
}

void toleft()
{
	y--;
	int temp = le;
	le = tp;
	tp = ri;
	ri = dw;
	dw = temp;
}

void toright()
{
	y++;
	int temp = ri;
	ri = tp;
	tp = le;
	le = dw;
	dw = temp;
}

void dfs()
{
	if(flag==1) return;
	if(ans.length()!=0 && x==X && y==Y) {flag=1; ANS=ans; return;}
	ans+=",(";ans+=(x+'0');ans+=", ";ans+=(y+'0');ans+=")";
	
	if(1<=x-1 && x-1<=m && 1<=y && y<=n && !vis[x-1][y] && (a[x-1][y]==tp || a[x-1][y]==-1))
		toforward(),vis[x][y]=true , dfs(), vis[x][y]=false, toback();
		
	if(1<=x+1 && x+1<=m && 1<=y && y<=n && !vis[x+1][y] && (a[x+1][y]==tp || a[x+1][y]==-1))
		toback(),vis[x][y]=true , dfs(), vis[x][y]=false, toforward();
		
	if(1<=x && x<=m && 1<=y-1 && y-1<=n && !vis[x][y-1] && (a[x][y-1]==tp || a[x][y-1]==-1))
		toleft(),vis[x][y]=true , dfs(), vis[x][y]=false, toright();
		
	if(1<=x && x<=m && 1<=y+1 && y+1<=n && !vis[x][y+1] && (a[x][y+1]==tp || a[x][y+1]==-1))
		toright(),vis[x][y]=true , dfs(), vis[x][y]=false, toleft();
		
	for(int i=0; i<7; i++) ans.pop_back();
}

int faceto(int x)
{
	if(x==1) return 6;
	if(x==6) return 1;
	if(x==2) return 5;
	if(x==5) return 2;
	if(x==3) return 4;
	if(x==4) return 3;
}

int main()
{
	cin>>m>>n>>x>>y>>tp>>bk;
	X = x; Y = y;
	for(int i=1; i<=m; i++)
		for(int j=1; j<=n; j++) cin>>a[i][j];
		
	memset(vis, false, sizeof(vis));
	dw = faceto(tp);
	fw = faceto(bk);
	le = 3; ri = 4;
	dfs();
	cout<<ANS<<endl;
	
	return 0;
}

/*
3 3 1 2 5 1
-1 2 4
5 5 6
6 -1 -1
*/