Scaring the Birds

Problem Description
It’s harvest season now!
Farmer John plants a lot of corn. There are many birds living around his corn field. These birds keep stealing his corn all the time. John can't stand with that any more. He decides to put some scarecrows in the field to drive the birds away.
John's field can be considered as an N×N grid which has N×N intersections. John plants his corn on every intersection at first. But as time goes by, some corn were destroyed by rats or birds so some vacant intersections were left. Now John wants to put scarecrows on those vacant intersections and he can put at most one scarecrow on one intersection. Because of the landform and the different height of corn, every vacant intersections has a scaring range R meaning that if John put a scarecrow on it, the scarecrow can only scare the birds inside the range of manhattan distance R from the intersection.

The figure above shows a 7×7 field. Assuming that the scaring range of vacant intersection (4,2) is 2, then the corn on the marked intersections can be protected by a scarecrow put on intersection (4,2).
Now John wants to figure out at least how many scarecrows he must buy to protect all his corn.

Input
There are several test cases.
For each test case:
The first line is an integer N ( 2 <= N <= 50 ) meaning that John's field is an N×N grid.
The second line is an integer K ( 0<= K <= 10) meaning that there are K vacant intersections on which John can put a scarecrow.
The third line describes the position of K vacant intersections, in the format of r1,c1,r2,c2 …. rK,ck . (ri,ci) is the position of the i-th intersection and 1 <= r1,c1,r2,c2 …. rK,ck <= N.
The forth line gives the scaring range of all vacant intersections, in the format of R1,R2…RK and 0 <= R1,R2…RK <= 2 × N.
The input ends with N = 0.

Output
For each test case, print the minimum number of scarecrows farmer John must buy in a line. If John has no way to protect all the corn, print -1 instead.

Sample Input
4
2
2 2 3 3
1 3
4
2
2 2 3 3
1 4
0

Sample Output
-1
1

• 写回答

1条回答默认 最新

• threenewbee 2018-06-25 15:15
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

悬赏问题

• ¥18 深度学习tensorflow1，ssdv1，coco数据集训练一个模型
• ¥100 关于注册表摄像头和麦克风的问题
• ¥30 代码本地运行正常，但是TOMCAT部署时闪退
• ¥15 关于#python#的问题
• ¥15 主机可以ping通路由器但是连不上网怎么办
• ¥15 数据库一张以时间排好序的表中，找出多次相邻的那些行
• ¥50 关于DynamoRIO处理多线程程序时候的问题