3454.Transferring Pyramid

Time Limit: 1s Memory Limit: 256MB

Vasya and Petya are using an interesting data storing structure: a pyramid.The pyramid consists of n rows, the i-th row contains i cells. Each row is shifted half a cell to the left relative to the previous row. The cells are numbered by integers from 1 to 3454_1.png as shown on the picture below.An example of a pyramid at n=5 is: 3454_2.png This data structure can perform operations of two types: Change the value of a specific cell. It is described by three integers: "t i v", where t=1 (the type of operation), i - the number of the cell to change and v the value to assign to the cell. Change the value of some subpyramid. The picture shows a highlighted subpyramid with the top in cell 5. It is described by s+2 numbers: "t i v1 v2 ... vs", where t=2, i - the number of the top cell of the pyramid, s - the size of the subpyramid (the number of cells it has), vj - the value you should assign to the j-th cell of the subpyramid. Formally: a subpyramid with top at the i-th cell of the k-th row (the 5-th cell is the second cell of the third row) will contain cells from rows from k to n, the (k+p)-th row contains cells from the i-th to the (i+p)-th (0 \le p \le n-k).Vasya and Petya had two identical pyramids. Vasya changed some cells in his pyramid and he now wants to send his changes to Petya. For that, he wants to find a sequence of operations at which Petya can repeat all Vasya's changes. Among all possible sequences, Vasya has to pick the minimum one (the one that contains the fewest numbers).You have a pyramid of n rows with k changed cells. Find the sequence of operations which result in each of the k changed cells being changed by at least one operation. Among all the possible sequences pick the one that contains the fewest numbers.

Input Format(From the terminal/stdin)

Input The first line contains two integers n and k (1 \le n,k \le 105).The next k lines contain the coordinates of the modified cells ri and ci (1 \le ci \le ri \le n) - the row and the cell's number in the row. All cells are distinct.

Output Format(To the terminal/stdout)

Output Print a single number showing how many numbers the final sequence has.

Sample Input 1

Copy
4 5
3 1
3 3
4 1
4 3
4 4
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n

Sample Output 1

Copy
10
  \n

Sample Input 2

Copy
7 11
2 2
3 1
4 3
5 1
5 2
5 5
6 4
7 2
7 3
7 4
7 5
 ·  \n
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n
 · \n

Sample Output 2

Copy
26
  \n

Hints

One of the possible solutions of the first sample consists of two operations:2 4 v4 v7 v82 6 v6 v9 v10The picture shows the changed cells color-highlighted. The subpyramid used by the first operation is highlighted blue and the subpyramid used by the first operation is highlighted yellow: 3454_3.png

Submit

请先 登录

© 2025 FAQs