2. 程式人生 > >POJ 1979 Red and Black

POJ 1979 Red and Black

阿新 • • 發佈：2018-04-29
水題 IT sin earch contain tput scanf sample eating

Red and Black
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 41222 Accepted: 22338

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.

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.


There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

‘.‘ - a black tile
‘#‘ - a red tile
‘@‘ - a man on a black tile(appears exactly once in a data set)
The end of the input is indicated by a line consisting of two zeros.

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).

Sample Input

6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0

Sample Output

45
59
6
13

Source

Japan 2004 Domestic 思路：水題，bfs即可。 
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int map[21][21];
int w,h,sx,sy,ans;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
struct nond{ int x,y; };
int main(){
    while(scanf("%d%d",&w,&h)&&w!=0&&h!=0){
        swap(w,h);
        for(int i=1;i<=w;i++)
            for(int j=1;j<=h;j++){
                char x;cin>>x;
                if(x==‘.‘)    map[i][j]=0;
                else if(x==‘#‘)    map[i][j]=1;
                else if(x==‘@‘){ sx=i;sy=j;map[i][j]=0; }
            }
        queue<nond>que;ans=1;
        nond tmp;tmp.x=sx;tmp.y=sy;
        que.push(tmp);map[sx][sy]=1;
        while(!que.empty()){
            nond now=que.front();
            que.pop();
            for(int i=0;i<4;i++){
                int cx=dx[i]+now.x;
                int cy=dy[i]+now.y;
                if(cx>=1&&cx<=w&&cy>=1&&cy<=h&&!map[cx][cy]){
                    map[cx][cy]=1;
                    nond mid;mid.x=cx;mid.y=cy;
                    que.push(mid);ans++;
                    //cout<<cx<<" "<<cy<<endl;
                }
            }
        }
        cout<<ans<<endl;
    }
}

POJ 1979 Red and Black

相關推薦

POJ 1979 Red and Black（簡單DFS）

either www enter ont false num present direction roo Red and Black Description There is a rectangular room, covered with square tile

POJ 1979 Red and Black (簡單dfs)

++ blog mage dir sin div names turn main 題目： 簡單dfs，沒什麽好說的 代碼： #include <iostream> using namespace std; typedef long long ll

POJ 1979 Red and Black (BFS)

搜索 ont eat size ++ mes 直接 pro eof 鏈接 : Here! 思路 : 簡單的搜索, 直接廣搜就ok了. /*****************************************************************

POJ 1979 Red and Black

水題 IT sin earch contain tput scanf sample eating Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submission

ACM:POJ-1979 Red And Black（JAVA的字元陣列輸入以及標記方法）

對於該題目直接用DFS或者BFS都可以直接暴力出來，實際上題目也不難，只需要遞迴一個搜尋方法即可。那麼用C或者C++將很容易的解決這個題目。 但是如果用JAVA寫的話將存在一個昨晚讓我糾結了很久的問題：輸入資訊需要以字元陣列的形式儲存，那麼如何解決標記以及儲存的問題？ 剛開

【POJ】1979 Red and Black（BFS）

Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 44023 Accepted: 23850 Description There is a

HDU 1979 Red and Black

pro lin itself tip 設置問題 dir repeat ons elf 題目： There is a rectangular room, covered with square tiles. Each tile is colored either red or

Red and Black POJ - 1979

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 c

HDU1312 Red and Black

fine mil scanf inpu red other mit ets represent Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (

hdoj-1312-Red and Black

man arc others sim track pid for each only red Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Jav

HDU 1312 Red and Black（bfs，dfs均可，個人傾向bfs）

spec int ger time scrip follow stdio.h stack line 題目代號：HDU 1312 題目鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=1312 Red and Black Time Li

HDU - 1312 ： Red and Black

getchar() nbsp and stand oid std void tile follow There is a rectangular room, covered with square tiles. Each tile is colored either red

POJ1979 Red and Black 走黑磚【DFS】

聯通塊 tro problem AC print 要求 pri 聯通 dir 題目鏈接 題目大意： 求圖中最大‘.‘的連通塊，輸出該最大連通塊的塊數 #include <cstdio> int n, m, res; int dir[4][2] = {

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. F

解題記錄：B - 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 til

HDU 1312 Red and Black(簡單BFS 聯通塊)

Red and Black Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26972&nbs

POJ1979 Red and Black

思路：先將圖存在二維陣列a[20][21]中，標記@的位置為x,y。從@處出發，不停的把鄰接部分用#代替，直到圖中不存在‘.’為止。 總共進行DFS次數就是答案了。4個方向對應四種狀態。 程式碼如下： #include<iostream> using namespace st

N - Red and Black ~~ [kuangbin帶你飛]專題一 簡單搜尋

有一個長方形的房間，覆蓋了正方形的磁磚。每塊磁磚的顏色，要麼是紅色，要麼是黑色。一名男子站在一塊黑色的磁磚上。他可以從一塊磁磚移至相鄰四塊磁磚中的某一塊。但是，他不允許在紅色磁磚上移動，他只允許在黑色磁磚上移動。 編寫一個程式，使得他允許重複上述的移動，判斷他所能到達的黑色磁磚的數量。 輸入

POJ1979 Red and Black

思路：先將圖存在二維陣列a[20][21]中，標記@的位置為x,y。從@處出發，不停的把鄰接部分用#代替，直到圖中不存在‘.’為止。 總共進行DFS次數就是答案了。4個方向對應四種狀態。 程式碼如下： #include<iostream> using nam

1312 RED AND BLACK

#include<bits/stdc++.h> using namespace std; int n,m; int ans; int visit[200][200]; int dx[]= {-1,1,0,0}; int dy[]= {0,0,-1,1}; ch