QOJ.ac

QOJ

Time Limit: 2.5 s Memory Limit: 512 MB Total points: 100

#8461. 绝目编诗

Statistics

给出一个简单无向图,判断是否存在两个长度相同的简单环。

输入格式

第一行两个正整数 $n$, $m$ 表示点数和边数。

接下来 $m$ 行每行两个正整数描述一条边。

输出格式

若存在,输出 Yes;否则,输出 No

样例数据

样例 1 输入

10000 0

样例 1 输出

No

样例 2 输入

5 6
1 2
2 3
3 1
1 4
4 5
5 1

样例 2 输出

Yes

子任务

对于所有测试数据,$1\le n \le 10^4$,$1\le m \le 10^6$。

子任务编号 $n\leq$ 分值
$1$ $10$ $40$
$2$ $20$ $20$
$3$ $400$ $20$
$4$ $10000$ $20$
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:

  1. 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.
  2. 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.
  3. Issues must be filed in English or Chinese only.
  4. 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

No issues in this category.