2-P 왜 예제에서 0이 나올까요..?

2024-07-12T04:40:05.035Z

2024-07-12T04:55:20.014Z

2024-07-12T00:15:59.460Z

0

아 제가 코드블럭이 따로 있는 지 몰랐습니다.. 재첨부 드려요!

#include <iostream>
#include <string>
#include <vector>
#include <queue>

int calcArea(const std::vector<std::vector<int>>& map)

{
    int result = 0;

    for (int i = 0; i < map.size(); ++i)

    {
        for (int j = 0; j < map[i].size(); ++j)

        {
            if (map[i][j] == 0)
                result += 1;
        }
    }

    return result;
}

void bfs(std::vector<std::vector<int>>& map, std::vector<std::vector<bool>>& visited, const int yy, const int xx)

{
    std::queue<std::pair<int, int>> que;

    visited[yy][xx] = true;

    que.push({yy, xx});

    int y, x;

    int moveX[4] = {0, 0, -1, 1};

    int moveY[4] = {1, -1, 0, 0};

    while (!que.empty())

    {
        y = que.front().first;

        x = que.front().second;

        que.pop();

        for (int i = 0; i < 4; ++i)

        {
            int newX = x + moveX[i];

            int newY = y + moveY[i];

            if (newX >= 0 && newX < map[0].size() && newY >= 0 && newY < map.size() && !visited[newY][newX] && map[newY][newX] != 1)

            {
                que.push({newY, newX});

                visited[newY][newX] = true;

                map[newY][newX] = 2;
            }
        }
    }
}

int solve(std::vector<std::vector<int>> map, const std::vector<std::pair<int, int>>& virusList)

{
    std::vector<std::vector<bool>> visited(map.size());

    std::vector<bool> temp(map[0].size());

    temp.assign(temp.size(), false);

    visited.assign(visited.size(), temp);

    for (int i = 0; i < virusList.size(); ++i)

    {
        bfs(map, visited, virusList[i].first, virusList[i].second);
    }

    return calcArea(map);
}

int solution(std::vector<std::vector<int>> map, const std::vector<std::pair<int, int>>& wallList, const std::vector<std::pair<int, int>>& virusList)

{
    int result = 0;

    for (int i = 0; i < wallList.size(); ++i)

    {
        for (int j = 0; j < i; ++j)

        {
            for (int k = 0; k < j; ++k)

            {
                map[wallList[i].first][wallList[i].second] = 1;

                map[wallList[j].first][wallList[j].second] = 1;

                map[wallList[k].first][wallList[k].second] = 1;

                result = std::max(result, solve(map, virusList));

                map[wallList[i].first][wallList[i].second] = 0;

                map[wallList[j].first][wallList[j].second] = 0;

                map[wallList[k].first][wallList[k].second] = 0;
            }
        }
    }

    return result;
}

int main()

{
    std::ios_base::sync_with_stdio(false);

    std::cin.tie(nullptr);

    std::cout.tie(nullptr);

    int N, M;

    std::cin >> N >> M;

    std::string str;

    std::vector<std::vector<int>> map;

    int temp;

    std::vector<std::pair<int, int>> wallList, virusList;

    for (int i = 0; i < N; ++i)

    {
        std::vector<int> tempVec;

        for (int j = 0; j < M; ++j)

        {
            std::cin >> temp;

            if (temp == 1)
                wallList.push_back({i, j});

            else if (temp == 2)
                virusList.push_back({i, j});

            tempVec.push_back(temp);
        }

        map.push_back(tempVec);
    }

    int result = 0;

    result = solution(map, wallList, virusList);

    std::cout << result << std::endl;

    return 0;
}