POJ 3050

我是开了个六维的数组来记住它的每一步

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <time.h>
#include <string>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define PI acos( -1.0 )
const double E = 1e-8;
const int INF = 0x7fffffff;

int a[10][10], b[10];
int dir[][2] = { 0, -1, 0, 1, -1, 0, 1, 0 };
int mark[10][10][10][10][10][10];
int ans = 0;

void dfs( int x, int y, int num )
{
    if( num == 7 )
    {
        if( !mark[b[0]][b[1]][b[2]][b[3]][b[4]][b[5]] )
        {
            mark[b[0]][b[1]][b[2]][b[3]][b[4]][b[5]] = 1;
            ++ans;
        }
        return;
    }
    for( int k = 0; k < 4; ++k )
    {
        int dx = x + dir[k][0];
        int dy = y + dir[k][1];
        if( dx >= 0 && dy >= 0 && dy< 5 && dx < 5 ) {
            b[num] = a[dx][dy];
            dfs( dx, dy, num+1 );
        }
    }
}

int main()
{
    for( int i = 0; i < 5; ++i )
        for( int j = 0; j < 5; ++j )
            scanf( "%d", a[i]+j );
    memset( mark, 0, sizeof( mark ) );
    for( int i = 0; i < 5; ++i )
        for( int j = 0; j < 5; ++j ) {
            b[0] = a[i][j];
            dfs( i, j, 1 );
        }
    printf( "%d
", ans );
    return 0;
}