Follow me 挑战程序与设计
来源:互联网 发布:asp 网页访问数据库 编辑:程序博客网 时间:2024/05/23 23:27
Lake Counting
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 34073 Accepted: 16954
Description
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John's field, determine how many ponds he has.
Given a diagram of Farmer John's field, determine how many ponds he has.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
Output
* Line 1: The number of ponds in Farmer John's field.
Sample Input
10 12W........WW..WWW.....WWW....WW...WW..........WW..........W....W......W...W.W.....WW.W.W.W.....W..W.W......W...W.......W.
Sample Output
3
Hint
OUTPUT DETAILS:
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
There are three ponds: one in the upper left, one in the lower left,and one along the right side.
Source
USACO 2004 November
从小白做起,很痛苦,做一只永远拖不跨,打不倒的小强
#include <iostream>
#include <cstring>
#include <cstring>
using namespace std;
char a[109][109];
int step[8][2]={{-1,-1},{0,-1},{1,-1},{-1,0},{1,0},{-1,1},{0,1},{1,1}};
int step[8][2]={{-1,-1},{0,-1},{1,-1},{-1,0},{1,0},{-1,1},{0,1},{1,1}};
void dfs(int x,int y)
{
for (int i=0;i<8;i++)
{
int A=x+step[i][0];
int B=y+step[i][1];
if (a[A][B]==-1||a[A][B]=='.')
{
continue;
}
else
{
a[A][B]='.';
dfs(A,B);
}
}
}
int main()
{
int N,M;
cin>>N>>M;
memset(a,-1,sizeof(a));
for (int i=1;i<=N;i++)
{
for (int j=1;j<=M;j++)
{
cin>>a[i][j];
}
}
int sum=0;
for (int i=1;i<=N;i++)
{
for (int j=1;j<=M;j++)
{
if (a[i][j]=='W')
{
//cout<<i<<' '<<j<<endl;
//a[i][j]='.';
sum++;
dfs(i,j);
}
}
}
cout<<sum;
return 0;
}
{
for (int i=0;i<8;i++)
{
int A=x+step[i][0];
int B=y+step[i][1];
if (a[A][B]==-1||a[A][B]=='.')
{
continue;
}
else
{
a[A][B]='.';
dfs(A,B);
}
}
}
int main()
{
int N,M;
cin>>N>>M;
memset(a,-1,sizeof(a));
for (int i=1;i<=N;i++)
{
for (int j=1;j<=M;j++)
{
cin>>a[i][j];
}
}
int sum=0;
for (int i=1;i<=N;i++)
{
for (int j=1;j<=M;j++)
{
if (a[i][j]=='W')
{
//cout<<i<<' '<<j<<endl;
//a[i][j]='.';
sum++;
dfs(i,j);
}
}
}
cout<<sum;
return 0;
}
1 0
- Follow me 挑战程序与设计
- Follow me 挑战程序与设计
- Follow me 挑战程序与设计
- Follow me 挑战程序与设计
- Follow me--挑战程序与设计
- Follow me--挑战程序与设计
- follow me
- Follow me on Twitter !
- Follow Me: ArcPy(1)
- Follow Me: ArcPy(2)
- mongodb CURD follow me
- 加壳程序CPU-FOLLOW ME测试版(含源码)已经发布
- Objective-C 学习Follow Me(一)
- Python挑战第四关follow the chain
- 软件项目管理Follow Me--如何进行项目估算
- 项目管理Follow Me – MS Project使用经验谈
- Follow Me:深入浅出学习Hibernate一:Hibernate概述
- Follow Me:深入浅出学习Hibernate二:Hibernate第一实例
- 作业4:基本查询语句
- codeforce 796 c Bank Hacking (思维题,分类讨论)
- CodeForces
- ants run 题意理解
- 移动零
- Follow me 挑战程序与设计
- hdu 1875 畅通工程再续(MST)
- hdu 4738 Caocao's Bridges 【求最小代价的割边(桥)】
- 读书笔记:Hyperbolic reductions for Einstein's equations(Helmut Friedrich 1996)
- CS231n系列课程Lecture 5:Train Neural Networks, Part 1
- js输出选中的多选框的个数
- 第三十五讲项目一 另类求和
- git merge
- 迭代模式(Iterator Pattern 游标模式 CursorPattern,对象行为型模式)