POJ 1979题Red and Black

最新推荐文章于 2020-09-11 21:51:08 发布
原创 最新推荐文章于 2020-09-11 21:51:08 发布 · 562 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

这是一道关于DFS搜索的ACM问题，要求计算在给定的红色和黑色格子地图中，从指定的黑色起点能到达多少个黑色格子。题目提供多个数据集，每个数据集描述了一个矩形区域的格子颜色，并且包含一个人的初始位置。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

感觉自己很水，转眼大三快要毕业了，很无奈，最为一个基本上没怎么碰过acm的人，慌得一皮，尤其夏令营被自己气的睡不着觉，所以最近赶紧刷几波OJ稳定下心境，我想以后无论是考研还是工作都会用到的。

Red and Black 
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 13508 Accepted Submission(s): 8375

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 move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.

最低0.47元/天 解锁文章

200万优质内容无限畅学
风浅_wei
关注
POJ - 1979：Red and Black
WINGREZ‘S BLOG
05-27 476
POJ - 1979：Red and Black 来源： 标签： 参考资料： 相似题目： 题目 There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black ...
poj1979 Red and Black
Jinbao
02-18 874
Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 24058   Accepted: 13007 Description There is a rectangular room, covered with square tiles. E
【题解】POJ 1979 Red and Black(DFS)
bu_shushu的博客
04-30 377
POJ 1979 Red and Black 原题 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 ...
Poj 1979 Red and Black
曾经沧海难为水，除却巫山不是云
01-13 460
Language: DefaultEspañol Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 27802   Accepted: 15097 Description There is a rectangular room, c
POJ1979:Red and Black
zhaoGavin的博客
05-22 571
题目描述 Red and Black 大意是只能走周围的4个相邻点，只能走黑色点，不能走红色点 输出最多可以走多少个不同的黑色点 题目思路 DFS 往四个方向走，走过的点标记一下 碰到红色点或者越界或者标记过的点，是DFS的终止条件 代码 #include <iostream> #include<stdio.h> using namespac...
POJ1979:Red and Black(广度优先搜索)
xiaodu1997的博客
04-03 445
原题内容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 c
POJ 1979 Red and Black (深度优先遍历)
u014309268的专栏
10-02 1170
Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 22768   Accepted: 12286 Description There is a rectangular room, covered with square tiles. Eac
POJ 1979 Red and Black(广搜与深搜两种解答）
04-12
标题“POJ 1979 Red and Black”是一个编程竞赛题目，主要涉及的问题是算法设计，特别是搜索算法。在这个问题中，广度优先搜索（BFS）和深度优先搜索（DFS）这两种策略被用来解决特定的红黑树相关的问题。红黑树是一...
POJ1979_Red and Black(JAVA语言)
老张的博客
05-19 2583
思路：bfs裸题。 对这种迷宫问题的bfs，我们把坐标点用一个class来存储，并放入队列进行求解。 //一直接收不了输入，找了一个多小时的问题，居然是行和列搞反了ORZ Red and Black Time Limit:1000MS Memory Limit:30000K Total Submissions:48833 Accepted:260...
广搜与深搜算法实现POJ 1979 Red and Black问题
POJ（北京大学在线评测系统）1979题“Red and Black”是一道经典的算法题目，需要解决的核心问题是二维迷宫问题。题目要求参与者使用图搜索算法来找出从起点到终点的路径，通常涉及到的算法有广度优先搜索（BFS）和...
poj1979(Red and Black)
u012786545的专栏
11-22 470
题目：poj1979(Red and Black)
POj 1979 Red and Black（容易理解的dfs）
谦卑
09-11 393
#include<stdio.h> #include<stdlib.h> #include<string.h> int map[21][21]; int m = 0, n = 0; int num = 0; int d[4][2] = { {-1,0},{0,-1},{1,0},{0,1} }; void dfs(int x, int y) { int i = 0, j = 0, dx = 0, dy = 0; num++; map[x][y] = '#'; fo
POJ 1979 Red and Black 搜索
hpuhjl的专栏
11-26 2339
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...
POJ1979 Red and Black 题解
01-08 321
by BrotherRoot E - Red and Black 题意： 在Ｍ×Ｎ的棋盘上有红和黑两种方格，黑方格能够通行，红方个不能通行。求从指定的黑方格出发能够到达的方格总数 思路： 从起点进行ｆｌｏｏｄｆｉｌｌ，然后统计被访问的方格。 代码： #include const int MAXSIZE = 20; const int DIRECTNUM = 4; con
poj Red and Black
执
11-21 368
题目链接http://poj.org/problem?id=1979一个最基础的dfs搜索题//#include <bits/stdc++.h> #include "iostream" #include "cstring" using namespace std;typedef long long ll;int k[25][25];//标记数组 char c[25][25]; int ans = 0
Poj(1979)：Red and Black
Zayn123的博客
11-25 243
题目： 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 ...
pojRed and Black(dfs)
bokzmm的博客
12-16 351
Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 27213   Accepted: 14782 Description There is a rectangular room, covered with square tiles. Eac
POJ - 1979 Red and Black
朝夕
02-28 260
bfs / dfs 都可以做目前最熟的就是bfs了，所以用bfs做的 期间遇到了不是问题的问题，搁置了老长时间，快气哭了。 因为某种思维定式耽误了老长老长时间，已经有两个题这样了， 为了以后避免这种情况有必要单独拉出来说一说（严肃脸） 对于这道题的这两种样例 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#....
POJ - 1979-Red and Black
ah_yeah
07-28 326
Red and Black Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Description There is a rectangular room, covered with square tiles. Each tile is colored eithe
POJ--1979 Red and Black
persue_8168的博客
03-27 371
DescriptionThere 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. ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值