9207번 페그 솔리테어

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

전형적인 백트래킹 문제이다.

#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;
 
char Map[6][10];
 
bool use[6][10] = { false, };
 
vector<pair<int, int> > v;
 
int dy[4] = { 0, 1, 0, -1 };
int dx[4] = { 1, 0, -1, 0 };
 
int MIN = 0, moving = 0;
 
int chk()
{
    int ret = 0;
 
    for (int i = 0; i < 5; i++)
        for (int j = 0; j < 9; j++)    
            if (Map[i][j] == 'o') ++ret;
 
    return ret;
}
 
void simulation(int cnt)
{
    int oc = chk();
 
    if (MIN > oc)
    {
        MIN = oc;
        moving = cnt;
    }
 
    for (int i = 0; i < 5; i++)
        for (int j = 0; j < 9; j++)
            if (Map[i][j] == 'o')
                for (int k = 0; k < 4; k++)
                {
                    int y = i + dy[k];
                    int x = j + dx[k];
                    int ny = i + 2 * dy[k];
                    int nx = j + 2 * dx[k];
 
                    if (ny < 0 || ny >= 5 || nx < 0 || nx >= 9) continue;
 
                    if (Map[y][x] == 'o' && Map[ny][nx] == '.')
                    {
                        Map[i][j] = '.';
                        Map[y][x] = '.';
                        Map[ny][nx] = 'o';
 
                        simulation(cnt + 1);
 
                        Map[i][j] = 'o';
                        Map[y][x] = 'o';
                        Map[ny][nx] = '.';
                    }
                }
}
 
int main(void)
{
    int T = 0;
 
    scanf("%d", &T);
 
    while (T--)
    {
        MIN = 2e9;
        moving = 0;
        v.clear();
 
        for (int i = 0; i < 5; i++)
            for (int j = 0; j < 9; j++)            
                cin >> Map[i][j];
 
        simulation(0);
 
        printf("%d %d\n", MIN, moving);
    }
 
    return 0;
}