CF687E.TOF

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The first line of the input contains two integers $n$ and $m$ ( $1<=n,m<=5000$ ) — the number of vertices and then number of directed edges in the input graph.

Each of the next $m$ lines contains a pair of integers $u_{i}$ and $v_{i}$ ( $1<=u_{i},v_{i}<=n$ ), meaning there is a directed edge in the input graph.

You may assume that the graph won't contain any self-loops and there is at most one edge between any unordered pair of vertices.

输入格式

Print a single integer — the minimum possible number of dfs calls that can be achieved with permuting the edges.

输出格式

无

输入输出样例

输入#1
```
3 3
1 2
2 3
3 1
```
输出#1
```
2998
```
输入#2
```
6 7
1 2
2 3
3 1
3 4
4 5
5 6
6 4
```
输出#2
```
3001
```

首页