专栏首页AI那点小事九度OJ——1154Jungle Roads

九度OJ——1154Jungle Roads

题目描述:

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. 样例输入: 9 A 2 B 12 I 25 B 3 C 10 H 40 I 8 C 2 D 18 G 55 D 1 E 44 E 2 F 60 G 38 F 0 G 1 H 35 H 1 I 35 3 A 2 B 10 C 40 B 1 C 20 0 样例输出: 216 30


思路:Kruskal算法的应用。算法思路详见:最小生成树算法(下)——Kruskal(克鲁斯卡尔)算法 AC代码:

#include <iostream>
#include <queue>
using namespace std;

typedef struct node{
    int start;
    int end;
    int len;
}Edge;

struct cmp{
    bool operator() (Edge e1,Edge e2){
        return e1.len>e2.len;   
    }
};

 const int MAX = 5000;
 int data[MAX];
 int N,start,end,len,n,sum;
 char ch;
 priority_queue<Edge,vector<Edge>,cmp> Q;

int Find(int root)
{
    if(data[root] < 0){
        return root;
    }
    return data[root] = Find(data[root]);
}

void Union(int root1 ,int root2)
{
    root1 = Find(root1);
    root2 = Find(root2);
    if(root1 == root2){
        return;
    }else if(root1 < root2){
        data[root1] += data[root2];
        data[root2] = root1;
    }else{
        data[root2] += data[root1];
        data[root1] = root2;
    }
    N--;
}

int Kruskal()
{
    int sum = 0;
    while(!Q.empty()){
        Edge e = Q.top();
        Q.pop();
        int root1 = e.start;
        int root2 = e.end;
        if(Find(root1) != Find(root2)){
            sum += e.len;
            Union(root1,root2);
        }
        if(N == 1){
            break;
        }
    }
    return sum;
 } 

int main()
{
    while(cin>>N){
        if(N == 0){
            break;
        }
        while(!Q.empty()){
            Q.pop();
        }
        for(int i = 0 ; i < MAX ; i++){
            data[i] = -1;
        } 
        for(int i = 1 ; i < N ; i++){
            cin>>ch>>n;
            start = ch-'A'+1;
            if(n > 0){
                for(int j = 0 ; j < n ; j++){
                    cin>>ch>>len;
                    end = ch-'A'+1;
                    Edge e;
                    e.start = start;
                    e.end = end;
                    e.len = len;
                    Q.push(e);
                }   
            }
        }
        sum = Kruskal();
        cout<<sum<<endl;
    }

    return 0;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • 09-排序2 Insert or Merge (25分)

    Insertion sort iterates, consuming one input element each repetition, and growin...

    AI那点小事
  • 11-散列2 Hashing (25分)

    The task of this problem is simple: insert a sequence of distinct positive integ...

    AI那点小事
  • 九度OJ——1144Freckles

    题目描述: In an episode of the Dick Van Dyke show, little Richie connects the ...

    AI那点小事
  • 11-散列2 Hashing (25分)

    The task of this problem is simple: insert a sequence of distinct positive integ...

    AI那点小事
  • HDU 4247 Pinball Game 3D(cdq 分治+树状数组+动态规划)

    Pinball Game 3D Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/...

    ShenduCC
  • 实验2 C++数组与指针

    步行者08
  • Java字节码修改库ASM#ClassReader实现原理及源码分析

    ASM是Java中比较流行的用来读写字节码的类库,用来基于字节码层面对代码进行分析和转换。

    JavaEdge
  • 阶乘很简单?恕我直言,阶乘相关的面试题你还真不一定懂!

    对于如何算 n 的阶乘,只要你知道阶乘的定义,我想你都知道怎么算,但如果在面试中,面试官抛给你一道与阶乘相关,看似简单的算法题,你还真不一定能够给出优雅的答案!...

    帅地
  • HDU 5421 Victor and String(回文树)

    Victor and String Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 52428...

    ShenduCC
  • CF-1197C-C. Array Splitting

    某些人

扫码关注云+社区

领取腾讯云代金券