POJ1481 The Die Is Cast (DFS & BFS 结合)

最新推荐文章于 2022-04-30 16:29:28 发布
最新推荐文章于 2022-04-30 16:29:28 发布
阅读量1.1k 收藏
点赞数
分类专栏： Poj 搜索专题
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/wjw0130/article/details/23294043
版权
The Die Is Cast
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 780 Accepted: 330

Description

InterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market analysis has alerted them to the fact that games of chance are pretty popular among their potential customers. Be it Monopoly, ludo or backgammon, most of these games involve throwing dice at some stage of the game. 
Of course, it would be unreasonable if players were allowed to throw their dice and then enter the result into the computer, since cheating would be way to easy. So, instead, InterGames has decided to supply their users with a camera that takes a picture of the thrown dice, analyzes the picture and then transmits the outcome of the throw automatically. 

For this they desperately need a program that, given an image containing several dice, determines the numbers of dots on the dice. 

We make the following assumptions about the input images. The images contain only three different pixel values: for the background, the dice and the dots on the dice. We consider two pixels connected if they share an edge - meeting at a corner is not enough. In the figure, pixels A and B are connected, but B and C are not. 

A set S of pixels is connected if for every pair (a,b) of pixels in S, there is a sequence a1, a2, ..., ak in S such that a = a1 and b = ak , and a i and a i+1 are connected for 1 <= i < k. 

We consider all maximally connected sets consisting solely of non-background pixels to be dice. `Maximally connected' means that you cannot add any other non-background pixels to the set without making it dis-connected. Likewise we consider every maximal connected set of dot pixels to form a dot.

Input

The input consists of pictures of several dice throws. Each picture description starts with a line containing two numbers w and h, the width and height of the picture, respectively. These values satisfy 5 <= w, h <= 50. 

The following h lines contain w characters each. The characters can be: "." for a background pixel, "*" for a pixel of a die, and "X" for a pixel of a die's dot. 

Dice may have different sizes and not be entirely square due to optical distortion. The picture will contain at least one die, and the numbers of dots per die is between 1 and 6, inclusive. 

The input is terminated by a picture starting with w = h = 0, which should not be processed. 

Output

For each throw of dice, first output its number. Then output the number of dots on the dice in the picture, sorted in increasing order. 

Print a blank line after each test case.

Sample Input

30 15
..............................
..............................
...............*..............
...*****......****............
...*X***.....**X***...........
...*****....***X**............
...***X*.....****.............
...*****.......*..............
..............................
........***........******.....
.......**X****.....*X**X*.....
......*******......******.....
.....****X**.......*X**X*.....
........***........******.....
..............................
0 0

Sample Output

Throw 1
1 2 2 4
题目不难 就是手残  GOOD！！！ 

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>

using namespace std;

struct node{
    int x,y;
}q[10000];

int vis[100][100],px[3000],n,m,s,e,num=0,map[100][100];
int mv[4][2] = {{0,1},{1,0},{0,-1},{-1,0}}; //上下左右4个方向
char a[100];

int cmp(const void *a,const void *b)
{
    return *(int *)a - *(int *)b;
}

void DFS_BFS(int x,int y)
{
    node t,f,h;

    if(map[x][y]==0)
        return;

    if(map[x][y]==2) //BFS操作，进行判断X是否相连
       {
           s = 0,e = 0;
           f.x = x;  f.y = y;

           vis[x][y] = 1;


            // printf("%d ",num);

             q[e++] = f;
             while(s < e)
             {
                 f = q[s++];
                 for(int k = 0;k<4;k++)
                 {
                     h.x = f.x + mv[k][0];
                     h.y = f.y + mv[k][1];
                     if(vis[h.x][h.y]==0 && map[h.x][h.y]== 2 &&h.x>=0&&h.x<m&&h.y>=0&&h.y<n)
                     {
                         vis[h.x][h.y] = 1;
                         q[e++] = h;
                     }
                  }

             }
              ++num;
        }
    for(int i =0;i<4;i++)//DFS操作，为了含*的几个区域
    {
        t.x = x + mv[i][0];
        t.y = y + mv[i][1];
        if(0<=t.x && t.x<m && 0<=t.y && t.y<n&&vis[t.x][t.y]==0)
        {
            vis[t.x][t.y] = 1;
            DFS_BFS(t.x,t.y);
        }
    }
    return ;
}

int l = 0;

void Search()//找含*的位置，进行DFS_BFS
{

    for(int i = 0;i<m;i++)
    {
        for(int j = 0;j<n;j++)
        {

            if((map[i][j]==1 || map[i][j]==2 )&&vis[i][j]==0)
            {
                vis[i][j] = 1;
                num = 0;
                DFS_BFS(i,j);
               if(num)//删掉就WA，我日 不知为什么
                px[l++] = num;
            }
        }
    }
}

int main()
{
    int C = 0;
    while(cin>>n>>m)
    {
        if(n==0||m==0)
            break;

          l = 0;

        memset(vis,0,sizeof(vis));
        memset(px,0,sizeof(px));
        for(int i = 0;i<m;i++)
        {
            cin>>a;
            for(int j = 0;j<n;j++)
               {
                   if(a[j]=='.')
                    {
                        //map数组中 1代表*  2代表X  0代表.
                        vis[i][j] = 1;
                        map[i][j] = 0;
                    }
                    else if(a[j]=='*')
                        map[i][j] = 1;
                    else if(a[j]=='X')
                        map[i][j] = 2;
               }
        }
        Search();

       qsort(px,l,sizeof(px[0]),cmp);

        cout<<"Throw "<<++C<<endl;
        for(int i = 0;i<l-1;i++)
        {
           // cout<<"i= "<<i;
            cout<<px[i]<<" ";
        }

        cout<<px[l-1]<<endl<<endl;

    }
    return 0;
}

测试数据如下：

30 15
..............................
..............................
...............*..............
...*****......****............
...*X***.....**X***...........
...*****....***X**............
...***X*.....****.............
...*****.......*..............
..............................
........***........******.....
.......**X****.....*X**X*.....
......*******......******.....
.....****X**.......*X**X*.....
........***........******.....
..............................
41 41
.........................................
.******......................*****.......
.*X**X*......................*X*X*.......
.******......................*****.......
.*X**X*......................*X*X*.......
.******......................*****.......
.........................................
.........................................
.......********..........................
.......*XX**XX*..........................
.......********..........................
.......*XX**XX*..........................
.......********..........................
.......*XX**XX*..........................
.......********..........................
.........................................
.........................................
.........................................
................**.......................
..............*****......................
.............***X***.....................
............*******......................
...........**X****.......................
...........*****.........................
............**...........................
.........................................
.........................................
..........................**.............
.........................****............
........................*X****...........
.......................****X***..........
........................******...........
.........................****............
..........................**.............
.........................................
.........................................
.........................................
.........................................
.........................................
.........................................
.........................................
20 29
....................
....................
....................
*****...............
*XX**...............
*XX**...............
*****...............
*****...............
....................
....................
....................
....................
....*****...........
....*X***...........
....*****.....***...
....***X*....**X**..
....*****...*****...
...........*XX**....
....*****...**......
....*X*X*...........
....*****...........
....*X*X*...........
....*****...........
....................
....................
....................
....................
....................
....................
29 12
.............................
.............................
........***..................
......**X***.................
.....*******.................
....****X**..................
....**X***...................
.....***.....................
.............................
.............................
.............................
.............................
48 12
................................................
................................................
................................................
......******....................................
......*X*XX*.........................**.........
......******......**................****........
......*XX*X*.....****..............**XX**.......
......******....**X****...........***X**........
...............*******.............****.........
...............****X*...............**..........
.................***............................
................................................
25 21
.........................
.........................
.........................
.........................
.........................
.........................
.........................
.....******..............
.....*X**X*..............
.....******..............
.....*X**X*..............
.....******..............
.........................
.........................
.........................
.........................
.........................
.........................
.........................
.........................
.........................
43 15
...........................................
.....*.....................................
....*X*....................................
...*****...................................
..*X*X*X*..................................
...*****...................................
....*X*....................................
.....*.....................*...............
..........................***..............
.........................*X***.............
.........................***X**............
..........................****X*...........
...........................****............
............................**.............
...........................................
47 7
.....................*******...................
.******..............*X***X*...................
.*XX*X*....******....***X***.........***.......
.******....*X*XX*....*X***X*........*****......
.*XX*X*....*X*XX*....*******.......***X**......
.******....******..................*****.......
...........******...................***........
19 45
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
.....*******.......
.....*X***X*.......
.....***X***.......
.....*X***X*.......
.....*******.......
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
...................
39 44
.......................................
.******.******.*****.*****.*****.......
.*X****.**XX**.*X*X*.**X**.*X*X*.......
.****X*.**XX**.*****.**X**.*X*X*.......
.******.******.*X*X*.*****.*****.......
...............*****...................
.......................................
.......................................
.......................................
.......................................
...***.................................
..*X****...............................
...**X***..............................
....***X**..**.........................
.....***...*X**........................
..........******.......................
.........*X***X**......................
..........**X***.......................
...........****........................
............**.........................
.......................................
.......................................
.......................................
.......................................
.......................................
.******.******.*****.*****.*****.......
.*X****.*X*XX*.*X*X*.**X**.*X*X*.......
.****X*.*X**X*.*****.**X**.*X*X*.......
.******.******.*X*X*.*****.*****.......
...............*****...................
.......................................
.......................................
.......................................
.......................................
.......................................
.......................................
.......................................
.......................................
.......................................
.******.******.*****.*****.*****.......
.*X****.**XX**.*X*X*.**X**.*X*X*.......
.****X*.**XX**.*****.**X**.*X*X*.......
.******.******.*X*X*.*****.*****.......
...............*****...................
37 35
.....................................
.....................................
..*..................................
.***.................................
**X**................................
.*****...............................
..***................................
...*.................................
.....................................
.....................................
.....................................
......................**.............
.....................****............
....................***X**...........
.....................****............
......................**.............
.....................................
.....................................
.....................................
.....................................
.....................................
.....................................
.....................................
.....................................
.....................................
.....................................
......******.........................
......*X*XX*.........................
......******......**............*****
......*XX*X*.....****...........*X*X*
......******....**X****.........*****
...............*******..........*X*X*
...............****X*...........*****
.................***.................
.....................................
3 3
***
*X*
***
4 4
****
*XX*
*XX*
****
4 4
****
*X**
**X*
****
8 4
********
*X*X*X**
**X*X*X*
********
30 20
*****.....*****.....*****..***
*X*X*.....*X***.....*XXX*..*X*
*****.....*****.....*XXX*..*X*
*X*X*.....***X*.....*XXX*..***
*****.....*****.....*****.....
.....*****.....*****.....*****
.....*XX**.....*XX**.....*X***
.....*XXX*.....*****.....*****
.....**XX*.....**XX*.....*****
.....*****.....*****.....*****
*****.....*****.....*****.....
*X***.....*X*X*.....*****.....
***X*.....*****.....**X**.....
*X***.....**X**.....*****.....
*****.....*****.....*****.....
.....*****.....*****.....*****
.....*XXX*.....*XXX*.....*X*X*
.....*****.....*X***.....***X*
.....*XXX*.....*X*X*.....*XXX*
.....*****.....*****.....*****
50 11
*****.*******.*********.***********.**************
*X*X*.*X*X*X*.*X*X*X*X*.*X*X*X*X*X*.*X*X*X*X*X*XX*
*****.*******.*********.***********.**************
..................................................
*****.*******.*********.***********.*************.
*XXX*.*X*X*X*.*X*X*XXX*.*X*X*X*X*X*.*XXX*X*X*XXX*.
*****.*******.*********.***********.*************.
..................................................
**************************************************
***XXXXXXXXXX**X*X*****XXXXXXX******XX**XXX*******
**************************************************
10 10
**********
*XXXXXXXX*
*XXXXXXXX*
*XXXXXXXX*
*XXXXXXXX*
*XXXXXXXX*
*XXXXXXXX*
*XXXXXXXX*
*XXXXXXXX*
**********
50 50
**************************************************
**************************************************
**************************************************
**************************************************
******XX*************************XXXXXXX**********
*****XXXX***********************XXXXXXXXXX********
******XX************************XXXXXXXX**********
*********************************XXXXXXX**********
**********************************XXXXXX**********
***********************************XXXXX**********
************************************XXXX**********
**************************************XX**********
**************************************XX**********
***************************************X**********
**************************************************
**************************************************
*******XXXXXX*************************************
*******XXXXXX*************************************
*******XXXXX**************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
******************************XXXXX***************
**************************XXXXXXXXXX**************
****************************XXXXXXX***************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
************XXX*************************X*********
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
50 50
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
***********************X**************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************
**************************************************


答案：




> Throw 1
> 1 2 2 4
> 
> Throw 2
> 2 2 4 4 6
> 


> Throw 3
> 1 2 2 4
> 
> Throw 4
> 3
> 
> Throw 5
> 1 2 4
> 
> Throw 6
> 4
> 
> Throw 7
> 3 5
> 
> Throw 8
> 1 2 4 5
> 
> Throw 9
> 5
> 
> Throw 10
> 1 1 1 1 1 2 2 2 2 2 2 2 3 4 4 4 4
> 
> Throw 11
> 1 1 2 4 4
> 
> Throw 12
> 1
> 
> Throw 13
> 1
> 
> Throw 14
> 2
> 
> Throw 15
> 6
> 
> Throw 16
> 1 1 1 1 1 2 2 2 2 2 3 3 4
> 
> Throw 17
> 1 2 3 3 3 4 4 5 5 6 6
> 
> Throw 18
> 1
> 
> Throw 19
> 6
> 
> Throw 20
> 1

u013497151
关注
专栏目录
poj 1481 The Die Is Cast
知易行难
08-04 656
Problem: 1481   User: nasta Memory: 912K   Time: 0MS Language: G++   Result: Accepted 题 意：给你一副图，要求每个模块中不相连的‘X’的
【题解】POJ3083 Children of the Candy Corn(DFS + BFS)
bu_shushu的博客
12-01 367
POJ3083 Children of the Candy Corn 明天写
UVaOJ657---The die is cast
c随遇er安的专栏
04-15 657
657 - The die is cast Time limit: 3.000 seconds InterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market an
搜索 HOJ 1619 The Die Is Cast
We Can
02-06 570
The Die Is Cast My Tags   (Edit)   Source : ACM ICPC Southwestern European Regional 1998   Time limit : 1 sec   Memory limit : 32 M
poj1481 The Die Is Cast（两个DFS）
The Slow Need To Start Eearly
05-11 672
题　意：给你一副图，要求每个模块中不相连的‘X’的数目，最后按照大小输出。 思　路：两个DFS，第一个确定大图中符合要求的模块，主要用来确定该模块中X的位置；第二个DFS用来计算不连通的X的数量了。 学习点：多个DFS的使用，思路要清晰，递归的时候注意边界条件（dfs函数写的不够漂亮）。用c写有些细节还是不如C++方便。 注意点：用一个栈（主要是一个数组）来存储每个模块中X的位置，其中对栈顶指针top的操作要小心，另外结点编号要注意。
POJ 1481
weixin_33892359的博客
05-21 86
AC啦！！！此题用到了两个DFS，刚开始一直认为两个DFS是交叉的，一直是错。后来从最简单的方面考虑，它遍历它的，它遍历它的，最后搞出来啦。 #include <stdio.h> #include <memory.h> #include <stdlib.h> const int maxn=50+10; char map[maxn][maxn]; int vis...
POJ1426-Find The Multiple【BFS+同余模】
07-31
【标题】"POJ1426-Find The Multiple【BFS+同余模】"是一道来源于北京大学在线编程平台POJ的算法题目，主要涉及到了广度优先搜索（BFS）与同余模运算的知识点。这道题目要求解决的是寻找一个整数的倍数问题，可能...
三星研究院（南京）机试练习（深度优先搜索DFS && 广度优先搜索BFS经典题目及模板总结）
simao
04-30 4933
搜索小贴士： 1.DFS、BFS其实是图的一种遍历方式，两种算法均可以遍历所有情况，是非常暴力的算法，但其应用场景却不太一样，由于他们两种的算法特性导致的，如下： 2.问最短、最少之类的问题，一般要想到BFS，BFS搜索是逐层搜索，换个角度来说，每一层是一种状态，达到本次状态所花费的value值是一样的，由于BFS借助队列实现，而队列有先进先出的特性，所以当找到结果时，是由上一层状态继承下来的，一定是当前问题的最少花费。 3.DFS一般会伴随着回溯，只需要记得DFS是一条路走到黑，走不通时返回到最近.
POJ-2870 Light Up + DFS(1级DFS+1级DFS) + Python - 思维导图
12-23
题目"POJ-2870 Light Up"是一个经典的图论问题，主要涉及深度优先搜索（DFS）算法的运用。该问题要求点亮一个矩形区域内的所有障碍物，每个障碍物需要特定数量的灯光才能被照亮，且相邻的障碍物之间不能有空格。题目...
DFS和BFS模板
nihao_pcm的博客
04-21 1223
DFS模板：向深处搜索，直到找到解或者走不下去。这一般解决全排列问题 Void DFS（deep，...）{ if(找到解 || 走不下去了){ ......//根据题意添加 return; } for(扩展方式){ if(扩展方式所能达到的状态合法){ 修改操作；//根据题意添加 标记； DFS(deep+1,...); ...
POJ 1481 The Die Is Cast G++ dfs
woniupengpeng的专栏
08-09 152
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <vector> using namespace std; //英语 看博友分析 dfs char mp[100][100]; int da[100][100]; int vis[100][100]; int dx[4]={0,0,1,-1}...
The Die Is Cast(poj 1481简单的双dfs)
weixin_33774615的博客
08-16 113
http://poj.org/problem?id=1481 The Die Is Cast Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 860   Accepted: 358 Description InterGames is a high-tech start...
POJ The Die Is Cast
qq_39503067的博客
04-13 158
#include<bits/stdc++.h> using namespace std; int H,L,ans; char m[60][60]; int x[4][2]= {{0,1},{0,-1},{1,0},{-1,0}}; void dfsx(int h,int l) { for(int i=0; i<4; i++) { int hh=h+x[i][0],ll=...
POJ-1481
x_liushi_game的专栏
04-07 392
#include char grid[50][50]; int visited[50][50]; int sum[1250], top; int rows, columns; void dfsX(int x, int y) { // 设为访问过 visited[x][y] = 2; if (x-1 >= 0 && visited[x-1][y] != 2 &&
poj1481
zylm的专栏
07-28 560
题意：找出**中包围的X个数，相连的为
the die is cast 题解
帷幕后的文和
05-19 1031
双层dfs，小心点就过了，一星期没玩dfs，居然弄了我两个小时多。。。。。。这种智障#include <stdio.h> #include <string.h> int h,w; char str[51][52]; int ccnt[7],cnt,flag; int mx[5]={0,1,-1,0,0},my[5]={0,0,0,1,-1}; void dfs2(int posy,int posx)
Poj 1481 （DFS+DFS）
qq_36616268的博客
07-23 342
寻找一堆点中，包含的x的个数，如果相连，表示为1个。 需要用到两个dfs 代码如下： #include&lt;iostream&gt; #include&lt;cstdio&gt; #include&lt;algorithm&gt; #include&lt;cstdlib&gt; #include&lt;cmath&gt; #include&lt;cstring&gt; us...
K - 迷宫问题 //bfs 和 dfs 结合
LMengi000的博客
05-23 552
K - 迷宫问题Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, };它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。I...
POJ2.6 1481 Maximum sum
leizhehan的博客:(你可能会认得我的另一个名字：hsfzLZH1)
11-07 804
POJ2.6 1481 Maximum sum
DFS与BFS在苹果分配问题中的搜索策略
在"DFS与BFS状态操作分析-Acm搜做算法"这篇文章中，主要讨论了深度优先搜索(DFS)和广度优先搜索(BFS)在解决ACM(计算机编程竞赛)中的搜索算法应用，特别是针对一道名为"放苹果"(POJ1664)的问题。这个问题要求将M个...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值