DFS——The die is cast
来源:互联网 发布:火车票代理软件 编辑:程序博客网 时间:2024/05/21 05:18
Description
The die is cast
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 dif- ferent 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 in S such that a = a1 and b = ak , and ai and ai+1 are connected for .
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 .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 11 2 2 4
Miguel Revilla
2000-05-22
调用两次DFS,注意每两组数据之间空一行,还有就是计数数组不要忘记清零
#include <stdio.h>#include <string.h>#include<algorithm>using namespace std;char mapp[100][100];int js[10000];int n,m;int N = 1,k = 0;int fx[] = {-1,1,0,0};int fy[] = {0,0,-1,1};void dfs1(int i1,int j1){ int i2,j2; mapp[i1][j1] = '*'; for(int o = 0;o < 4;o++) { i2 = i1 + fx[o]; j2 = j1 + fy[o]; if(i2 >= m || i2 < 0 || j2 >= n || j2 < 0) continue; if(mapp[i2][j2] == 'X') dfs1(i2,j2); }}void dfs(int i,int j){ mapp[i][j] = '.'; int i1,j1; for(int p = 0;p < 4;p++) { i1 = i + fx[p]; j1 = j + fy[p]; if(i1 >= m || j1 >= n || i1 < 0 || j1 < 0) continue; if(mapp[i1][j1] == 'X') { dfs1(i1,j1); js[k]++; } if(mapp[i1][j1] == '*') dfs(i1,j1); }}int main(){ while(scanf("%d%d",&n,&m)) { if(n == 0 && m == 0) break; for(int i = 0;i<m;i++) scanf("%s",&mapp[i]); for(int i = 0;i<m;i++) { for(int j = 0;j<n;j++) { if(mapp[i][j] == '*') { dfs(i,j); k++; } } } sort(js,js+k); printf("Throw %d\n",N); for(int i = 0;i<k;i++) { if(i == 0) printf("%d",js[i]); else printf(" %d",js[i]); } printf("\n\n"); N++; k = 0; memset(js,0,sizeof(js)); } return 0;}
- DFS——The die is cast
- UVA 657 The die is cast ——bfs+dfs
- UVa657 The die is cast(DFS)
- 657 - The die is cast(dfs)
- The die is cast (DFS 双重)
- The die is cast
- The Die Is Cast
- poj1481 The Die Is Cast(两个DFS)
- UVa 657 The die is cast(DFS)
- uva 657 The die is cast(DFS遍历图)
- POJ1481 The Die Is Cast (DFS & BFS 结合)
- UVa 657 The die is cast(DFS*2)
- UVA - 657 The die is cast(二重dfs)
- UVA - 657 - The die is cast (两次DFS!!)
- UVA 657-The die is cast(dfs*2)
- UVA 657 The die is cast (DFS*2)
- UVa-657 The die is cast(dfs嵌套)
- 657 - The die is cast(****)
- 书籍阅读(持续更新)
- [March]总结和规划
- union赋值及小端系统
- Linux uinput驱动分析
- jquey XMLHttpRequest cannot load url.Origin null is not allowed by Access-Control-Allow-Origin
- DFS——The die is cast
- C++类的方法设计
- 纯java读取apk信息
- java中参数传递
- jQuery在IE8下的append方法缺陷
- bsh for android : URL Connect Test
- tabhost学习精要
- Leetcode_partition-list
- 如果我可以选择,只愿这个世界我未曾来过·····