CF1415F.Cakes for Clones

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You live on a number line. You are initially (at time moment $t = 0$ ) located at point $x = 0$ . There are $n$ events of the following type: at time $t_i$ a small cake appears at coordinate $x_i$ . To collect this cake, you have to be at this coordinate at this point, otherwise the cake spoils immediately. No two cakes appear at the same time and no two cakes appear at the same coordinate.

You can move with the speed of $1$ length unit per one time unit. Also, at any moment you can create a clone of yourself at the same point where you are located. The clone can't move, but it will collect the cakes appearing at this position for you. The clone disappears when you create another clone. If the new clone is created at time moment $t$ , the old clone can collect the cakes that appear before or at the time moment $t$ , and the new clone can collect the cakes that appear at or after time moment $t$ .

Can you collect all the cakes (by yourself or with the help of clones)?

输入格式

The first line contains a single integer $n$ ( $1 \le n \le 5000$ ) — the number of cakes.

Each of the next $n$ lines contains two integers $t_i$ and $x_i$ ( $1 \le t_i \le 10^9$ , $-10^9 \le x_i \le 10^9$ ) — the time and coordinate of a cake's appearance.

All times are distinct and are given in increasing order, all the coordinates are distinct.

输出格式

Print "YES" if you can collect all cakes, otherwise print "NO".

输入输出样例

输入#1
```
3
2 2
5 5
6 1
```
输出#1
```
YES
```
输入#2
```
3
1 0
5 5
6 2
```
输出#2
```
YES
```
输入#3
```
3
2 1
5 5
6 0
```
输出#3
```
NO
```

说明/提示

In the first example you should start moving towards $5$ right away, leaving a clone at position $1$ at time moment $1$ , and collecting the cake at position $2$ at time moment $2$ . At time moment $5$ you are at the position $5$ and collect a cake there, your clone collects the last cake at time moment $6$ .

In the second example you have to leave a clone at position $0$ and start moving towards position $5$ . At time moment $1$ the clone collects a cake. At time moment $2$ you should create a new clone at the current position $2$ , it will collect the last cake in future. You will collect the second cake at position $5$ .

In the third example there is no way to collect all cakes.

首页