Ural 1982 electrification plan (prim minimal spanning tree)

Obviously, the Minimum Spanning Tree template generates multiple questions.

[CPP] View plaincopy

2. # Include <bits/stdc ++. h>
4. UsingNamespace STD;
6. Int N, K,;
8. Int Dist [120], M [120] [120];
10. Bool P [120];
12. Void prim ()
14. {
16. For (Int I = 1; I <= N; I ++)
18. {
20. If (! P [I])
22. {
24. Int min = 100020;
26. For (Int J = 1; j <= N; j ++)
28. {
30. If (P [J] & M [I] [J] <min)
32. Min = m [I] [J];
34. }
36. Dist [I] = min;
38. }
40. }
42. For (Int I = 1; I <= n-k; I ++)
44. {
46. Int min = int_max, K = 0;
48. For (Int J = 1; j <= N; j ++)
50. {
52. If (! P [J] & Dist [J] <min)
54. {
56. Min = DIST [J];
58. K = J;
60. }
62. }
64. If (k = 0)
66. Return;
68. P [k] =True;
70. For (Int J = 1; j <= N; j ++)
72. {
74. If (! P [J] & Dist [J]> M [k] [J])
76. Dist [J] = m [k] [J];
78. }
80. }
82. }
84. Int main ()
86. {
88. Memset (p,False,Sizeof (p ));
90. Scanf ("% D", & N, & K );
92. For (Int I = 1; I <= K; I ++)
94. {
96. Scanf ("% D", & );
98. Dist [a] = 0;
100. P [a] =True;
102. }
104. For (Int I = 1; I <= N; I ++)
106. For (Int J = 1; j <= N; j ++)
108. Scanf ("% D", & M [I] [J]);
110. Prim ();
112. Int sum = 0;
114. For (Int I = 1; I <= N; I ++)
116. Sum + = DIST [I];
118. Printf ("% D \ n", sum );
120. Return 0;
122. }