洛谷—— P1849 [USACO12MAR]拖拉机Tractor

Posted 2020-10-15

https://www.luogu.org/problemnew/show/P1849

题目描述

After a long day of work, Farmer John completely forgot that he left his tractor in the middle of the field. His cows, always up to no good, decide to play a prank of Farmer John: they deposit N bales of hay (1 <= N <= 50,000) at various locations in the field, so that Farmer John cannot easily remove the tractor without first removing some of the bales of hay.

The location of the tractor, as well as the locations of the N hay bales, are all points in the 2D plane with integer coordinates in the range 1..1000. There is no hay bale located at the initial position of the tractor. When Farmer John drives his tractor, he can only move it in directions that are parallel to the coordinate axes (north, south, east, and west), and it must move in a sequence of integer amounts. For example, he might move north by 2 units, then east by 3 units. The tractor cannot move onto a point occupied by a hay bale.

Please help Farmer John determine the minimum number of hay bales he needs to remove so that he can free his tractor (that is, so he can drive his tractor to the origin of the 2D plane).

经过一天漫长的工作，农场主 John 完全忘记了他的拖拉机还在场地中央。他的奶牛们总喜欢和他搞些恶作剧，它们在场地的不同位置丢下 N(1 ≤ N ≤ 50,000)堆干草。这样 John 就必须先移走一些干草堆才能将拖拉机开走。

拖拉机和干草堆都可以看作是二维平面上的点，它们的坐标都是整数，坐标范围在 1 到1000 之间。没有那堆干草的坐标和拖拉机的初始坐标一致。John 驾驶拖拉机只能沿着坐标轴的方向移动若干单位长度，比如说，他可以先朝北移动 2 个单位长度，再向东移动 3 个单位长度等等。拖拉机不能移动到干草堆所占据的点。

请你帮助 John 计算一下，最少要移动多少堆干草才能将拖拉机开会坐标原点。

输入输出格式

输入格式：

 

第一行，三个用空格隔开的整数 N、x、y，表示有N 堆干草和拖拉机的起始坐标。

第 2行到第N+1 行，每行两个用空格隔开的整数 x、y，表示每堆干草的坐标。

 

输出格式：

 

一行一个整数，表示最少要移动多少堆干草 John 才能将拖拉机开会坐标原点。

 

输入输出样例

输入样例#1： 复制

7 6 3 
6 2 
5 2 
4 3 
2 1 
7 3 
5 4 
6 4 

输出样例#1： 复制

1 


注意边界

 1 #include <cstring>
 2 #include <cstdio>
 3 #include <queue>
 4 
 5 inline void read(int &x)
 6 {
 7     x=0; register char ch=getchar();
 8     for(; ch>‘9‘||ch<‘0‘; ) ch=getchar();
 9     for(; ch>=‘0‘&&ch<=‘9‘; ch=getchar()) x=x*10+ch-‘0‘;
10 }
11 
12 const int N(1e3+5);
13 
14 struct Node {int x,y;}u,v;
15 std::queue<Node>que;
16 
17 int cost[N][N];
18 bool link[N][N],inq[N][N];
19 
20 int fx[4]={0,1,0,-1};
21 int fy[4]={1,0,-1,0};
22 
23 inline int SPFA()
24 {
25     memset(cost,127/3,sizeof(cost));
26     que.push(u); cost[u.x][u.y]=0;
27     for(; !que.empty(); )
28     {
29         u=que.front(); inq[u.x][u.y]=0; que.pop();
30         for(int i=0; i<4; ++i)
31         {
32             v.x=u.x+fx[i],v.y=u.y+fy[i];
33             if(v.x<0||v.y<0||v.x>1001||v.y>1001) continue;
34             if(cost[v.x][v.y]>cost[u.x][u.y]+link[v.x][v.y])
35             {
36                 cost[v.x][v.y]=cost[u.x][u.y]+link[v.x][v.y];
37                 if(!inq[v.x][v.y]) inq[v.x][v.y]=1,que.push(v);
38             }
39         }
40     }
41     return cost[0][0];
42 }
43 
44 int Presist()
45 {
46     int n; read(n);
47     read(u.x),read(u.y);
48     for(int x,y,i=1; i<=n; ++i)
49         read(x),read(y),link[x][y]=1;
50     printf("%d\n",SPFA());
51     return 0;
52 }
53 
54 int Aptal=Presist();
55 int main(int argc,char**argv){;}