URAL 1280. Topological Sorting

1. 题目


1280. Topological Sorting

Time limit: 1.0 second
Memory limit: 64 MB
Michael wants to win the world championship in programming and decided to study N subjects (for convenience we will number these subjects from 1 to N). Michael has worked out a study plan for this purpose. But it turned out that certain subjects may be studied only after others. So, Michael’s coach analyzed all subjects and prepared a list of M limitations in the form “si ui” (1 ≤ si, uiN; i = 1, 2, …, M), which means that subject si must be studied before subject ui.
Your task is to verify if the order of subjects being studied is correct.
Remark. It may appear that it’s impossible to find the correct order of subjects within the given limitations. In this case any subject order worked out by Michael is incorrect.
1 ≤ N ≤ 1000; 0 ≤ M ≤ 100000.


The first line contains two integers N and M (N is the number of the subjects, M is the number of the limitations). The nextM lines contain pairs si, ui, which describe the order of subjects: subject si must be studied before ui. Further there is a sequence of N unique numbers ranging from 1 to N — the proposed study plan.


Output a single word “YES” or “NO”. “YES” means that the proposed order is correct and has no contradictions with the given limitations. “NO” means that the order is incorrect.


input output
Problem Author: © Sergey G. Volchenkov, 2003(volchenkov@yandex.ru); Vladimir N. Pinaev, 2003(vpinaev@mail.ru; http://www.pic200x.chat.ru); Michael Y. Kopachev, 2003 (mkopachev@krista.ru).
Problem Source: 2003-2004 ACM Central Region of Russia Quarterfinal Programming Contest, Rybinsk, October 15-16, 2003

2. 思路



下面的代码中,需要判断的学习计划使用数组 plan[] 存储,并为 plan[] 建立了一个由数据到索引的查找表 lut[] ,使得 lut[plan[i]] = i 。对于课程 s[i] 和 u[i] ,要求 s[i] 在 u[i] 前修完,则需要满足 lut[s[i]] < lut[u[i]] ,否则所给学习计划就不满足要求。

3. 代码