一般图最大匹配 - Problem

#899. 一般图最大匹配

Statistics

题目修改自 Library Checker。

给定一张 $N$ 个点 $M$ 条边的无向图，第 $i$ 条边为 $(u_i, v_i)$。你需要求最大匹配。

输入格式

$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}$

样例数据

样例 1 输入

样例 1 输出

样例 2 输入

样例 2 输出

1
0 1

子任务

$1 \leq N \leq 500$, $0 \leq M \leq \frac{N(N-1)}{2}$, $0 \leq u_i, v_i < N$

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0