选图 - 题目

#6270. 选图

统计

此題目在以下比賽中使用過：

Elegia's Forgotten Hill

This problem is prepared by Elegia .

给定一个 $kn$ 个顶点的无向简单图，保证每个点的度数小于 $kd$。

请你求出一个 $n$ 个点的子集，使得导出子图的每个点度数均小于 $d$。

输入格式

第一行输入四个正整数 $k,n,d,m$。

接下来 $m$ 行每行输入两个正整数 $u,v$ 表示一条边。

输出格式

输出 $n$ 个互不相同的 $1\sim kn$ 间的正整数，表示所选点集。

样例数据

样例输入

样例输出

3 4 5

提示

对于 $100\%$ 的数据，保证 $2\leq k\leq 10$，$1\leq d\leq 10$，$1\leq n\leq 10^3$，$m\leq \frac{k(k-1)}2dn$。

对于数据点 $1\sim 2$，$kn\leq 20$。

对于数据点 $3\sim 5$，$d=1$。

对于数据点 $6\sim 8$，$k=2$。

对于数据点 $9\sim 10$，无特殊限制。

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