|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||0||0||0||0.000%|
If you have ever compiled C++ projects using the command line, you are familiar with the linker. If you want to use two static libraries
liba.a relies on
libb.a, you need to put
libb.a in your command, for example, "
g++ -o my my.cpp liba.a libb.a".
What if both
libb.a rely on each other? You need to add their names to the command several times, as in "
g++ -o my my.cpp liba.a libb.a liba.a". Formally, if you want to use two libraries
liba.a relies on
libb.a, there must be at least one
liba.a in your command which occurs before one of the occurrences of
Now, Rikka is working on her C++ project, and there are $n$ static libraries she will use. There are $m$ pairs of dependency relationships. A pair $(i, j)$ means that the $i$-th library relies on the $j$-th library.
You know, a complicated command will never bring happiness. So Rikka wants to simplify the compile command. Specifically, Rikka wants to make the number of the names of static libraries in her compile command as small as possible. Help her find this number.
The first line contains a single integer $t$ ($1 \leq t \leq 10^3$), the number of test cases.
The first line of each test case contains two integers $n$ and $m$ ($1 \leq n \leq 18$, $0 \leq m \leq n \cdot (n-1)$).
Then $m$ lines follow, each line contains two integers $a$ and $b$ ($1 \leq a, b \leq n$, $a \neq b$) and describes a dependency relationship: library $a$ relies on library $b$.
It is guaranteed that each dependency relationship will occur at most once, and there are at most $20$ test cases with $n > 12$.
For each test case, output a single line with a single integer: the minimum possible number of library names in Rikka's compile command.
3 3 2 1 2 2 3 3 3 1 2 2 3 3 1 5 7 1 2 2 3 3 5 5 4 4 2 2 5 3 1
3 4 6