Cells Not Under Attack

最新推荐文章于 2026-06-08 09:54:20 发布

原创最新推荐文章于 2026-06-08 09:54:20 发布 · 505 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #思维

codeforces 专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种算法解决棋盘放置车后计算未受攻击格子数量的问题。通过跟踪每行每列是否放置了车，并更新未受攻击格子数量，实现高效计算。

Description

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 arenot under attack after Vasya puts it on the board.

Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 100 000, 1 ≤ m ≤ min(100 000, n²)) — 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.

Output

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.

Sample Input

Input

Output

4 2 0

Input

5 2
1 5
5 1

Output

16 9

Input

100000 1
300 400

Output

9999800001

题意：你在一个方格里放一个棋子，那末它的这一行和这一列都会被攻击，让你求再放入n个棋子后，没有被攻击的方格个数。

思路：看得百度，易知一共有n*n个方格，每次你碰到棋子就减去它这一行和这一列没有被攻击的方格数。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define size 1000009
using namespace std;
typedef long long LL;
int a[size],b[size];
LL c[size];
int main()
{
	int n,m,i,x,y;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		LL sum=(LL)n*n;
		memset(a,0,sizeof(0));
		memset(b,0,sizeof(b));
		int dx=0,dy=0;
		for(i=0;i<m;i++)
		{
			scanf("%d%d",&x,&y);
			if(!a[x])
			{
				sum-=n-dy;//可能迷惑为啥要用n去减去dy，你可以去画少一点的表格试试，便会理解。

				a[x]=1;
				dx++;

			}
			if(!b[y])
			{
				sum-=n-dx;
				b[y]=1;
				dy++;
			}
			c[i]=sum;
		}
		for(i=0;i<m;i++)
		if(i!=m-1)
		printf("%lld ",c[i]);
		else
		printf("%lld\n",c[i]);
	}
	return 0;
}