【HDU - 5012】Dice（模拟，bfs）

题干：

There are 2 special dices on the table. On each face of the dice, a distinct number was written. Consider a 1.a 2,a 3,a 4,a 5,a 6 to be numbers written on top face, bottom face, left face, right face, front face and back face of dice A. Similarly, consider b 1.b 2,b 3,b 4,b 5,b 6 to be numbers on specific faces of dice B. It’s guaranteed that all numbers written on dices are integers no smaller than 1 and no more than 6 while a i ≠ a j and b i ≠ b j for all i ≠ j. Specially, sum of numbers on opposite faces may not be 7.

At the beginning, the two dices may face different(which means there exist some i, a i ≠ b i). Ddy wants to make the two dices look the same from all directions(which means for all i, a i = b i) only by the following four rotation operations.(Please read the picture for more information)

Now Ddy wants to calculate the minimal steps that he has to take to achieve his goal.

Input

There are multiple test cases. Please process till EOF.

For each case, the first line consists of six integers a 1,a 2,a 3,a 4,a 5,a 6, representing the numbers on dice A.

The second line consists of six integers b 1,b 2,b 3,b 4,b 5,b 6, representing the numbers on dice B.

Output

For each test case, print a line with a number representing the answer. If there’s no way to make two dices exactly the same, output -1.

Sample Input

1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
1 2 5 6 4 3
1 2 3 4 5 6
1 4 2 5 3 6

Sample Output

0
3
-1

题目大意：

给出两个正方体，每个正方体都有6种颜色，问是否可以经过左转，右转，前转，后转四种转法让两个正方体看起来一样(对应面颜色相同)，最少转几次。

解题报告：

直接bfs。

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define FF first
#define SS second
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
typedef pair<int,int> PII;
const int MAX = 2e5 + 5;
vector<int> aa;
set<vector<int> > ss;
struct Node {vector<int> vv;int s;
};
int bfs(vector<int> st) {queue<Node> q;q.push({st,0});while(q.size()) {Node cur = q.front();q.pop();if(cur.vv == aa) return cur.s;if(ss.count(cur.vv)) continue;ss.insert(cur.vv);vector<int> t = cur.vv,nn(6);//Leftnn[0] = t[3],nn[1] = t[2],nn[2] = t[0],nn[3] = t[1],nn[4] = t[4],nn[5] = t[5];q.push({nn,cur.s+1});//Right nn[0] = t[2],nn[1] = t[3],nn[2] = t[1],nn[3] = t[0],nn[4] = t[4],nn[5] = t[5];q.push({nn,cur.s+1});//Frontnn[0] = t[5],nn[1] = t[4],nn[2] = t[2],nn[3] = t[3],nn[4] = t[0],nn[5] = t[1];q.push({nn,cur.s+1});//Backnn[0] = t[4],nn[1] = t[5],nn[2] = t[2],nn[3] = t[3],nn[4] = t[1],nn[5] = t[0];q.push({nn,cur.s+1});}return -1;
}
int main()
{int z,x,c,v,b,n;while(~scanf("%d%d%d%d%d%d",&z,&x,&c,&v,&b,&n)) {aa.clear(); ss.clear();vector<int> a(6);a[0]=z;a[1]=x;a[2]=c;a[3]=v;a[4]=b;a[5]=n;for(int i = 1; i<=6; i++) {scanf("%d",&x);aa.pb(x);}int ans = bfs(a);printf("%d\n",ans);} return 0 ;
}

【HDU - 5012】Dice（模拟，bfs）相关推荐

poj1426_模拟BFS
题意:给出一个200以内的数n,求出这个数的倍数M,使得M中只有0和1组成.M最多100位. 分析:这个题竟然用的是bfs的思想.不看讨论真的想不出来.思路是这样的: 1.最高位一定是1.curnum ...
HDU - 1495 非常可乐（BFS，数学）
HDU - 1495 非常可乐(BFS,数学) 巨佬的数学解法 #include<iostream> using namespace std; int gcd(int a,int b) { ...
2014 网选 5012 Dice(bfs模板)
1 /* 2 题意:就是给定两个筛子,每个筛子上6个面,每个面的数字属于[1,6], 且互不相同! 3 问a筛子最少经过按照题目规定的要求转动,达到和b筛子上下左右前后的数字相同! 4 5 思路:很直 ...
Hdu 1495 非常可乐、BFS、模拟：【题解】
非常可乐 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Descri ...
HDU 2102 题解（BFS 广度优先搜索练习题）
原题链接,但是HDU现在校外提交需要审核欢迎来 SCPC OJ提交知识点 : BFS(广搜/宽搜) 原题: 描述: 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生 ...
HDU 1104 Remainder （BFS）
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1104 题意:给你一个n.m.k,有四种操作n+m,n-m,n*m,n%m,问你最少经过多少步,使得最后 ...
HDU - 5335 Walk Out(bfs+路径输出+贪心)
题目链接:点击查看题目大意:给出一个矩阵,要求从(1,1)点走到(n,m)点,要求途径数字依次组成的二进制数字最小题目分析:这个题我的心路历程真的是非常坎坷的,就来稍微记录一下吧,或许对以后做题能 ...
csu 1536 Bit String Reordering(模拟 bfs+状态压缩)
http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1536 题意: 输入n个只为 0或1 的数形成一个排列再输入m个数每个数代表目标排列 (样例 ...
HDU 4121 Xiangqi 模拟题
题目: http://acm.hdu.edu.cn/showproblem.php?pid=4121 首先对标题赞一个,非要叫 "Xiangqi" 而不是 "中国象棋&q ...

【HDU - 5012】Dice（模拟，bfs）

【HDU - 5012】Dice（模拟，bfs）相关推荐

最新文章

热门文章