CF1427C.The Hard Work of Paparazzi

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are a paparazzi working in Manhattan.

Manhattan has rr south-to-north streets, denoted by numbers 1,2,,r1, 2,\ldots, r in order from west to east, and rr west-to-east streets, denoted by numbers 1,2,,r1,2,\ldots,r in order from south to north. Each of the rr south-to-north streets intersects each of the rr west-to-east streets; the intersection between the xx -th south-to-north street and the yy -th west-to-east street is denoted by (x,y)(x, y) . In order to move from the intersection (x,y)(x,y) to the intersection (x,y)(x', y') you need xx+yy|x-x'|+|y-y'| minutes.

You know about the presence of nn celebrities in the city and you want to take photos of as many of them as possible. More precisely, for each i=1,,ni=1,\dots, n , you know that the ii -th celebrity will be at the intersection (xi,yi)(x_i, y_i) in exactly tit_i minutes from now (and he will stay there for a very short time, so you may take a photo of him only if at the tit_i -th minute from now you are at the intersection (xi,yi)(x_i, y_i) ). You are very good at your job, so you are able to take photos instantaneously. You know that ti<ti+1t_i < t_{i+1} for any i=1,2,,n1i=1,2,\ldots, n-1 .

Currently you are at your office, which is located at the intersection (1,1)(1, 1) . If you plan your working day optimally, what is the maximum number of celebrities you can take a photo of?

输入格式

The first line of the input contains two positive integers r,nr, n ( 1r5001\le r\le 500 , 1n100,0001\le n\le 100,000 ) – the number of south-to-north/west-to-east streets and the number of celebrities.

Then nn lines follow, each describing the appearance of a celebrity. The ii -th of these lines contains 33 positive integers ti,xi,yit_i, x_i, y_i ( 1ti1,000,0001\le t_i\le 1,000,000 , 1xi,yir1\le x_i, y_i\le r ) — denoting that the ii -th celebrity will appear at the intersection (xi,yi)(x_i, y_i) in tit_i minutes from now.

It is guaranteed that ti<ti+1t_i<t_{i+1} for any i=1,2,,n1i=1,2,\ldots, n-1 .

输出格式

Print a single integer, the maximum number of celebrities you can take a photo of.

输入输出样例

  • 输入#1

    10 1
    11 6 8

    输出#1

    0
  • 输入#2

    6 9
    1 2 6
    7 5 1
    8 5 5
    10 3 1
    12 4 4
    13 6 2
    17 6 6
    20 1 4
    21 5 4

    输出#2

    4
  • 输入#3

    10 4
    1 2 1
    5 10 9
    13 8 8
    15 9 9

    输出#3

    1
  • 输入#4

    500 10
    69 477 122
    73 186 235
    341 101 145
    372 77 497
    390 117 440
    494 471 37
    522 300 498
    682 149 379
    821 486 359
    855 157 386

    输出#4

    3

说明/提示

Explanation of the first testcase: There is only one celebrity in the city, and he will be at intersection (6,8)(6,8) exactly 1111 minutes after the beginning of the working day. Since you are initially at (1,1)(1,1) and you need 16+18=5+7=12|1-6|+|1-8|=5+7=12 minutes to reach (6,8)(6,8) you cannot take a photo of the celebrity. Thus you cannot get any photo and the answer is 00 .

Explanation of the second testcase: One way to take 44 photos (which is the maximum possible) is to take photos of celebrities with indexes 3,5,7,93, 5, 7, 9 (see the image for a visualization of the strategy):

  • To move from the office at (1,1)(1,1) to the intersection (5,5)(5,5) you need 15+15=4+4=8|1-5|+|1-5|=4+4=8 minutes, so you arrive at minute 88 and you are just in time to take a photo of celebrity 33 .
  • Then, just after you have taken a photo of celebrity 33 , you move toward the intersection (4,4)(4,4) . You need 54+54=1+1=2|5-4|+|5-4|=1+1=2 minutes to go there, so you arrive at minute 8+2=108+2=10 and you wait until minute 1212 , when celebrity 55 appears.
  • Then, just after you have taken a photo of celebrity 55 , you go to the intersection (6,6)(6,6) . You need 46+46=2+2=4|4-6|+|4-6|=2+2=4 minutes to go there, so you arrive at minute 12+4=1612+4=16 and you wait until minute 1717 , when celebrity 77 appears.
  • Then, just after you have taken a photo of celebrity 77 , you go to the intersection (5,4)(5,4) . You need 65+64=1+2=3|6-5|+|6-4|=1+2=3 minutes to go there, so you arrive at minute 17+3=2017+3=20 and you wait until minute 2121 to take a photo of celebrity 99 .

Explanation of the third testcase: The only way to take 11 photo (which is the maximum possible) is to take a photo of the celebrity with index 11 (since 21+11=1|2-1|+|1-1|=1 , you can be at intersection (2,1)(2,1) after exactly one minute, hence you are just in time to take a photo of celebrity 11 ).

Explanation of the fourth testcase: One way to take 33 photos (which is the maximum possible) is to take photos of celebrities with indexes 3,8,103, 8, 10 :

  • To move from the office at (1,1)(1,1) to the intersection (101,145)(101,145) you need 1101+1145=100+144=244|1-101|+|1-145|=100+144=244 minutes, so you can manage to be there when the celebrity 33 appears (at minute 341341 ).
  • Then, just after you have taken a photo of celebrity 33 , you move toward the intersection (149,379)(149,379) . You need 101149+145379=282|101-149|+|145-379|=282 minutes to go there, so you arrive at minute 341+282=623341+282=623 and you wait until minute 682682 , when celebrity 88 appears.
  • Then, just after you have taken a photo of celebrity 88 , you go to the intersection (157,386)(157,386) . You need 149157+379386=8+7=15|149-157|+|379-386|=8+7=15 minutes to go there, so you arrive at minute 682+15=697682+15=697 and you wait until minute 855855 to take a photo of celebrity 1010 .
首页