hdu5012Dice

Dice

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 462    Accepted Submission(s): 273

Problem Description

There are 2 special dices on the table. On each face of the dice, a distinct number was written. Consider a ₁.a ₂,a ₃,a ₄,a ₅,a ₆ to be numbers written on top face, bottom face, left face, right face, front face and back face of dice A. Similarly, consider b ₁.b ₂,b ₃,b ₄,b ₅,b ₆ 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 ₁,a ₂,a ₃,a ₄,a ₅,a ₆, representing the numbers on dice A. 

The second line consists of six integers b ₁,b ₂,b ₃,b ₄,b ₅,b ₆, 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
  
  
  
  


  
  
  
  


  
  
  
  

   
   一开始算了下总共24种可能，差点就把所有可能都列出来了 ，想法真蠢 o(╯□╰)o
  
  
  
  


  
  
  
  

   
   然后想了下 模拟操作每次也只有4种可能（当然考虑不往回走的话就3种），果断DFS，然后深度也就4，转4次如果还不能出现结果就不必要往下走了~~  BFS 目测也是可以的~     一下x值 0代表向前翻，1代表向右翻，2代表向后翻，3代表向左翻
  
  
  
  


  
  
  
  

   
   #include<iostream>
using namespace std;
int maxx;
int a[6],b[6],aa;
void dfs(int x,int sum){


if(x==0){ aa=a[0];a[0]=a[5];a[5]=a[1] ;a[1]=a[4];a[4]=aa;  }  
else if(x==1){aa=a[0];a[0]=a[2];a[2]=a[1];a[1]=a[3];a[3]=aa;  }
else if(x==2){ aa=a[0];a[0]=a[4];a[4]=a[1];a[1]=a[5];a[5]=aa;  }
else { aa=a[0];a[0]=a[3];a[3]=a[1];a[1]=a[2];a[2]=aa;   }
if(a[0]==b[0]&&a[1]==b[1]&&a[2]==b[2]&&a[3]==b[3]&&a[4]==b[4]&&a[5]==b[5]){
  if(sum<maxx) maxx=sum;
}else {
    if(sum<4){
for(int i=0;i<4;i++){
        dfs(i,sum+1);
if(i==0){aa=a[4]; a[4]=a[1]; a[1]=a[5] ; a[5]=a[0]; a[0]=aa; }
else if(i==1){aa=a[3];a[3]=a[1];a[1]=a[2];a[2]=a[0];a[0]=aa;  }
else if(i==2){ aa=a[5];a[5]=a[1];a[1]=a[4];a[4]=a[0];a[0]=aa;  }
else { aa=a[2];a[2]=a[1];a[1]=a[3];a[3]=a[0];a[0]=aa;   }
}
}
}
}


int main(void){


while(cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>b[0]>>b[1]>>b[2]>>b[3]>>b[4]>>b[5]){
        maxx=5;
        if(a[0]==b[0]&&a[1]==b[1]&&a[2]==b[2]&&a[3]==b[3]&&a[4]==b[4]&&a[5]==b[5]){
        cout<<0<<endl;
    }else {
for(int i=0;i<4;i++){
   dfs(i,1);
   if(i==0){aa=a[4]; a[4]=a[1]; a[1]=a[5] ; a[5]=a[0]; a[0]=aa; }
else if(i==1){aa=a[3];a[3]=a[1];a[1]=a[2];a[2]=a[0];a[0]=aa;  }
else if(i==2){ aa=a[5];a[5]=a[1];a[1]=a[4];a[4]=a[0];a[0]=aa;  }
else { aa=a[2];a[2]=a[1];a[1]=a[3];a[3]=a[0];a[0]=aa;   }
}
if(maxx<5) cout<<maxx<<endl;
else cout<<-1<<endl;
}
}
}