zoukankan      html  css  js  c++  java
  • POJ1753【简单DFS算法】--翻棋盘(一步看不懂!!)

                                                                                                             Flip Game
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 35877   Accepted: 15658

    Description

    Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules: 
    1. Choose any one of the 16 pieces. 
    2. Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).
    Consider the following position as an example: 
    bwbw  wwww  bbwb  bwwb  Here "b" denotes pieces lying their black side up and "w" denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become: 
    bwbw  bwww  wwwb  wwwb  The goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal. 

    Input

    The input consists of 4 lines with 4 characters "w" or "b" each that denote game field position.

    Output

    Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it's impossible to achieve the goal, then write the word "Impossible" (without quotes).

    Sample Input

    bwwb
    bbwb
    bwwb
    bwww

    Sample Output

    4
    

    Source

     
    题意:每次翻一个棋子的上下左右和它自己,直到全为一种颜色
     
    #include <stdio.h>
    
    const int inf=9999999;
    char s[10];
    int map[10][10],i,j;
    int ans=9999999;
    
    int panduan()
    {
        int x=map[0][0];
        for (i=0; i<4; i++)
        {
            for (j=0; j<4; j++)
            {
                if (map[i][j]!=x)
                    return 0;
            }
        }
        return 1;
    }
    
    void fan (int x,int y)
    {
        map[x][y]=!map[x][y];
        if (x - 1 >= 0)
            map[x-1][y]=!map[x-1][y];
        if (x + 1 < 4)
            map[x+1][y]=!map[x+1][y];
        if (y - 1 >= 0)
            map[x][y-1]=!map[x][y-1];
        if (y + 1 < 4)
            map[x][y+1]=!map[x][y+1];
    }
    
    int dfs (int x,int y,int t)
    {
        int nx,ny;
        if ( panduan()==1)
        {
            if (ans > t)
                ans = t ;
            return 0;
        }
        if (x >= 4 || y >= 4)
            return 0;
    
        nx = (x + 1)%4;
        ny = y + ( x + 1 ) / 4;
    
        dfs (nx,ny,t);//两次dfs不知道啥意思。。。
        fan (x,y);
    
        dfs (nx,ny,t+1);
        fan (x,y);
    
        return 0;
    }
    int main ()
    {
        for (i=0; i<4; i++)
        {
            scanf ("%s",s);
            for (j=0; j<4; j++)
            {
                if (s[j]=='b')
                    map[i][j]=0;
                else
                    map[i][j]=1;
            }
        }
        dfs (0,0,0);
    
        if (ans == inf )
            printf ("Impossible
    ");
        else printf ("%d
    ",ans);
        return 0;
    }
  • 相关阅读:
    [原][GIS]ARCGIS投影坐标系转换
    [转][osg]探索未知种族之osg类生物【目录】
    [转][osg]探究osg中的程序设计模式【目录】
    [原][资料整理][osg]osgDB文件读取插件,工作机制,支持格式,自定义插件
    [原][landcover]全球地表植被样例图片
    [转]arcgis for server 10.2 下载及安装
    [原]DOM、DEM、landcover,从tms服务发布格式转arcgis、google服务发布格式
    MySQL 数据库最优化设计原则
    MySQL常用存储引擎及如何选择
    Xtrabackup实现Mysql的InnoDB引擎热备份
  • 原文地址:https://www.cnblogs.com/zhangfengnick/p/4907662.html
Copyright © 2011-2022 走看看