HDU
来源:互联网 发布:怎样安装管家婆软件 编辑:程序博客网 时间:2024/06/05 15:07
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33277 Accepted Submission(s): 19308
Problem Description
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.
Input
The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either `*', representing the absence of oil, or `@', representing an oil pocket.
Output
For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.
Sample Input
1 1*3 5*@*@***@***@*@*1 8@@****@*5 5 ****@*@@*@*@**@@@@*@@@**@0 0
Sample Output
0122问有几组油矿,斜对角线也是关联。
水题。
#include<iostream>#include<algorithm>#include<queue>#include<cstdio>#include<cstring>#include<stack>using namespace std;struct AP{ int x,y;};AP func1(int x,int y){ AP t; t.x=x; t.y=y; return t;}int main(){ int n,m; while(cin>>n>>m&&(n!=0||m!=0)) { int map[103][103]= {},ans=0; for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) { char c; cin>>c; if(c=='@') map[i][j]=1; } queue<AP>que1; int com[16]= {-1,0,0,-1,1,0,0,1,1,1,1,-1,-1,1,-1,-1}; for(int i=1; i<=n; i++) for(int j=0; j<=m; j++) if(map[i][j]) { map[i][j]=0; que1.push(func1(i,j)); while(que1.size()) { AP temp=que1.front(); que1.pop(); for(int k=0; k<8; k++) if(map[temp.x+com[2*k]][temp.y+com[2*k+1]]) { map[temp.x+com[2*k]][temp.y+com[2*k+1]]=0; que1.push(func1(temp.x+com[2*k],temp.y+com[2*k+1])); } } ans++; } cout<<ans<<endl; } return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- MYSQL触发器级联删除
- LYOS —— Hello World
- 求1+2+3+...+n,要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句(A?B:C)。
- HTML5-事件-键盘-上下左右键
- Scheduled和quartz的简单比较
- HDU
- react native 日期格式化
- javascript 对象
- CSS中IE和火狐对margin、padding的兼容性解析
- HDU 6070 Dirt Ratio(区间最优比率)
- Android Studio关闭选中处文档自动显示功能
- 全国政协委员汪国新出席两会文艺小组讨论会
- iOS总结3
- python入门(五):pyc是什么?