1037D.md (2280B)
1 Source: https://codeforces.com/problemset/problem/1037/D 2 3 D. Valid BFS? 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 The [BFS](https://en.wikipedia.org/wiki/Breadth-first_search) algorithm is defined as follows. 22 23 1. Consider an undirected graph with vertices numbered from $1$ to $n$. Initialize $q$ as a new [queue](http://gg.gg/queue_en) containing only vertex $1$, mark the vertex $1$ as used. 24 2. Extract a vertex $v$ from the head of the queue $q$. 25 3. Print the index of vertex $v$. 26 4. Iterate in arbitrary order through all such vertices $u$ that $u$ is a neighbor of $v$ and is not marked yet as used. Mark the vertex $u$ as used and insert it into the tail of the queue $q$. 27 5. If the queue is not empty, continue from step 2. 28 6. Otherwise finish. 29 30 Since the order of choosing neighbors of each vertex can vary, it turns out that there may be multiple sequences which BFS can print. 31 32 In this problem you need to check whether a given sequence corresponds to some valid BFS traversal of the given tree starting from vertex $1$. The [tree](http://gg.gg/tree_en) is an undirected graph, such that there is exactly one simple path between any two vertices. 33 34 Input 35 36 The first line contains a single integer $n$ ($1 \le n \le 2 \cdot 10^5$) which denotes the number of nodes in the tree. 37 38 The following $n - 1$ lines describe the edges of the tree. Each of them contains two integers $x$ and $y$ ($1 \le x, y \le n$) — the endpoints of the corresponding edge of the tree. It is guaranteed that the given graph is a tree. 39 40 The last line contains $n$ distinct integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le n$) — the sequence to check. 41 42 Output 43 44 Print "Yes" (quotes for clarity) if the sequence corresponds to some valid BFS traversal of the given tree and "No" (quotes for clarity) otherwise. 45 46 You can print each letter in any case (upper or lower). 47 48 Examples 49 50 Input 51 52 ``` 53 4 54 1 2 55 1 3 56 2 4 57 1 2 3 4 58 ``` 59 60 Output 61 62 ``` 63 Yes 64 ``` 65 66 Input 67 68 ``` 69 4 70 1 2 71 1 3 72 2 4 73 1 2 4 3 74 ``` 75 76 Output 77 78 ``` 79 No 80 ``` 81 82 Note 83 84 Both sample tests have the same tree in them. 85 86 In this tree, there are two valid BFS orderings: 87 88 * $1, 2, 3, 4$, 89 * $1, 3, 2, 4$. 90 91 The ordering $1, 2, 4, 3$ doesn't correspond to any valid BFS order.