Cells Not Under Attack
题意翻译
题目描述：
给定一个 $n \times n$ 的棋盘和 $m$ 个车以及这 $m$ 个车的坐标，问在放下第 $i$ 个车的时候，有多少个格子不会被已放下的车攻击到。
输入格式：
第 $1$ 行输入两个数 $n$ 和 $m$；
第 $2$ 行到第 $m-1$ 行，输入第 $i$ 个车的坐标 $x_{i}$ 和 $y_{i}$ 。
输出格式：
输出 $m$ 个数字，第 $i$ 个数字表示放置 $i$ 个车后不会被攻击到的格子数量。
题目描述
Vasya has the square chessboard of size $ n×n $ and $ m $ rooks. Initially the chessboard is empty. Vasya will consequently put the rooks on the board one after another.
The cell of the field is under rook's attack, if there is at least one rook located in the same row or in the same column with this cell. If there is a rook located in the cell, this cell is also under attack.
You are given the positions of the board where Vasya will put rooks. For each rook you have to determine the number of cells which are not under attack after Vasya puts it on the board.
输入输出格式
输入格式
The first line of the input contains two integers $ n $ and $ m $ ( $ 1<=n<=100000 $ , $ 1<=m<=min(100000,n^{2}) $ ) — the size of the board and the number of rooks.
Each of the next $ m $ lines contains integers $ x_{i} $ and $ y_{i} $ ( $ 1<=x_{i},y_{i}<=n $ ) — the number of the row and the number of the column where Vasya will put the $ i $ -th rook. Vasya puts rooks on the board in the order they appear in the input. It is guaranteed that any cell will contain no more than one rook.
输出格式
Print $ m $ integer, the $ i $ -th of them should be equal to the number of cells that are not under attack after first $ i $ rooks are put.
输入输出样例
输入样例 #1
3 3
1 1
3 1
2 2
输出样例 #1
4 2 0
输入样例 #2
5 2
1 5
5 1
输出样例 #2
16 9
输入样例 #3
100000 1
300 400
输出样例 #3
9999800001
说明
On the picture below show the state of the board after put each of the three rooks. The cells which painted with grey color is not under the attack.
