Given a simple undirected graph with $N$ vertices and $M$ edges. $i$-th edge is $(u_ i, v_ i)$.
Calculate the maximum matching.
$N$ $M$
$u_ 0$ $v_ 0$
$u_ 1$ $v_ 1$
:
$u_ {M - 1}$ $v_ {M - 1}$
$X$
$a_ 0$ $b_ 0$
$a_ 1$ $b_ 1$
:
$a_ {X - 1}$ $b_ {X - 1}$
$X$ is the size of the maximum matching.
7 8 2 0 0 5 5 6 6 1 1 0 1 3 3 4 1 4
3 0 2 1 6 3 4
5 4 0 1 0 2 0 3 0 4
1 0 1
| No. | Testdata Range | Score |
|---|