• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>

    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>

            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            

    
            

            




            







												


        

            
	

            misschuer
            

            

            


            
	
		

            常用鏈接
            

		

            統計
            
	
		

            積分與排名
            


		
		
            百事通
            
		
				
			
	

		

            最新評論
	
            

            
	
			
		

            
		
	

            

            
	
					
	
            
		
            
			hdu 1195 Open the Lock  
		
            
		
            http://acm.hdu.edu.cn/showproblem.php?pid=1195

            #include <iostream>
            #include             <queue>
            using namespace std;

            struct root
            {
                            char data[ 5 ];
                
                            int step;
            }            ;

            int visited[ 10000 ];

            char ne[ 5 ] , ps[ 5 ];

            int getdigit(char str[ ])
            {
                            return (str[ 0 ] - '0') * 1000 + (str[ 1 ] - '0') * 100 + (str[ 2 ] - '0') * 10 + (str[ 3 ] - '0');
            }

            void bfs()
            {
                            int i , k;
                
                            char change[ 5 ] , temp;
                
                queue            <root> Q;
                
                root p , q;
                
                strcpy(p.data , ne);
                
                p.step             = 0;
                
                Q.push(p);
                
                            while (!Q.empty())
                            {
                    q             = Q.front();
                    
                    Q.pop();
                    
                                if(strcmp(q.data , ps) == 0)
                                {
                        cout             << q.step << endl;
                        
                                    break;
                    }
                    
                                for (i = 0 ; i < 4 ; ++ i)
                                {
                                    if (i < 3)
                                    {
                            strcpy(change , q.data);
                            
                            temp             = change[ i ];
                            
                            change[ i ]             = change[i + 1];
                            
                            change[i             + 1] = temp;
                            
                            k             = getdigit(change);
                            
                                        if (visited[ k ] == 0)
                                        {
                                visited[ k ]             = 1;
                                
                                strcpy(p.data , change);
                                
                                p.step             = q.step + 1;
                                
                                Q.push(p);
                            }
                            
                            
                        }
                        
                        
                                    if (q.data[ i ] == '1')
                                    {
                            strcpy(change , q.data);
                            
                            change[ i ]             = '9';
                            
                            k             = getdigit(change);
                            
                                        if (visited[ k ] == 0)
                                        {
                                visited[ k ]             = 1;
                                
                                strcpy(p.data , change);
                                
                                p.step             = q.step + 1;
                                
                                Q.push(p);
                            }
                            strcpy(change , q.data); 
                            
                            change[ i ]             = '2';
                            
                            k             = getdigit(change);
                            
                                        if (visited[ k ] == 0)
                                        {
                                visited[ k ]             = 1;
                                
                                strcpy(p.data , change);
                                
                                p.step             = q.step + 1;
                                
                                Q.push(p);
                            }
                            
                        }
                        
                                    else
                                        if( q.data[ i ]  == '9')
                                        {
                                
                                strcpy(change , q.data); 
                                
                                change[ i ]             = '8';
                                
                                k             = getdigit(change);
                                
                                            if (visited[ k ] == 0)
                                            {
                                    visited[ k ]             = 1;
                                    
                                    strcpy(p.data , change);
                                    
                                    p.step             = q.step + 1;
                                    
                                    Q.push(p);
                                }
                                
                                strcpy(change , q.data); 
                                
                                change[ i ]             = '1';
                                
                                k             = getdigit(change);
                                
                                            if (visited[ k ] == 0)
                                            {
                                    visited[ k ]             = 1;
                                    
                                    strcpy(p.data , change);
                                    
                                    p.step             = q.step + 1;
                                    
                                    Q.push(p);
                                }
                                
                            }
                            
                                        else
                                        {
                                strcpy(change , q.data); 
                                
                                change[ i ]             = change[ i ] - 1;
                                
                                k             = getdigit(change);
                                
                                            if (visited[ k ] == 0)
                                            {
                                    visited[ k ]             = 1;
                                    
                                    strcpy(p.data , change);
                                    
                                    p.step             = q.step + 1;
                                    
                                    Q.push(p);
                                }
                                
                                strcpy(change , q.data); 
                                
                                change[ i ]             = change[ i ] + 1;
                                
                                k             = getdigit(change);
                                
                                            if (visited[ k ] == 0)
                                            {
                                    visited[ k ]             = 1;
                                    
                                    strcpy(p.data , change);
                                    
                                    p.step             = q.step + 1;
                                    
                                    Q.push(p);
                                }
                                
                            }            //else
                            
                    }            //for()
                    
                }            //while()
                
            }


            int main()
            {
                            int t;
                
                cin             >> t;
                
                            while (t --)
                            {
                    scanf (            "%s %s" , ne , ps);
                    
                    memset (visited ,             0 , sizeof (visited));
                    
                    bfs();
                }
                
                            return 23;
            }
            

		
            
			posted on 2009-04-19 10:42 此最相思 閱讀(373) 評論(0)  編輯 收藏 引用  所屬分類: bfs 
		
            
	
            
	
	


	


            
	    
    




            






            

				

            



    
    







            
	   
	



欧美粉嫩小泬久久久久久久|
噜噜噜色噜噜噜久久|
久久久久亚洲精品天堂|
久久精品亚洲中文字幕无码麻豆|
久久综合久久综合九色|
一本久久免费视频|
久久精品水蜜桃av综合天堂|
国产国产成人久久精品|
国产亚洲精久久久久久无码77777|
国产精品久久久久久久久鸭|
亚洲七七久久精品中文国产|
国产精品99精品久久免费|
中文精品99久久国产|
青青青青久久精品国产h|
99久久精品免费看国产一区二区三区|
久久精品国产久精国产|
色综合久久综合中文综合网|
日本久久久久久久久久|
亚洲欧美日韩精品久久|
久久w5ww成w人免费|
精品多毛少妇人妻AV免费久久|
久久99热精品|
91精品国产高清久久久久久io|
久久亚洲AV无码精品色午夜|
久久久久亚洲av成人无码电影|
久久久91精品国产一区二区三区|
亚洲国产精品无码久久久不卡|
久久笫一福利免费导航|
亚洲国产一成久久精品国产成人综合
|
亚洲国产另类久久久精品黑人|
国产日韩久久久精品影院首页|
99久久久精品|
2020最新久久久视精品爱|
97久久香蕉国产线看观看|
久久久无码精品亚洲日韩按摩
|
午夜天堂av天堂久久久|
国内精品久久久久国产盗摄|
久久国产乱子伦精品免费强|
麻豆精品久久久一区二区|
色噜噜狠狠先锋影音久久|
99国内精品久久久久久久|