Codeforces Round #364 (Div. 2) B. Cells Not Under Attack

B. Cells Not Under Attack

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.
Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 100 000, 1 ≤ m ≤ min(100 000, n2)) — the size of the board and the number of rooks.

Each of the next m lines contains integers xi and yi (1 ≤ xi, yi ≤ 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.
Examples
Input

3 3
1 1
3 1
2 2

Output

4 2 0

Input

5 2
1 5
5 1

Output

16 9

Input

100000 1
300 400

Output

9999800001

Note

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.

题意：给你一个$n*m$的地图，然后放置棋子，然后问你剩下的空位中有多少个位置可以放置东西，要求不能和已经放置的棋子同一排或者同一列。

思路：对每一行和每一列进行标记，然后记录剩下的行和列，直接相乘即为结果。

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0x7fffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
#define eps 1e-8
using namespace std;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
double dpow(double a,ll b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
//head
int h[MAXN],l[MAXN];
int main()
{
    ll n,m;scanf("%I64d%I64d",&n,&m);
    mem(h);mem(l);ll H=n,L=n;
    for(int i=1;i<=m;i++)
    {
        int a,b;scanf("%d%d",&a,&b);
        if(h[a]==0) h[a]=1,H--;
        if(l[b]==0) l[b]=1,L--;
        ll ans=H*L;
        printf("%I64d\n",ans);
    }
    return 0;
}