HDU 5546 Ancient Go(DFS)
2016-07-25 19:53
435 查看
思路:找一个连通块如果它只能往外扩展一个空格的话那么就满足题意,所以直接DFS一波就好了
#include<bits/stdc++.h>
using namespace std;
char mp[20][20];
int vis[20][20];
int dx[] = {0,0,-1,1};
int dy[] = {1,-1,0,0};
int cnt = 0;
int num = 0;
void dfs(int x,int y)
{
vis[x][y]=1;
for(int i = 0;i<4;i++)
{
int sx = x+dx[i];
int sy = y+dy[i];
if(mp[sx][sy]=='.' && vis[sx][sy]!=num)
{
vis[sx][sy]=num;
cnt++;
}
if(mp[sx][sy]=='o' && !vis[sx][sy])
dfs(sx,sy);
}
}
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
memset(vis,0,sizeof(vis));
int flag = 0;
for(int i = 0;i<9;i++)
scanf("%s",mp[i]);
for(int i = 0;i<9;i++)
{
for(int j = 0;j<9;j++)
{
if(mp[i][j]=='o' && !vis[i][j])
{
cnt = 0;
num++;
dfs(i,j);
if(cnt==1)
flag = 1;
}
}
}
if(flag)
printf("Case #%d: Can kill in one move!!!\n",cas++);
else
printf("Case #%d: Can not kill in one move!!!\n",cas++);
}
}
Description
Yu Zhou likes to play Go with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go.
Here is the rules for ancient go they were playing:
The
game is played on a
cell
board, the chess can be put on the intersection of the board lines, so there are
different
positions to put the chess.
Yu
Zhou always takes the black and Su Lu the white. They put the chess onto the game board alternately.
The
chess of the same color makes connected components(connected by the board lines), for each of the components, if it's not connected with any of the empty cells, this component dies and will be removed from the game board.
When
one of the player makes his move, check the opponent's components first. After removing the dead opponent's components, check with the player's components and remove the dead components.
One day, Yu Zhou was playing ancient go with Su Lu at home. It's Yu Zhou's move now. But they had to go for an emergency military action. Little Qiao looked at the game board and would like to know whether Yu Zhou has a move to kill at least one of Su Lu's
chess.
Input
The first line of the input gives the number of test cases,
.
test
cases follow. Test cases are separated by an empty line. Each test case consist of 9 lines represent the game board. Each line consists of 9 characters. Each character represents a cell on the game board.
represents
an empty cell.
represents
a cell with black chess which owned by Yu Zhou.
represents
a cell with white chess which owned by Su Lu.
Output
For each test case, output one line containing Case #x: y, where
is
the test case number (starting from 1) and
is Can
kill in one move!!! if Yu Zhou has a move to kill at least one of Su Lu's components. Can not kill in one move!!! otherwise.
Sample Input
2
.......xo
.........
.........
..x......
.xox....x
.o.o...xo
..o......
.....xxxo
....xooo.
......ox.
.......o.
...o.....
..o.o....
...o.....
.........
.......o.
...x.....
........o
Sample Output
Case #1: Can kill in one move!!!
Case #2: Can not kill in one move!!!
Hint
#include<bits/stdc++.h>
using namespace std;
char mp[20][20];
int vis[20][20];
int dx[] = {0,0,-1,1};
int dy[] = {1,-1,0,0};
int cnt = 0;
int num = 0;
void dfs(int x,int y)
{
vis[x][y]=1;
for(int i = 0;i<4;i++)
{
int sx = x+dx[i];
int sy = y+dy[i];
if(mp[sx][sy]=='.' && vis[sx][sy]!=num)
{
vis[sx][sy]=num;
cnt++;
}
if(mp[sx][sy]=='o' && !vis[sx][sy])
dfs(sx,sy);
}
}
int main()
{
int T,cas=1;
scanf("%d",&T);
while(T--)
{
memset(vis,0,sizeof(vis));
int flag = 0;
for(int i = 0;i<9;i++)
scanf("%s",mp[i]);
for(int i = 0;i<9;i++)
{
for(int j = 0;j<9;j++)
{
if(mp[i][j]=='o' && !vis[i][j])
{
cnt = 0;
num++;
dfs(i,j);
if(cnt==1)
flag = 1;
}
}
}
if(flag)
printf("Case #%d: Can kill in one move!!!\n",cas++);
else
printf("Case #%d: Can not kill in one move!!!\n",cas++);
}
}
Description
Yu Zhou likes to play Go with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go.
Here is the rules for ancient go they were playing:
The
game is played on a
cell
board, the chess can be put on the intersection of the board lines, so there are
different
positions to put the chess.
Yu
Zhou always takes the black and Su Lu the white. They put the chess onto the game board alternately.
The
chess of the same color makes connected components(connected by the board lines), for each of the components, if it's not connected with any of the empty cells, this component dies and will be removed from the game board.
When
one of the player makes his move, check the opponent's components first. After removing the dead opponent's components, check with the player's components and remove the dead components.
One day, Yu Zhou was playing ancient go with Su Lu at home. It's Yu Zhou's move now. But they had to go for an emergency military action. Little Qiao looked at the game board and would like to know whether Yu Zhou has a move to kill at least one of Su Lu's
chess.
Input
The first line of the input gives the number of test cases,
.
test
cases follow. Test cases are separated by an empty line. Each test case consist of 9 lines represent the game board. Each line consists of 9 characters. Each character represents a cell on the game board.
represents
an empty cell.
represents
a cell with black chess which owned by Yu Zhou.
represents
a cell with white chess which owned by Su Lu.
Output
For each test case, output one line containing Case #x: y, where
is
the test case number (starting from 1) and
is Can
kill in one move!!! if Yu Zhou has a move to kill at least one of Su Lu's components. Can not kill in one move!!! otherwise.
Sample Input
2
.......xo
.........
.........
..x......
.xox....x
.o.o...xo
..o......
.....xxxo
....xooo.
......ox.
.......o.
...o.....
..o.o....
...o.....
.........
.......o.
...x.....
........o
Sample Output
Case #1: Can kill in one move!!!
Case #2: Can not kill in one move!!!
Hint
In the first test case, Yu Zhou has 4 different ways to kill Su Lu's component. In the second test case, there is no way to kill Su Lu's component.
相关文章推荐
- py_Django的管理界面
- [转]GoEasy实现web实时推送过程中的自动补发功能
- ubuntu源码安装django
- 【Algothrim】动态规划实例(0、1背包问题)
- 重学 Statistics,Cha12 Tests of Goodness of Fit and Independence
- GoEasy实现web实时推送过程中的自动补发功能
- history.back(-1)和history.go(-1)的区别
- CEF中文教程(google chrome浏览器控件) -- CEF简介
- codefreecamp-Basic Algorithm Scripting
- POJ1003:Hangover
- HDU3107 Godfather(树的重心)
- GoEasy推送实时消息到web端
- The Most Important Algorithms (in CS and Math)
- 求两圆交点算法代码实现(Golang/Go语言)
- Golang测试技术
- GoogLeNet
- Django安装配置及HelloWorld
- Navicat导入数据时发生了报错 --- 1153 - Got a packet bigger than 'max_allowed的处理办法
- How to play BreakerBall game on DragonBoard 410c ?
- pymongo方法