原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Problem A
From D to E and back
Input: Standard Input
Output: Standard Output
Anyone who goes to a psychiatrist ought to have his head examined.
Samuel Goldwyn
Take any directed graph D with n vertices and m edges. You can make the Lying graph E of D in the
following way. E wi l have m vertices, one for each edge of D. For example, if D has an edge uv, then E wi l
have a vertex ca led uv. Now, whenever Dhas edges uv and vw, E wi l have an edge from vertex uv to
vertex vw. There are no other edges in E.
You wi l be given a graph E and wi l have to determine whether it is possible for E to be the Lying graph of
some directed graph D.
Input
The first line of input gives the number of cases, N (N220). N test cases follow. Each one starts with two
lines containing m (0≤m≤300)and k. The next k lines wi l each contain a pair of vertices, x and y, meaning
that there is an edge from x to y in E. The vertices are numbered from 0 to m-1
Output
For each test case, output one line containing Case #x: followed by either Yes or No, depending on
whether E is a valid Lying graph or not. Note that D is a lowed to have duplicate edges and self-edges.
Sample Input Output for Sample Input
4 Case #1: Yes
2 Case #2: Yes
1 Case #3: No
0 1 Case #4: Yes
5
0
4
3
0 1
2 1
2 3
3
9
0 1
0 2
1 2
1 0
2 0
2 1
0 0
1 1
2 2
Problem setter: Igor niouk
Special Thanks: Joachim Wulff
2014 年 7 月9 日UVaOnli
文档评论（0）