diff --git a/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140.md b/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140.md
index 27304ac..6379be0 100644
--- a/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140.md
+++ b/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140.md
@@ -56,6 +56,9 @@ bool st[N];
 int res;
 
 int prim() {
+    memset(dis, 0x3f, sizeof dis);
+    dis[1] = 0;
+
     for (int i = 0; i < n; i++) { // 迭代n次
         int t = -1;
         for (int j = 1; j <= n; j++)
@@ -75,7 +78,6 @@ int main() {
     cin >> n;
     // 初始化
     memset(g, 0x3f, sizeof g);
-    memset(dis, 0x3f, sizeof dis);
 
     for (int i = 1; i <= n; i++)
         for (int j = 1; j <= n; j++)
diff --git a/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140_Prim.cpp b/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140_Prim.cpp
index 7b4c974..60c0f7e 100644
--- a/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140_Prim.cpp
+++ b/TangDou/AcWing_TiGao/T3/MinialSpanningTree/1140_Prim.cpp
@@ -11,6 +11,9 @@ bool st[N];
 int res;
 
 int prim() {
+    memset(dis, 0x3f, sizeof dis);
+    dis[1] = 0;
+
     for (int i = 0; i < n; i++) { // 迭代n次
         int t = -1;
         for (int j = 1; j <= n; j++)
@@ -30,7 +33,6 @@ int main() {
     cin >> n;
     // 初始化
     memset(g, 0x3f, sizeof g);
-    memset(dis, 0x3f, sizeof dis);
 
     for (int i = 1; i <= n; i++)
         for (int j = 1; j <= n; j++)
diff --git a/TangDou/Topic/【最小生成树】专题.md b/TangDou/Topic/【最小生成树】专题.md
index 06ad61e..b50aae0 100644
--- a/TangDou/Topic/【最小生成树】专题.md
+++ b/TangDou/Topic/【最小生成树】专题.md
@@ -29,6 +29,10 @@ int pre[N];  // 前驱结点
 
 // 普利姆算法求最小生成树
 int prim() {
+    memset(dis, 0x3f, sizeof dis);
+    memset(pre, -1, sizeof pre); // 记录前驱路径
+    dis[1] = 0;
+
     for (int i = 0; i < n; i++) { // 迭代n次
         int t = -1;
         for (int j = 1; j <= n; j++)
@@ -48,8 +52,6 @@ int prim() {
 int main() {
     cin >> n >> m;
     memset(g, 0x3f, sizeof g);
-    memset(dis, 0x3f, sizeof dis);
-    memset(pre, -1, sizeof pre); // 记录前驱路径
 
     // 读入数据
     while (m--) {