Transferring Pyramid

题意翻译

题意 一个n层的金字塔，你能进行两种操作。 给某个点染色，代价是3。画一个子三角形，底边必须是金字塔的底边，代价是点数+2。 现在有个黑点。要你覆盖所有黑点。 数据范围 $n,m\le 10^5$ Translated by Youngsc

题目描述

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  as shown on the picture below. An example of a pyramid at $ n=5 $ is: This data structure can perform operations of two types: 1. 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. 2. 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 v_{1} v_{2} ... v_{s}" $ , 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), $ v_{j} $ — 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<=p<=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.

输入输出格式

输入格式

The first line contains two integers $ n $ and $ k $ ( $ 1<=n,k<=10^{5} $ ). The next $ k $ lines contain the coordinates of the modified cells $ r_{i} $ and $ c_{i} $ $ (1<=c_{i}<=r_{i}<=n) $ — the row and the cell's number in the row. All cells are distinct.

输出格式

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

输入输出样例

输入样例 #1

4 5
3 1
3 3
4 1
4 3
4 4

输出样例 #1

10

输入样例 #2

7 11
2 2
3 1
4 3
5 1
5 2
5 5
6 4
7 2
7 3
7 4
7 5

输出样例 #2

26

说明

One of the possible solutions of the first sample consists of two operations: $ 2 4 v_{4} v_{7} v_{8} $ $ 2 6 v_{6} v_{9} v_{10} $ The 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: 

题意翻译

题意 一个n层的金字塔，你能进行两种操作。 给某个点染色，代价是3。画一个子三角形，底边必须是金字塔的底边，代价是点数+2。 现在有个黑点。要你覆盖所有黑点。 数据范围 $n,m\le 10^5$ Translated by Youngsc