Codeforces Round #355 (Div. 2) D. Vanya and Treasure （两种方法结合）

1.宽搜+优先队列，队列中刚开始存着以i为值得所有点的坐标，搜出所有以i+1为值得所有坐标和最短距离。

2.当知道所有以i(x2, y2)为值得所有点的距离时，用循环求出以i+1(x1, y1)为值得所有点的距离.dis[x1][y1] = min(dis[x1][y1], dis[x2][y2]+abs(x1-x2)+abs(y1-y2));

单用第一种方法和第二种方法都超时。这里要把两种方法结合起来用。用cnt[i]表示以i为值得所有点的个数.当cnt[i] * cnt[i+1] <= n*m*100时用第二种方法，否则用第一种方法.

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 330
#define MOD 1000000007

struct node
{
    int x,y,d;
    node(){}
    node(int x,int y,int d):x(x),y(y),d(d){}
    bool operator <(const node &a)const
    {
        return d > a.d;
    }
}st;
int n,m,p;
int mp[330][330],dis[330][330];
vector<pair<int,int> > v[90090];
int vis[330][330];
int mx[4] = {0,0,1,-1};
int my[4] = {1,-1,0,0};

void bfs(int s,int e)
{
    priority_queue<node> q;
    for(int i = 0; i < v[s].size(); i++)
    {
        st.x = v[s][i].first;
        st.y = v[s][i].second;
        st.d = dis[st.x][st.y];
        q.push(st);
        vis[st.x][st.y] = 1;
    }
    int num = v[e].size();
    while(num)
    {
        st = q.top();
        q.pop();
        for(int i = 0; i < 4; i++)
        {
            int dx = st.x + mx[i];
            int dy = st.y + my[i];
            if(dx < 0 || dx >= n || dy < 0 || dy >= m)
                continue;
            if(vis[dx][dy])
                continue;
            vis[dx][dy] = 1;
            if(mp[dx][dy] == e)
            {
                dis[dx][dy] = st.d + 1;
                num--;
            }
            node s(dx,dy,st.d+1);
            q.push(s);
        }
    }
}
int main()
{
    int t,C = 1;
    //scanf("%d",&t);
    while(scanf("%d%d%d",&n,&m,&p) != EOF)
    {
        for(int i = 0; i < 330; i++)
            v[i].clear();
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
            {
                scanf("%d",&mp[i][j]);
                v[mp[i][j]].push_back(make_pair(i,j));
            }
        memset(dis,INF,sizeof(dis));
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
            {
                if(mp[i][j] == 1)
                    dis[i][j] = i + j;
            }

        for(int k = 2; k <= p; k++)
        {
            int k1 = v[k].size(),k2 = v[k-1].size();
            if(k1 * k2 <= n*m*100)
            {
                for(int i = 0; i < k1; i++)
                {
                    int x1 = v[k][i].first;
                    int y1 = v[k][i].second;
                    for(int j = 0; j < k2; j++)
                    {
                        int x2 = v[k-1][j].first;
                        int y2 = v[k-1][j].second;
                        int tmp = dis[x2][y2]+abs(x1-x2)+abs(y1-y2);
                        dis[x1][y1] = min(dis[x1][y1],tmp);
                    }
                }
            }
            else
            {
                memset(vis,0,sizeof(vis));
                bfs(k-1,k);
            }
        }
        int ans = INF;
        for(int i = 0; i < v[p].size(); i++)
            ans = min(ans,dis[v[p][i].first][v[p][i].second]);
        printf("%d\n",ans);
    }
    return 0;
}