As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定一张二分图，二分图的左部点编号为 $1 \sim L$，右部点编号为 $1 \sim R$。
有 $M$ 条边，第 $i$ 条边连接连接了左侧第 $a_i$ 个点与右侧第 $b_i$ 个点。
找出该二分图的一个最大匹配。
输入的第一行包含三个整数 $L$, $R$, $M$。
接下来 $M$ 行，每行两个整数 $a_i, b_i$，描述一条边。图中可能存在重边。
输出的第一行包含一个整数 $k$，表示最大匹配的大小。
接下来 $K$ 行，每行两个整数 $c_i$, $d_i$，表示将左侧第 $c_i$ 个点匹配到右侧第 $d_i$ 个点。
如果有多种合法方案，你可以输出任意一种。
3 2 3
1 1
2 2
3 22
1 1
3 2对于所有数据，$1 \le L, R \le 2 \cdot 10^5$，$1 \le M \le 6 \cdot 10^5$，$1 \le a_i \le L$，$1 \le b_i \le R$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: