From 17ac94f962dca3fd20d6c57be7fca30fa5e32c69 Mon Sep 17 00:00:00 2001
From: cyp0633 <cyp0633@gmail.com>
Date: Fri, 30 Jul 2021 08:40:01 +0800
Subject: [PATCH] =?UTF-8?q?CSP=205-7=20valid=20=E6=9C=89=E6=95=88=E7=9A=84?=
 =?UTF-8?q?BFS=20AC=20on=20both=20CG=20and=20Codeforces?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 CSP-Training/5/7-valid.cpp | 15 ++++++---------
 1 file changed, 6 insertions(+), 9 deletions(-)

diff --git a/CSP-Training/5/7-valid.cpp b/CSP-Training/5/7-valid.cpp
index 0543859..92be5f8 100644
--- a/CSP-Training/5/7-valid.cpp
+++ b/CSP-Training/5/7-valid.cpp
@@ -45,21 +45,18 @@ int main()
             }
         }
         childNum = childSet.size();
-        for (int i = 0; i < childNum; i++) //或许并不应该这样做？
+        for (int i = 0; i < childNum; i++)
         {
-            it = find(G[currPos].begin(), G[currPos].end(), reqSeq.front());
-            if (it != G[currPos].end()) //存在此儿子
-            {
-                visitSeq.emplace(reqSeq.front());
-                reqSeq.pop();
-            }
-            else
+            set<int>::iterator it = childSet.find(reqSeq.front());
+            if (it == childSet.end())
             {
                 printf("No");
                 return 0;
             }
-            childSet.clear(); //清空儿子集合
+            visitSeq.emplace(reqSeq.front());
+            reqSeq.pop();
         }
+        childSet.clear(); //清空儿子集合
     }
     printf("Yes");
     return 0;