• <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
            

            

            


            
	
		

            常用鏈接
            

		

            統(tǒng)計
            
	
		

            積分與排名
            


		
		
            百事通
            
		
				
			
	

		

            最新評論
	
            

            
	
			
		

            
		
	

            

            
	
					
	
            
		
            
			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 此最相思 閱讀(361) 評論(0)  編輯 收藏 引用  所屬分類: bfs 
		
            
	
            
	
	


	


            
	    
    




            






            

				

            



    
    







            
	   
	



欧美精品丝袜久久久中文字幕
|
久久人做人爽一区二区三区|
狠色狠色狠狠色综合久久|
久久精品卫校国产小美女|
久久最新免费视频|
国产日韩欧美久久|
久久中文字幕一区二区|
99久久精品国产高清一区二区|
无码国内精品久久人妻|
精品久久久久久无码专区不卡|
久久人人妻人人爽人人爽|
无码人妻久久一区二区三区免费|
久久青青草视频|
亚洲AV无码久久精品色欲|
性欧美大战久久久久久久久|
久久亚洲日韩精品一区二区三区|
精品无码久久久久国产动漫3d|
久久久久久久久久久久久久|
国产亚洲精品久久久久秋霞|
亚洲综合精品香蕉久久网|
国产成人精品久久免费动漫|
狠狠久久亚洲欧美专区
|
久久人与动人物a级毛片|
亚洲AV成人无码久久精品老人|
精品久久久久久成人AV|
国产视频久久|
中文字幕热久久久久久久|
人妻无码中文久久久久专区|
99久久久精品|
一个色综合久久|
精品久久久久久无码中文字幕一区|
99久久免费国产精品|
亚洲国产成人精品91久久久
|
国产精品久久久久久久久久影院
|
久久久久久亚洲精品无码|
久久国产精品无|
久久精品毛片免费观看|
精品国产91久久久久久久a|
久久WWW免费人成一看片|
久久精品一区二区国产|
青青草原综合久久大伊人|