영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There are n cities with airports but no flight connections. You are given m requests which routes should be possible to travel.
Your task is to determine the minimum number of one-way flight connections which makes it possible to fulfil all requests.
Input
The first input line has two integers n and m: the number of cities and requests. The cities are numbered 1,2,…,n.
After this, there are m lines describing the requests. Each line has two integers a and b: there has to be a route from city a to city b. Each request is unique.
Output
Print one integer: the minimum number of flight connections.
Constraints
- 1 ≤ n ≤ 10^5
- 1 ≤ m ≤ 2 · 10^5
- 1 ≤ a, b ≤ n
Example
Explanation: You can create the connections 1 → 2, 2 → 3, 2 → 4 and 3 → 1. Then you can also fly from city 3 to city 4 using the route 3 → 1 → 2 → 4.
예제
예제 1
4 5 1 2 2 3 2 4 3 1 3 4
4