poj-1979 && hdoj - 1312 Red and Black (简单dfs)

【poj-1979 && hdoj - 1312 Red and Black (简单dfs)】的更多相关文章

poj-1979 && hdoj - 1312 Red and Black (简单dfs)

http://poj.org/problem?id=1979 基础搜索. #include <iostream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <algorithm> #include <string> #include <set>…

POJ 1979 Red and Black (简单dfs)

题目: 简单dfs,没什么好说的代码: #include <iostream> using namespace std; typedef long long ll; #define INF 2147483647 int w,h; ][]; ][] = {-,,,,,-,,}; ; void dfs(int x,int y){ || x >= h || y < || y >= w || a[x][y] == '#') return; ans++; a[x][y] = '#';…

HDU 1312 Red and Black （dfs）

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1312 Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17773 Accepted Submission(s): 10826 Problem Description There is a rectangula…

HDU 1312:Red and Black（DFS搜索）

HDU 1312:Red and Black Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. F…

Red and Black(简单dfs)

Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12519 Accepted Submission(s): 7753 Problem Description There is a rectangular room, covered with square tiles. Each tile is color…

Hdoj 1312.Red and Black 题解

Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can mo…

POJ1979 Red and Black (简单DFS)

POJ1979 Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can mo…