3184번 양

https://www.acmicpc.net/problem/3184

기초적인 BFS

#include <iostream>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
#include <set>
#include <functional>
#include <unordered_map>  
#include <unordered_set>  
#include <tuple>
#include <sstream>
 
#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")
 
using namespace std;
 
bool visit[255][255] = { false, };
 
int R = 0, C = 0, lv = 0, lk = 0, v = 0, k = 0;
 
int dy[4] = { 0, 1,0, -1 };
int dx[4] = { 1, 0, -1, 0 };
 
char Map[255][255];
 
void DFS(int r, int c)
{
    if (Map[r][c] == 'v') ++v;
    else if (Map[r][c] == 'k') ++k;
 
    visit[r][c] = true;
 
    for (int i = 0; i < 4; i++)
    {
        int y = r + dy[i];
        int x = c + dx[i];
 
        if (y < 0 || y >= R || x < 0 || x >= C || Map[y][x] == '#' || visit[y][x]) continue;        
 
        DFS(y, x);
    }
}
 
int main(void)
{
    scanf("%d %d", &R, &C);
 
    for (int i = 0; i < R; i++)
        for (int j = 0; j < C; j++)
        {
            cin >> Map[i][j];
 
            if (Map[i][j] == 'v') ++lv;        
            else if (Map[i][j] == 'k') ++lk;        
        }
 
    for (int i = 0; i < R; i++)
        for (int j = 0; j < C; j++)    
            if (!visit[i][j] && (Map[i][j] == 'v' || Map[i][j] == 'k'))
            {            
                v = k = 0;
 
                DFS(i, j);
 
                if (k > v) lv -= v;
                else lk -= k;
            }
 
    printf("%d %d\n", lk, lv);
 
    return 0;
}