Ex - Snuke Panic (2D)

AtCoder

IDabc266_h

Time5000ms

Memory256MB

Difficulty—

Takahashi is trying to catch many Snuke. There are some pits in a two-dimensional coordinate plane, connected to Snuke's nest. Now, $N$ Snuke will appear from the pits. It is known that the $i$\-th Snuke will appear from the pit at coordinates $(X_i,Y_i)$ at time $T_i$, and its size is $A_i$. Takahashi is at coordinates $(0,0)$ at time $0$ and can do the following two kinds of moves. * Move at a speed of at most $1$ in the $x$\-direction (positive or negative). * Move at a speed of at most $1$ in the **positive** $y$\-direction. Moving in the negative $y$\-direction is not allowed. He can catch a Snuke appearing from a pit if and only if he is at the coordinates of that pit exactly when it appears. The time it takes to catch a Snuke is negligible. Find the maximum sum of the sizes of Snuke that Takahashi can catch by moving optimally. ## Constraints * $1 \leq N \leq 10^5$ * $1 \leq T_i \leq 10^9$ * $0 \leq X_i,Y_i \leq 10^9$ * $1 \leq A_i \leq 10^9$ * The triples $(T_i,X_i,Y_i)$ are distinct. * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $T_1$ $X_1$ $Y_1$ $A_1$ $T_2$ $X_2$ $Y_2$ $A_2$ $\vdots$ $T_N$ $X_N$ $Y_N$ $A_N$ [samples]

Samples

Input #1

Output #1

101

The optimal strategy is as follows.

*   Wait at coordinates $(0,0)$ to catch the first Snuke at time $1$.
*   Go to coordinates $(3,1)$ to catch the third Snuke at time $5$.

It is impossible to catch both the first and second Snuke, so this is the best he can.

Input #2

2
100 0 1 1
200 1 0 10

Output #2

10

Moving in the negative $y$\-direction is not allowed, so he cannot catch the first Snuke and then the second.

Input #3

10
797829355 595605750 185676190 353195922
913575467 388876063 395940406 533206504
810900084 201398242 159760440 87027328
889089200 220046203 85488350 325976483
277429832 161055688 73308100 940778720
927999455 429014248 477195779 174616807
673419335 415891345 81019893 286986530
989248231 147792453 417536200 219371588
909664305 22150727 414107912 317441890
988670052 140275628 468278658 67181740

Output #3

1553741733

API Response (JSON)

{
  "problem": {
    "name": "Ex - Snuke Panic (2D)",
    "description": {
      "content": "Takahashi is trying to catch many Snuke. There are some pits in a two-dimensional coordinate plane, connected to Snuke's nest. Now, $N$ Snuke will appear from the pits. It is known that the $i$\\-th Sn",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 5000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc266_h"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi is trying to catch many Snuke.\nThere are some pits in a two-dimensional coordinate plane, connected to Snuke's nest.\nNow, $N$ Snuke will appear from the pits. It is known that the $i$\\-th Sn...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments