【洛谷2017】【USACO09DEC】晕牛Dizzy Cows

最新推荐文章于 2024-05-06 20:42:44 发布

dcx2001

最新推荐文章于 2024-05-06 20:42:44 发布

阅读量802

点赞数 1

分类专栏：拓扑排序文章标签：拓扑排序

本文链接：https://blog.csdn.net/dcx2001/article/details/77940699

版权

农夫约翰要将农场的双向牛道改为单向，以消除循环，防止奶牛眩晕。你需要确定所有双向道路的方向，确保最终无循环。输入包含点数、有向边和无向边数量，以及具体的边信息。输出定向后的结果。

摘要由CSDN通过智能技术生成

题目背景

Hzwer 神犇最近又征服了一个国家，然后接下来却也遇见了一个难题。

题目描述

The cows have taken to racing each other around the farm but they get very dizzy when running in circles, and everyone knows that dizzy cows don't produce any milk. Farmer John wants to convert all of the two-way cow paths in the farm to one-way paths in order to eliminate any 'cycles' and prevent the cows from getting dizzy. A 'cycle' enables a cow to traverse one or more cow paths and arrive back at her starting point, thus completing a loop or circle.

The farm comprises N pastures (1 <= N <= 100,000) conveniently numbered 1..N. M1 (1 <= M1 <= 100,000) one-way cow paths and M2 two-way cow paths (1 <= M2 <= 100,000) connect the pastures. No path directly connects a pasture to itself, although multiple paths might connect two different pastures. A cow may or may not be able to travel between any two given pastures by following a sequence of cow paths.

Your job is to assign a direction to the two-way cow