[C언어]14620 꽃길

3개 놓는 경우의 수 다 찾아서!!!

문제에서 말한 MIN 값 찾으면 됨!!

#include <stdio.h>
#include <string.h>
 
typedef struct
{
    int y, x;
}point;
 
int N, map[13][13], MIN, visit[13][13];
int dx[] = { 0,0,-1,1 }, dy[] = { -1,1,0,0 };
 
point Q[3];
 
 
int Charge()
{
    int total = 0;
    int V[13][13] = { 0, };
    for (int a = 0; a < 3; a++)
    {
        int x = Q[a].x;
        int y = Q[a].y;
 
        total += map[y][x];
        V[y][x] = 1;
 
        for (int i = 0; i < 4; i++)
        {
            int yy = y + dy[i];
            int xx = x + dx[i];
 
            if (map[yy][xx] == -1 || V[yy][xx] == 1)
                return 987654321;
 
            total += map[yy][xx];
            V[yy][xx] = 1;
 
        }
    }
    return total;
}
 
void DFS(int y, int x, int num)
{
 
    if (num == 3)
    {
        int Total = Charge();
 
        if (Total < MIN)
            MIN = Total;
 
        return;
    }
 
    for (int i = y; i < N; i++)
    {
        for (int j = x; j < N; j++)
        {
            if (visit[i][j] == 0)
            {
                visit[i][j] = 1;
                Q[num].y = i;
                Q[num].x = j;
                DFS(i, j, num + 1);
                Q[num].x = 0;
                Q[num].y = 0;
                visit[i][j] = 0;
            }
        }
        x = 2;
    }
    return;
}
 
 
int main()
{
    MIN = 987654321;
    memset(map, -1, sizeof(map));
    memset(visit, 0, sizeof(visit));
    scanf("%d", &N);
 
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= N; j++)
        {
            scanf("%d", &map[i][j]);
        }
    }
 
 
    DFS(2, 2, 0);
 
    printf("%d\n", MIN);
 
    return 0;
}