CodeForces - 242C：King's Path（bfs）

Discription
The black king is standing on a chess field consisting of 109 rows and 109 columns. We will consider the rows of the field numbered with integers from 1 to 109 from top to bottom. The columns are similarly numbered with integers from 1 to 109 from left to right. We will denote a cell of the field that is located in the i-th row and j-th column as (i, j).

You know that some squares of the given chess field are allowed. All allowed cells of the chess field are given as n segments. Each segment is described by three integers ri, ai, bi (ai ≤ bi), denoting that cells in columns from number ai to number bi inclusive in the ri-th row are allowed.

Your task is to find the minimum number of moves the king needs to get from square (x0, y0) to square (x1, y1), provided that he only moves along the allowed cells. In other words, the king can be located only on allowed cells on his way.

Let us remind you that a chess king can move to any of the neighboring cells in one move. Two cells of a chess field are considered neighboring if they share at least one point.

Input
The first line contains four space-separated integers x0, y0, x1, y1 (1 ≤ x0, y0, x1, y1 ≤ 109), denoting the initial and the final positions of the king.

The second line contains a single integer n (1 ≤ n ≤ 105), denoting the number of segments of allowed cells. Next n lines contain the descriptions of these segments. The i-th line contains three space-separated integers ri, ai, bi (1 ≤ ri, ai, bi ≤ 109, ai ≤ bi), denoting that cells in columns from number ai to number bi inclusive in the ri-th row are allowed. Note that the segments of the allowed cells can intersect and embed arbitrarily.

It is guaranteed that the king’s initial and final position are allowed cells. It is guaranteed that the king’s initial and the final positions do not coincide. It is guaranteed that the total length of all given segments doesn’t exceed 105.

Output
If there is no path between the initial and final position along allowed cells, print -1.

Otherwise print a single integer — the minimum number of moves the king needs to get from the initial position to the final one.

Examples
Input
5 7 6 11
3
5 3 8
6 7 11
5 2 5
Output
4
Input
3 4 3 10
3
3 1 4
4 5 9
3 10 10
Output
6
Input
1 1 2 10
2
1 1 3
2 6 10
Output
-1

题意
在一个1e9*1e9的表格中，给定起点和终点，和n个可行范围，要求求出最小步数使能从起点走到终点。
第一行输入表示起点和终点的坐标。
第二行n表示有n个可行范围。
往后n行，每行三个数分别代表第几行，当前行第几个到第几个是可行范围。

思路
这是道广搜题，因为1e9*1e9直接爆搜肯定会爆，所以只需要遍历可行范围，对于范围外的不存。
这道题我开始知道是道搜索题，但是我搜索还不是很会，就参考了网上的题解，加深自己的印象。

AC代码

#include<bits/stdc++.h>
using namespace std;
int go[8][2]={{-1,-1},{0,-1},{1,-1},{1,0},{-1,0},{-1,1},{0,1},{1,1}};
queue<pair<int,int> >qq;
map<pair<int,int>,int>m;
int sx,sy,ex,ey,n;
int r,li,ri;
long long ans;
void bfs()
{
    pair<int,int>start;
    start=make_pair(sx,sy);
    m[start]=0;
    qq.push(start);///首位置入队
    while(!qq.empty())
    {
        pair<int,int>p1,p2;
        p1=qq.front();
        if(p1.first==ex&&p1.second==ey)
        {
            ans=m[p1];///终止条件，找到末位置就返回
            return;
        }
        qq.pop();
        for(int i=0;i<8;i++)
        {
            p2.first=p1.first+go[i][0];
            p2.second=p1.second+go[i][1];///继续往下走
            if(m.find(p2)!=m.end()&&m[p2]==-1)///判断是否在在可行范围内并且没有走过
            {
                m[p2]=m[p1]+1;///步数加一
                qq.push(p2);
            }
        }
    }
}
int main()
{
    cin>>sx>>sy>>ex>>ey;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>r>>li>>ri;
        for(int j=li;j<=ri;j++)///在列区间每一个都可以走
            m[make_pair(r,j)]=-1;///赋初值-1，表示没有走过
    }
    ans=-1;
    bfs();
    cout<<ans<<endl;
    return 0;
}