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


	


            
	    
    




            






            

				

            



    
    







            
	   
	



欧美久久久久久|
国产精品99久久久久久人|
久久www免费人成精品香蕉|
久久丝袜精品中文字幕|
青青久久精品国产免费看|
亚洲综合精品香蕉久久网|
精品久久久久香蕉网|
久久久久无码中|
亚洲欧美伊人久久综合一区二区|
狠狠色丁香久久综合五月|
欧美大战日韩91综合一区婷婷久久青草|
欧美一区二区久久精品|
夜夜亚洲天天久久|
久久久这里只有精品加勒比|
久久久久人妻一区二区三区vr|
99久久久久|
久久天天躁狠狠躁夜夜avapp|
韩国三级中文字幕hd久久精品|
狼狼综合久久久久综合网|
国产精品va久久久久久久|
久久亚洲AV成人出白浆无码国产|
精品乱码久久久久久夜夜嗨|
性欧美丰满熟妇XXXX性久久久
|
99久久国产亚洲高清观看2024
|
色天使久久综合网天天|
一级做a爱片久久毛片|
久久久久久精品免费看SSS
|
无码国产69精品久久久久网站|
国产亚州精品女人久久久久久
|
18禁黄久久久AAA片|
国产福利电影一区二区三区久久久久成人精品综合
|
久久久国产精品福利免费|
久久精品国产亚洲AV久|
久久精品成人|
久久婷婷五月综合成人D啪|
国产精品熟女福利久久AV|
欧美激情精品久久久久|
一本久久久久久久|
久久一区二区免费播放|
久久无码中文字幕东京热|
亚洲欧洲久久av|