URAL 1519 Formula 1

题目链接：http://acm.timus.ru/problem.aspx?space=1&num=1519

题意：对于给定地图，存在多少条不同的回路只经过所有的可行格子。

思路：限制只能用一条回路，所以用最小表示法记录轮廓线。由于是单回路，所以合并相同连通性的插头，只能在最后一个合法格子处。每个可走格子一定有两个插头。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define LL long long
#define Clean(x,y) memset(x,y,sizeof(x))
int n,m;
int pre,cur;
int edx , edy;
char g[15][15];
const int maxn = 30001;

int bit = 7;
int inc = 3;
int code[20];
int vis[20];

struct hash_table
{
    int head[maxn] , next[maxn];
    LL value[maxn] , state[maxn];
    int size;
    void clear()
    {
        size = 0;
        Clean(head,-1);
    }
    void push( LL S , LL V )
    {
        int index = S % maxn;
        for( int k = head[index]; k != -1; k = next[k] )
            if ( state[k] == S )
            {
                value[k] += V;
                return;
            }
        state[size] = S , value[size] = V;
        next[size] = head[index] , head[index] = size++;
    }
}dp[2];

void init()
{
    edx = edy = 0;
    getchar();
    for( int i = 1; i <= n; i++ )
    {
        gets( g[i]+1 );
        for( int j = 1; j <= m; j++ )
            if( g[i][j] == '.' ) edx = i , edy = j; //记录最后一个合法格子
    }
}

inline void decode( LL S , int m )
{
    for( int i = 0; i <= m; i++ ) code[i] = S & bit , S >>= inc;
}

inline LL encode( int m ) //最小表示法生成状态
{
    LL ans = 0;
    int now = 1;
    Clean(vis,-1);
    vis[0] = 0;
    for( int i = m; i >= 0; i-- )
    {
        if ( -1 == vis[ code[i] ] ) vis[code[i]] = now++;
        code[i] = vis[ code[i] ];
        ans <<= inc;
        ans |= code[i];
    }
    return ans;
}

void DP( int x , int y , int k )
{
    decode( dp[pre].state[k] , m );
    int left = code[y-1] , up = code[y];
    code[y] = code[y-1] = 0;
    LL V = dp[pre].value[k];

    if ( g[x][y] == '*' ) //不可走格子
    {
        if ( !left && !up ) dp[cur].push( encode(m) , V );
    }
    else //可走
    {
        if ( !left && !up ) //无插头 ， 生成两个插头
        {
            if ( x < n && y < m && g[x+1][y] == '.' && g[x][y+1] == '.' )
            {
                code[y-1] = code[y] = bit;
                dp[cur].push( encode( m ) , V );
            }
        }
        else if ( !left || !up ) //单插头
        {
            //分别尝试去生成下/右插头
            if ( x < n && g[x+1][y] == '.' )
            {
                code[y-1] = left + up;
                dp[cur].push( encode(m) , V );
                code[y-1] = 0;
            }
            if ( y < m && g[x][y+1] == '.' )
            {
                code[y] = left + up;
                dp[cur].push( encode(m) , V );
            }
        }
        else if ( left != up ) //合并两个不连通的插头
        {
            for( int i = 0; i <= m; i++ )
                if ( code[i] == up ) code[i] = left;
            code[y] = code[y-1] = 0;
            dp[cur].push( encode(m) , V );
        }
        else if ( x == edx && y == edy ) //两个连通的插头只能在最后一个格子合并，并形成回路。
            dp[cur].push( encode(m) , V );
    }
}

void solve()
{
    if( 0==edx ){ puts("0");return; }
    cur = 0;
    dp[0].clear();
    dp[0].push( 0 , 1 );
    for( int i = 1; i <= n; i++ )
    {
        pre = cur , cur ^= 1;
        dp[cur].clear();
        for( int k = 0; k < ( dp[pre].size ); k++ )
            dp[cur].push( dp[pre].state[k]<<inc , dp[pre].value[k] );

        for( int j = 1; j <= m; j++ )
        {
            pre = cur , cur ^= 1;
            dp[cur].clear();
            for( int k = 0; k < dp[pre].size; k++ ) DP( i , j , k );
        }
    }
    for( int k = 0; k < dp[cur].size; k++ )
        if ( dp[cur].state[k] == 0 )
        {
            cout<<dp[cur].value[k]<<endl;
            return;
        }
    puts("0");
}

int main()
{
    while( scanf("%d%d",&n,&m) == 2 )
    {
        init();
        solve();
    }
    return 0;
}