BZOJ 3205 & UOJ 107 [APIO2013]ROBOTS

斯坦纳树DP。

f[i][j][x][y]表示i~j的机器人合并后移动到坐标(x,y)的最小花费。类似区间合并的转移方式+SPFA即可。

UOJ上这题非常坑，正常的Subtask都可以轻松通过，但是死活过不了一些Extra Test。
搞了一两天的常数，终于A了QAQ

#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
#define reg register
#define pack(_i,_j) ((_i)*M+(_j))
#define N 10
#define M 505
using namespace std;
const int INF = 1<<28;
char map[M][M],c;
int n, w, h, f[N][N][M][M], temp[M*M], val[M*M], top=0, I, J;
int dx[4]={0,0,1,-1}, dy[4]={1,-1,0,0}, aim[4][M][M], inq[M*M];
int left[4]={3,2,0,1}, right[4]={2,3,1,0}, in[4][M][M];
int sum[4*M*M], hh[M*M],q1[M*M],q2[M*M];
bool ban[4][M][M];
void SPFA()
{
    memset(sum,0,sizeof(sum));
    int mn=INF,mx=-INF;
    for (reg int i=1; i<=top; i++){
        sum[val[i]]++;
        mn=min(mn,val[i]);
        mx=max(mx,val[i]);
    }
    for (reg int i=mn+1; i<=mx; i++) sum[i]+=sum[i-1];
    for (reg int i=1; i<=top; i++) hh[sum[val[i]]--]=temp[i];
    for (reg int i=1; i<=top; i++) temp[i]=hh[top-i+1];
    int head1=0, tail1=0, head2=0, tail2=0;
    for(;top;top--)
    {
        q1[tail1++]=temp[top];
        inq[temp[top]]=1;
    }
    while(head1!=tail1 || head2!=tail2)
    {
        if(head1==tail1 || head2!=tail2 && f[I][J][q2[head2]/M][q2[head2]%M]<=f[I][J][q1[head1]/M][q1[head1]%M])//2
        {
            inq[q2[head2]]=0;
            int x=q2[head2]/M, y=q2[head2]%M;head2++;
            for(reg int k = 0; k < 4; k++)
            {
                if(ban[k][x][y])continue;
                int to=aim[k][x][y];
                int nx=to/M, ny=to%M;
                if(f[I][J][x][y]+1<f[I][J][nx][ny]) 
                {
                    f[I][J][nx][ny]=f[I][J][x][y]+1;
                    if(!inq[pack(nx,ny)])
                    {
                        inq[pack(nx,ny)]=1;
                        q2[tail2++]=pack(nx,ny);
                    }
                }
            }
        }
        else
        {
            inq[q1[head1]]=0;
            int x=q1[head1]/M, y=q1[head1]%M;head1++;
            for(reg int k = 0; k < 4; k++)
            {
                if(ban[k][x][y])continue;
                int to=aim[k][x][y];
                int nx=to/M, ny=to%M;
                if(f[I][J][x][y]+1<f[I][J][nx][ny]) 
                {
                    f[I][J][nx][ny]=f[I][J][x][y]+1;
                    if(!inq[pack(nx,ny)])
                    {
                        inq[pack(nx,ny)]=1;
                        q2[tail2++]=pack(nx,ny);
                    }
                }
            }
        }
    }
}
int dfs(int x,int y, int k)
{
    if(aim[k][x][y])return aim[k][x][y];
    if(map[x][y]=='x' || x<1 || y<1 || x>w || y>h)return pack(x-dx[k],y-dy[k]);
    if(in[k][x][y]){return -233;}
    int kk=k;
    if(map[x][y]=='A')kk=left[k];
    if(map[x][y]=='C')kk=right[k];
    int nx=x+dx[kk], ny=y+dy[kk];
    in[k][x][y]=1;

    int a=dfs(nx,ny,kk);
    if(a==-233)
        ban[k][x][y]=1;
    else
        aim[k][x][y]=a;
    return a;
}
void build()
{
    for(int i = 1; i <= w; i++)
        for(int j = 1; j <= h; j++)
            if(map[i][j]!='x')
                for(int k = 0; k < 4; k++)
                    dfs(i,j,k);
}
int main()
{
    scanf("%d%d%d",&n,&h,&w);
    memset(f,63,sizeof(f));
    for(int i = 1; i <= w; i++)
    {
        c=getchar();
        while(c=='\n' || c==' ')c=getchar();
        for(int j = 1; j <= h; j++)
        {
            map[i][j]=c;c=getchar();
            if(map[i][j]<='9' && map[i][j] >='1')
                f[map[i][j]-'0'][map[i][j]-'0'][i][j]=0;
        }
    }
    build();
    for(int len=0; len<n; len++)
        for(I = 1, J = I+len; J <= n; I++, J = I+len)
        {
            for(reg int k = I; k < J; k++)
                for(reg int x = 1; x <= w; x++)
                    for(reg int y = 1; y <= h; y++)
                        f[I][J][x][y]=min(f[I][J][x][y],f[I][k][x][y]+f[k+1][J][x][y]);
            top=0;
            for(reg int x = 1; x <= w; x++)
                for(reg int y = 1; y <= h; y++)
                    if(f[I][J][x][y]<INF)
                    {
                        temp[++top]=pack(x,y);
                        val[top]=f[I][J][x][y];
                    }
            SPFA();
        }
    int ans=INF;
    for(int i = 1; i <= w; i++)
        for(int j = 1; j <= h; j++)
            ans=min(f[1][n][i][j],ans);
    printf("%d\n",ans==INF?-1:ans);
    return 0;
}