Cell Not Under Attack(Codeforces 701B)(Codeforces Round#364 Div2 B)

http://www.codeforces.com/problemset/problem/701/B

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 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, 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

题目的意思是有n*n(1<=n<=100000)的棋盘，现在放置m(1<=m<<min(100000,n^2))个棋子，每个棋子的攻击范围是与它在同一行或者同一列的所有格子，输出放置第i(1<=i<=m)个棋子后不在被攻击范围内的格子的个数。set(集合)是标准模板库里已经封装的类，集合的特点是无重复元素，因此在插入时如果是重复元素，就不会插入，否则插入。记a、b分别是放置棋子横坐标、纵坐标的集合，则a.size()表示在被攻击范围内格子所占的行数、b.size()表示在被攻击范围内格子所占的个数。则不在攻击范围内格子的个数是n^2-(n*a.size()+n*b.size()-a.size()*b.size())=(n-a.size())*(n-b.size())。

#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
typedef long long ll;
set<ll> a,b;
int main()
{
    ll n,m,x,y;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        a.insert(x);
        b.insert(y);
        cout<<(n-a.size())*(n-b.size())<<" ";
    }
    return 0;
}
下面是我自己写的代码，其中dp[i][0]与a.size()一样，dp[i][1]与b.size()一样，不知道为什么没通过第三个样例。。。

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1e5+5;
int x[maxn];
int y[maxn];
int dp[maxn][2];
int main()
{
    x[0]=0;y[0]=0;
    int n,m;
    cin>>n>>m;
    dp[0][0]=n;dp[0][1]=n;
    for(int i=1;i<=m;i++){
        cin>>x[i]>>y[i];
        if(x[i]==x[i-1]){
            dp[i][0]=dp[i-1][0];
        }
        else {
            dp[i][0]=dp[i-1][0]-1;
        }
        if(y[i]==y[i-1]){
            dp[i][1]=dp[i-1][1];
        }
        else{
            dp[i][1]=dp[i-1][1]-1;
        }
    }
    if(m==1) cout<<(n-1)*(n-1);
    else{
        int ans;
        for(int i=1;i<m;i++){
            ans=dp[i][0]*dp[i][1];
            cout<<ans<<" ";
        }
        ans=dp[m][0]*dp[m][1];
        cout<<ans;
    }
    return 0;
}