14620번

14620

#include <iostream>
#include <algorithm>

using namespace std;

int n;
int map[10][10];
bool visited[10][10] = {
    false,
};

int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int answer = 987654321;

bool visitXY(int x, int y)
{
    if (visited[x][y])
        return true;
    for (int i = 0; i < 4; i++)
    {
        if (visited[x + dx[i]][y + dy[i]])
            return true;
    }
    return false;
}

void check(int x, int y)
{
    visited[x][y] = true;
    for (int i = 0; i < 4; i++)
    {
        visited[x + dx[i]][y + dy[i]] = true;
    }
}

void uncheck(int x, int y)
{
    visited[x][y] = false;
    for (int i = 0; i < 4; i++)
    {
        visited[x + dx[i]][y + dy[i]] = false;
    }
}

int getSum()
{
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (visited[i][j])
            {
                sum += map[i][j];
            }
        }
    }
    return sum;
}

void dfs(int cnt)
{
    if (cnt == 3)
    {
        answer = min(answer, getSum());
        return;
    }

    for (int i = 1; i < n - 1; i++)
    {
        for (int j = 1; j < n - 1; j++)
        {
            if (!visitXY(i, j))
            {
                check(i, j);
                dfs(cnt + 1);
                uncheck(i, j);
            }
        }
    }
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cin >> map[i][j];
        }
    }
    dfs(0);
    cout << answer;
}