Manhattan Wiring

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 1112		Accepted: 636

Description

There is a rectangular area containing n × m cells. Two cells are marked with “2”, and another two with “3”. Some cells are occupied by obstacles. You should connect the two “2”s and also the two “3”s with non-intersecting lines. Lines can run only vertically or horizontally connecting centers of cells without obstacles.

Lines cannot run on a cell with an obstacle. Only one line can run on a cell at most once. Hence, a line cannot intersect with the other line, nor with itself. Under these constraints, the total length of the two lines should be minimized. The length of a line is defined as the number of cell borders it passes. In particular, a line connecting cells sharing their border has length 1.

Fig. 1(a) shows an example setting. Fig. 1(b) shows two lines satisfying the constraints above with minimum total length 18.

Figure 1: An example of setting and its solution

Input

The input consists of multiple datasets, each in the following format.

n	m
row1
…
rown

n is the number of rows which satisfies 2 ≤ n ≤ 9. m is the number of columns which satisfies 2 ≤ m ≤ 9. Each row_i is a sequence of m digits separated by a space. The digits mean the following.

0: Empty

1: Occupied by an obstacle

2: Marked with “2”

3: Marked with “3”

The end of the input is indicated with a line containing two zeros separated by a space.

Output

For each dataset, one line containing the minimum total length of the two lines should be output. If there is no pair of lines satisfying the requirement, answer “0” instead. No other characters should be contained in the output.

Sample Input

5 50 0 0 0 00 0 0 3 02 0 2 0 01 0 1 1 10 0 0 0 32 32 2 00 3 36 52 0 0 0 00 3 0 0 00 0 0 0 01 1 1 0 00 0 0 0 00 0 2 3 05 90 0 0 0 0 0 0 0 00 0 0 0 3 0 0 0 00 2 0 0 0 0 0 2 00 0 0 0 3 0 0 0 00 0 0 0 0 0 0 0 09 93 0 0 0 0 0 0 0 20 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 02 0 0 0 0 0 0 0 39 90 0 0 1 0 0 0 0 00 2 0 1 0 0 0 0 30 0 0 1 0 0 0 0 20 0 0 1 0 0 0 0 30 0 0 1 1 1 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 09 90 0 0 0 0 0 0 0 00 3 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 00 0 0 0 0 0 2 3 20 0

Sample Output

182171205243

Source

 

 

插头DP，上次做这题的时候写了篇报告：

熟悉插头DP后，按照自己的模板风格又写了一遍。

查了好久的错误，插头DP非常容易写错。

/*POJ 3133连接2的插头为2，连接3的插头为3没有插头为0用四进制表示（四进制比三进制高效）G++ 391ms*/#include
      
       #include
       
        #include
        
         #include
         
          using namespace std;const int MAXD=15;const int HASH=10007;const int STATE=1000010;int N,M;int maze[MAXD][MAXD];//0表示障碍，1是非障碍，2和3int code[MAXD];//0表示没有插头,2表示和插头2相连，3表示和插头3相连struct HASHMAP{    int head[HASH],next[STATE],size;    int state[STATE];    int dp[STATE];    void init()    {        size=0;        memset(head,-1,sizeof(head));    }    void push(int st,int ans)    {        int i,h=st%HASH;        for(i=head[h];i!=-1;i=next[i])          if(state[i]==st)          {              if(dp[i]>ans)dp[i]=ans;              return;          }        state[size]=st;        dp[size]=ans;        next[size]=head[h];        head[h]=size++;    }}hm[2];void decode(int *code,int m,int st)//四进制{    int i;    for(int i=m;i>=0;i--)    {        code[i]=(st&3);        st>>=2;    }}int encode(int *code,int m){    int i;    int st=0;    for(int i=0;i<=m;i++)    {        st<<=2;        st|=code[i];    }    return st;}void shift(int *code,int m)//换行{    for(int i=m;i>0;i--)code[i]=code[i-1];    code[0]=0;}void dpblank(int i,int j,int cur){    int k,left,up;    for(k=0;k
          
           0)ans-=2;    printf("%d\n",ans);}int main(){    //freopen("in.txt","r",stdin);    //freopen("out.txt","w",stdout);    while(scanf("%d%d",&N,&M))    {        if(N==0&&M==0)break;        init();        solve();    }    return 0;}