zoukankan      html  css  js  c++  java
  • POJ_1789 Truck History

    Truck History
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 9665   Accepted: 3556

    Description

    Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a truck. The code is simply a string of exactly seven lowercase letters (each letter on each position has a very special meaning but that is unimportant for this task). At the beginning of company's history, just a single truck type was used but later other types were derived from it, then from the new types another types were derived, and so on. 

    Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not derived from any other type). The quality of a derivation plan was then defined as 
    1/Σ(to,td)d(to,td)

    where the sum goes over all pairs of types in the derivation plan such that to is the original type and td the type derived from it and d(to,td) is the distance of the types. 
    Since historians failed, you are to write a program to help them. Given the codes of truck types, your program should find the highest possible quality of a derivation plan. 

    Input

    The input consists of several test cases. Each test case begins with a line containing the number of truck types, N, 2 <= N <= 2 000. Each of the following N lines of input contains one truck type code (a string of seven lowercase letters). You may assume that the codes uniquely describe the trucks, i.e., no two of these N lines are the same. The input is terminated with zero at the place of number of truck types.

    Output

    For each test case, your program should output the text "The highest possible quality is 1/Q.", where 1/Q is the quality of the best derivation plan.

    Sample Input

    4
    aaaaaaa
    baaaaaa
    abaaaaa
    aabaaaa
    0

    Sample Output

    The highest possible quality is 1/3.

    Source

    瞪了半小时题愣是没看懂,看了看discuss里的解释,写了个朴素版的Prim......

    这道题就是说每种代表车型的串,他们的distance就是串中不同字符的个数,要求算出所有串的distance's 最小 sum ;

    View Code
    #include <stdio.h>
    #include
    <stdlib.h>
    #define MAX 2010
    #define MAXCOST 0x7fffffff
    int graph[MAX][MAX];
    int Prim(int graph[][MAX], int n)
    {

    int lowcost[MAX];
    int i, j, min, flag, sum =0;
    for (i =1; i < n; i++)
    {
    lowcost[i]
    = graph[0][i];

    }
    for (i =1; i < n; i++)
    {
    min
    = MAXCOST;
    flag
    =0;
    for (j =1; j < n; j++)
    {
    if (lowcost[j] < min && lowcost[j] !=0)
    {
    min
    = lowcost[j];
    flag
    = j;
    }
    }
    sum
    += min;
    lowcost[flag]
    =0;
    for (j =1; j < n; j++)
    {
    if (graph[flag][j] < lowcost[j])
    {
    lowcost[j]
    = graph[flag][j];

    }
    }
    }
    return sum;
    }
    int length(char*a, char*b)
    {
    int i, sum =0;
    for (i =0; i <7; ++i)
    if (a[i] != b[i])
    ++sum;
    return sum;
    }
    int main()
    {
    int i, j, m, num;
    char s[MAX][7];
    while(scanf("%d", &m), m)
    {
    for(i =0; i < m; i++)
    scanf(
    "%s", s[i]);
    for(i =0; i < m-1; i++)
    for(j = i+1; j < m; j++)
    {
    graph[i][j]
    = length(s[i], s[j]);
    graph[j][i]
    = graph[i][j];
    }
    num
    = Prim(graph, m);
    printf(
    "The highest possible quality is 1/%d.\n", num);
    }
    return0;
    }
  • 相关阅读:
    Java多线程的两种实现方式
    Java实现验证码的产生和验证
    web前端对上传的文件进行类型大小判断的js自定义函数
    Java前端Rsa公钥加密,后端Rsa私钥解密(支持字符和中文)
    了解火爆的区块链和比特币
    Java中调用JavaScript方法
    Java读取文件的问题
    SpringBoot热部署简介
    Java使用Jetty实现嵌入式Web服务器及Servlet容器
    『安全工具』目录扫描 DirBuster AND 御剑
  • 原文地址:https://www.cnblogs.com/vongang/p/2119297.html
Copyright © 2011-2022 走看看