HDU 5012 Dice DFS

简单DFS

 //#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
 #include <stdio.h>
 #include <iostream>
 #include <cstring>
 #include <cmath>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <algorithm>
 #define ll long long
 #define Max(a,b) (((a) > (b)) ? (a) : (b))
 #define Min(a,b) (((a) < (b)) ? (a) : (b))
 #define Abs(x) (((x) > 0) ? (x) : (-(x)))
 using namespace std;

 const int INF = 0x3f3f3f3f;
 const int MAXN = ;
 const double eps = 1e-;

 int a[];
 int b[];
 bool ans;
 int cnt;

 void lleft(){
     int temp_a1 = a[];
     int temp_a2 = a[];
     int temp_a3 = a[];
     int temp_a4 = a[];
     a[] = temp_a4;
     a[] = temp_a3;
     a[] = temp_a1;
     a[] = temp_a2;
 }

 void rright(){
     int temp_a1 = a[];
     int temp_a2 = a[];
     int temp_a3 = a[];
     int temp_a4 = a[];
     a[] = temp_a3;
     a[] = temp_a4;
     a[] = temp_a2;
     a[] = temp_a1;
 }

 void ffront(){
     int temp_a1 = a[];
     int temp_a2 = a[];
     int temp_a5 = a[];
     int temp_a6 = a[];
     a[] = temp_a6;
     a[] = temp_a5;
     a[] = temp_a1;
     a[] = temp_a2;
 }

 void bback(){
     int temp_a1 = a[];
     int temp_a2 = a[];
     int temp_a5 = a[];
     int temp_a6 = a[];
     a[] = temp_a5;
     a[] = temp_a6;
     a[] = temp_a2;
     a[] = temp_a1;
 }

 bool same(){
     if(a[] == b[] && a[] == b[] && a[] == b[] && a[] == b[] && a[] == b[] && a[] == b[])
         return true;
     return false;
 }

 void dfs(int count){
     if(count > ){
         return;
     }
     if(same()){
         if(count < cnt){
             cnt = count;
         }
         return;
     }

     int a1 = a[];
     int a2 = a[];
     int a3 = a[];
     int a4 = a[];
     int a5 = a[];
     int a6 = a[];

     lleft();
     dfs(count + );
     a[] = a1;
     a[] = a2;
     a[] = a3;
     a[] = a4;
     a[] = a5;
     a[] = a6;
     rright();
     dfs(count + );
     a[] = a1;
     a[] = a2;
     a[] = a3;
     a[] = a4;
     a[] = a5;
     a[] = a6;
     ffront();
     dfs(count + );
     a[] = a1;
     a[] = a2;
     a[] = a3;
     a[] = a4;
     a[] = a5;
     a[] = a6;
     bback();
     dfs(count + );
 }

 int main(){
     int i, j, t, n, m, k;
     while(EOF != scanf("%d%d%d%d%d%d",&a[],&a[],&a[],&a[],&a[],&a[])){
         scanf("%d%d%d%d%d%d",&b[],&b[],&b[],&b[],&b[],&b[]);
         cnt = INF;
         ans = false;
         dfs();
         if(cnt != INF)
             printf("%d\n",cnt);
         else
             printf("-1\n");
     }
     return ;
 }