4456: [Zjoi2016]旅行者 分治+最短路

UOJ跑不过。。BZOJ勉强过啦。
首先离线，然后考虑像K-D tree一样进行分治，比如当前的矩形区域为(x1,y1)..(x2,y2)，那么考虑点在区域内的询问，我们将矩形划分为两部分（划分较长的一边），然后考虑两种情况：
如果询问的两点在分界线的两边，那么最短路一定跨过分界线。
否则也有可能跨过分界线。
所以我们求出分界线上的点到区域内每个点的最短路，更新答案。然后再递归求第二种情况。

#include<iostream>
#include<cstdio>
#include<queue>
#include<map>
#define pii pair<int,int>
using namespace std;

const int INF=1e9;
const int N=20005;
const int M=100005;
int n,m,Q,tot,cnt;
int X[N],Y[N],dis[N],head[N];
int list[N<<2],next[N<<2],key[N<<2];
bool vis[N];
int ans[M];
struct node 
{
    int x1,y1,x2,y2,id;
};
node p[M],q[M];

inline int read()
{
    int a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}

inline void insert(int x,int y,int z)
{
    next[++cnt]=head[x];
    head[x]=cnt;
    list[cnt]=y;
    key[cnt]=z;
}

inline int id(int i,int j)
{
    return (i-1)*m+j;
}

inline void dijkstra(int st,int x1,int y1,int x2,int y2)
{
//  cout<< "start : " <<st << " " ;
    priority_queue<pii,vector<pii>,greater<pii> > q;
    for (int i=x1;i<=x2;i++)
        for (int j=y1;j<=y2;j++)
        {
            int x=id(i,j);
            dis[x]=INF;
            vis[x]=false;
        }
    dis[st]=0;
    q.push(make_pair(0,st));
    while (!q.empty())
    {
        int x=q.top().second; q.pop();
        if (vis[x]) continue;
        vis[x]=true;
        for (int i=head[x];i;i=next[i])
            if (dis[list[i]]>dis[x]+key[i])
                if (X[list[i]]>=x1&&X[list[i]]<=x2&&Y[list[i]]>=y1&&Y[list[i]]<=y2) 
                {
                    dis[list[i]]=dis[x]+key[i];
                    q.push(make_pair(dis[list[i]],list[i]));
                }
    }
}   

inline void solve(int x1,int y1,int x2,int y2,int L,int R)
{

    if (L>R) return;
//  cout << x1 << " " << y1 << " " << x2 << " " << y2 << " " << L << " " << R << endl;
    if (x2-x1>y2-y1)
    {
        int mid=x1+x2>>1;
        for (int i=y1;i<=y2;i++)
        {
            dijkstra(id(mid,i),x1,y1,x2,y2);
            for (int j=L;j<=R;j++)
                ans[q[j].id]=min(ans[q[j].id],dis[id(q[j].x1,q[j].y1)]+dis[id(q[j].x2,q[j].y2)]);
        }
        int l=L-1,r=R+1;
        for (int i=L;i<=R;i++)
            if (q[i].x1<mid&&q[i].x2<mid) p[++l]=q[i];
            else if (q[i].x1>mid&&q[i].x2>mid) p[--r]=q[i];
        for (int i=L;i<=l;i++) q[i]=p[i];
        for (int i=R;i>=r;i--) q[i]=p[i];
        solve(x1,y1,mid-1,y2,L,l); solve(mid+1,y1,x2,y2,r,R);
    }
    else
    {
        int mid=y1+y2>>1;
        for (int i=x1;i<=x2;i++)
        {
            dijkstra(id(i,mid),x1,y1,x2,y2);
//          for (int i=1;i<=n*m;i++)
//              cout << dis[i] << " ";
//          puts("");
            for (int j=L;j<=R;j++)
                ans[q[j].id]=min(ans[q[j].id],dis[id(q[j].x1,q[j].y1)]+dis[id(q[j].x2,q[j].y2)]);
        }
        int l=L-1,r=R+1;
        for (int i=L;i<=R;i++)
            if (q[i].y1<mid&&q[i].y2<mid) p[++l]=q[i];
            else if (q[i].y1>mid&&q[i].y2>mid) p[--r]=q[i];
        for (int i=L;i<=l;i++) q[i]=p[i];
        for (int i=R;i>=r;i--) q[i]=p[i];
        solve(x1,y1,x2,mid-1,L,l); solve(x1,mid+1,x2,y2,r,R);
    }
}

int main()
{
//  freopen("tourist.ans","w",stdout);

    n=read(); m=read();
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            X[id(i,j)]=i,Y[id(i,j)]=j;
    for (int i=1;i<=n;i++)
        for (int j=1;j<m;j++)
        {
            int x=read();
            int a=id(i,j),b=id(i,j+1);
            insert(a,b,x);
            insert(b,a,x);
        }
    for (int i=1;i<n;i++)
        for (int j=1;j<=m;j++)
        {
            int x=read();
            int a=id(i,j),b=id(i+1,j);
            insert(a,b,x);
            insert(b,a,x);
        }
    Q=read();
    for (int i=1;i<=Q;i++)
    {
        int x1=read(),y1=read(),x2=read(),y2=read();
        if (x1==x2&&y1==y2) ans[i]=0;
        else q[++tot]=(node){x1,y1,x2,y2,i},ans[i]=INF;
    }
    solve(1,1,n,m,1,tot);
    for (int i=1;i<=Q;i++)
        printf("%d\n",ans[i]);
    return 0;
}