hud-1301-Jungle Roads-最小生成树-java
来源:互联网 发布:淘宝客订单接口 编辑:程序博客网 时间:2024/05/28 20:18
Jungle Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8444 Accepted Submission(s): 6224
Problem Description
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A through I in the maps above. The map on the right shows the roads that could be maintained most cheaply, for 216 aacms per month. Your task is to write a program that will solve such problems.
The input consists of one to 100 data sets, followed by a final line containing only 0. Each data set starts with a line containing only a number n, which is the number of villages, 1 < n < 27, and the villages are labeled with the first n letters of the alphabet, capitalized. Each data set is completed with n-1 lines that start with village labels in alphabetical order. There is no line for the last village. Each line for a village starts with the village label followed by a number, k, of roads from this village to villages with labels later in the alphabet. If k is greater than 0, the line continues with data for each of the k roads. The data for each road is the village label for the other end of the road followed by the monthly maintenance cost in aacms for the road. Maintenance costs will be positive integers less than 100. All data fields in the row are separated by single blanks. The road network will always allow travel between all the villages. The network will never have more than 75 roads. No village will have more than 15 roads going to other villages (before or after in the alphabet). In the sample input below, the first data set goes with the map above.
The output is one integer per line for each data set: the minimum cost in aacms per month to maintain a road system that connect all the villages. Caution: A brute force solution that examines every possible set of roads will not finish within the one minute time limit.
Sample Input
9A 2 B 12 I 25B 3 C 10 H 40 I 8C 2 D 18 G 55D 1 E 44E 2 F 60 G 38F 0G 1 H 35H 1 I 353A 2 B 10 C 40B 1 C 200
Sample Output
21630
解题思路:
最小生成树模板题
排序加并查集
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
private static int n;
private static int[] list;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
n = scanner.nextInt();
if (n == 0) {
return;
}
PriorityQueue<point> queue = new PriorityQueue<point>();
for (int i = 0; i < n-1; i++) {
int s = scanner.next().charAt(0) - 'A' + 1;
int b = scanner.nextInt();
for (int j = 0; j < b; j++) {
int e = scanner.next().charAt(0) - 'A' +1;
int v = scanner.nextInt();
queue.add(new point(s,e,v));
}
}
int sum = 0;
list = new int [27];
for (int i = 0; i < list.length; i++) {
list[i] = i;
}
while (!queue.isEmpty()) {
point a = queue.poll();
int left = findFather(a.s);
int right = findFather(a.e);
if (left != right) {
list[left] = right;
sum += a.v;
}
}
System.out.println(sum);
}
}
private static int findFather(int s) {
if (list[s] == s) {
return s;
}
return findFather(list[s]);
}
}
class point implements Comparable<point>{
int s ;
int e ;
int v ;
public point(int s, int e, int v) {
this.s = s;
this.e = e;
this.v = v;
}
@Override
public int compareTo(point o) {
if (this.v > o.v) {
return 1;
}else if (this.v == o.v) {
return 0;
}
return -1;
}
}
import java.util.Scanner;
public class Main {
private static int n;
private static int[] list;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
n = scanner.nextInt();
if (n == 0) {
return;
}
PriorityQueue<point> queue = new PriorityQueue<point>();
for (int i = 0; i < n-1; i++) {
int s = scanner.next().charAt(0) - 'A' + 1;
int b = scanner.nextInt();
for (int j = 0; j < b; j++) {
int e = scanner.next().charAt(0) - 'A' +1;
int v = scanner.nextInt();
queue.add(new point(s,e,v));
}
}
int sum = 0;
list = new int [27];
for (int i = 0; i < list.length; i++) {
list[i] = i;
}
while (!queue.isEmpty()) {
point a = queue.poll();
int left = findFather(a.s);
int right = findFather(a.e);
if (left != right) {
list[left] = right;
sum += a.v;
}
}
System.out.println(sum);
}
}
private static int findFather(int s) {
if (list[s] == s) {
return s;
}
return findFather(list[s]);
}
}
class point implements Comparable<point>{
int s ;
int e ;
int v ;
public point(int s, int e, int v) {
this.s = s;
this.e = e;
this.v = v;
}
@Override
public int compareTo(point o) {
if (this.v > o.v) {
return 1;
}else if (this.v == o.v) {
return 0;
}
return -1;
}
}
阅读全文
0 0
- hud-1301-Jungle Roads-最小生成树-java
- Nyoj 434&&Hud 1301 Jungle Roads[最小生成树Kruscal]
- HDU 1301 Jungle Roads 最小生成树
- hdoj 1301 Jungle Roads 【最小生成树】
- hdoj-1301-Jungle Roads【最小生成树】
- HDOJ 1301 Jungle Roads(最小生成树)
- hdoj 1301 Jungle Roads 【最小生成树】
- hdoj-1301 Jungle Roads 【最小生成树】
- HDOJ 1301 Jungle Roads(最小生成树
- HDU-1301 Jungle Roads (最小生成树)
- Jungle Roads(最小生成树)
- Jungle Roads 最小生成树
- hdu 1301 Jungle Roads(最小生成树Prim算法)
- hdu 1301 Jungle Roads(最小生成树Kruskal)
- hdu 1301——Jungle Roads(最小生成树)
- HDU 1301 Jungle Roads 最小生成树(简单)
- hdu 1301 Jungle Roads (基础最小生成树)
- HDU 1301 Jungle Roads (最小生成树)kruskal
- Material Design控件之Switch|SwitchCompat
- SpringMVC ajax中文乱码的解决办法
- 文章标题
- 集合之List子实现类
- 移动端js控制隐藏输入法键盘
- hud-1301-Jungle Roads-最小生成树-java
- mfc 枚举enum使用例子
- 用树莓派搭建网络摄像头
- 传递主窗口句柄或者控件给其他cpp使用
- Visual Studio 2013 VC++ 数据库的简单使用
- VC操作Excel之基本操作(颜色等)
- SpringMVC form表单传值中文乱码处理
- [NOIP] [线段树] [树状数组] NOIP2017Day2 列队
- Unity 画虚线