문제1853--Asteroids

1853: Asteroids

실행시간 제한: 1 Sec  메모리사용 제한: 64 MB
제출: 48  통과: 21
[제출] [채점기록] [묻고답하기]

문제 설명

Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid.

Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids in any given row or column of the grid with a single shot.This weapon is quite expensive, so she wishes to use it sparingly.Given the location of all the asteroids in the field, find the minimum number of shots Bessie needs to fire to eliminate all of the asteroids.

입력 설명

* Line 1: Two integers N and K, separated by a single space.
* Lines 2..K+1: Each line contains two space-separated integers R and C (1 <= R, C <= N) denoting the row and column coordinates of an asteroid, respectively.

출력 설명

* Line 1: The integer representing the minimum number of times Bessie must shoot.

입력 예시 Copy

3 4
1 1
1 3
2 2
3 2


출력 예시 Copy

2