Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
1 #include <iostream> 2 #include <cstring> 3 #include <string> 4 #include <cstdio> 5 #include <algorithm> 6 using namespace std; 7 int e[105][105]; 8 int d[105]; 9 bool v[105]; 10 int main() 11 { 12 int n, i, j; 13 while (cin >> n) 14 { 15 for (i = 1; i <= n; i++) 16 { 17 for (j = 1; j <= n; j++) 18 { 19 cin >> e[i][j]; 20 } 21 } 22 for (i = 1; i <= n; i++) 23 { 24 d[i] = e[1][i]; 25 } 26 memset(v, 0, sizeof(v)); 27 v[1] = 1; 28 int s = 0; 29 for (i = 1; i <= n - 1; i++) 30 { 31 int k = -1; 32 int mi = 99999999; 33 for (j = 1; j <= n; j++) 34 { 35 if (!v[j] && d[j] <= mi) 36 { 37 mi = d[j]; 38 k = j; 39 } 40 } 41 if (k == -1) break; 42 v[k] = 1; 43 s = s + d[k]; 44 for (j = 1; j <= n; j++) 45 { 46 if (!v[j] && d[j] > e[k][j])//这一步和dijkstra不太同,不是d[j]>d[k]+e[k][j] 47 { 48 d[j] = e[k][j]; 49 } 50 } 51 } 52 cout << s << endl; 53 } 54 return 0; 55 }
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
1 #include <iostream> 2 #include <cstring> 3 #include <string> 4 #include <cstdio> 5 #include <algorithm> 6 using namespace std; 7 int e[105][105]; 8 int d[105]; 9 bool v[105]; 10 int main() 11 { 12 int n, i, j; 13 while (cin >> n) 14 { 15 for (i = 1; i <= n; i++) 16 { 17 for (j = 1; j <= n; j++) 18 { 19 cin >> e[i][j]; 20 } 21 } 22 for (i = 1; i <= n; i++) 23 { 24 d[i] = e[1][i]; 25 } 26 memset(v, 0, sizeof(v)); 27 v[1] = 1; 28 int s = 0; 29 for (i = 1; i <= n - 1; i++) 30 { 31 int k = -1; 32 int mi = 99999999; 33 for (j = 1; j <= n; j++) 34 { 35 if (!v[j] && d[j] <= mi) 36 { 37 mi = d[j]; 38 k = j; 39 } 40 } 41 if (k == -1) break; 42 v[k] = 1; 43 s = s + d[k]; 44 for (j = 1; j <= n; j++) 45 { 46 if (!v[j] && d[j] > e[k][j])//这一步和dijkstra不太同,不是d[j]>d[k]+e[k][j] 47 { 48 d[j] = e[k][j]; 49 } 50 } 51 } 52 cout << s << endl; 53 } 54 return 0; 55 }