HDU2923:Einbahnstrasse(Floyd)

原创 2013年12月05日 16:02:10
Problem Description
Einbahnstra  e (German for a one-way street) is a street on which vehicles should only move in one direction. One reason for having one-way streets is to facilitate a smoother flow of traffic through crowded areas. This is useful in city centers, especially old cities like Cairo and Damascus. Careful planning guarantees that you can get to any location starting from any point. Nevertheless, drivers must carefully plan their route in order to avoid prolonging their trip due to one-way streets. Experienced drivers know that there are multiple paths to travel between any two locations. Not only that, there might be multiple roads between the same two locations. Knowing the shortest way between any two locations is a must! This is even more important when driving vehicles that are hard to maneuver (garbage trucks, towing trucks, etc.)

You just started a new job at a car-towing company. The company has a number of towing trucks parked at the company's garage. A tow-truck lifts the front or back wheels of a broken car in order to pull it straight back to the company's garage. You receive calls from various parts of the city about broken cars that need to be towed. The cars have to be towed in the same order as you receive the calls. Your job is to advise the tow-truck drivers regarding the shortest way in order to collect all broken cars back in to the company's garage. At the end of the day, you have to report to the management the total distance traveled by the trucks.
 

Input
Your program will be tested on one or more test cases. The first line of each test case specifies three numbers (N , C , and R ) separated by one or more spaces. The city has N locations with distinct names, including the company's garage. C is the number of broken cars. R is the number of roads in the city. Note that 0 < N < 100 , 0<=C < 1000 , and R < 10000 . The second line is made of C + 1 words, the first being the location of the company's garage, and the rest being the locations of the broken cars. A location is a word made of 10 letters or less. Letter case is significant. After the second line, there will be exactly R lines, each describing a road. A road is described using one of these three formats:


A -v -> B
A <-v - B
A <-v -> B


A and B are names of two different locations, while v is a positive integer (not exceeding 1000) denoting the length of the road. The first format specifies a one-way street from location A to B , the second specifies a one-way street from B to A , while the last specifies a two-way street between them. A , ``the arrow", and B are separated by one or more spaces. The end of the test cases is specified with a line having three zeros (for N , C , and R .)

The test case in the example below is the same as the one in the figure. 

 

Output
For each test case, print the total distance traveled using the following format:


k . V


Where k is test case number (starting at 1,) is a space, and V is the result.
 

Sample Input
4 2 5 NewTroy Midvale Metrodale NewTroy <-20-> Midvale Midvale --50-> Bakerline NewTroy <-5-- Bakerline Metrodale <-30-> NewTroy Metrodale --5-> Bakerline 0 0 0
 

Sample Output
1. 80


 

题意:一开始给出三个数字,n,c,m,代表城市数,破车数,道路数

然后跟着m条路线,箭头为指向,数字为花费,然后求出从公司派出车,到每个城市回收破车的最小花费,要注意每辆车只能回收一辆破车

 

思路:用floyd最方便了- -

 

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;
#define inf 999999999
const int L = 1005;
int n,c,m;
int a[105][105];
char str[1005][100];
int cnt;
map<string,int> mat;


void Floyd()
{
    int i,j,k;
    for(i = 1; i<=n; i++)
        for(j = 1; j<=n; j++)
            for(k = 1; k<=n; k++)
                if(a[j][i]+a[i][k]<a[j][k])
                    a[j][k] = a[j][i]+a[i][k];
}

int main()
{
    int i,j,val,x,y,len,cas = 1,sum,start;
    char s1[100],s2[100],s3[100];
    char from,to;
    while(~scanf("%d%d%d",&n,&c,&m)&&(n+c+m))
    {
        sum = 0;
        mat.clear();
        for(i = 0; i<=n; i++)
            for(j = 0; j<=n; j++)
                a[i][j] = inf;
        for(i = 0; i<=c; i++)
            scanf("%s",str[i]);
        cnt = 1;
        for(i = 0; i<m; i++)
        {
            scanf("%s %c-%d-%c %s",s1,&from,&val,&to,s3);
            if(!mat[s1])
                mat[s1] = cnt++;
            if(!mat[s3])
                mat[s3] = cnt++;
            x = mat[s1],y = mat[s3];
            if(from == '<' && val<a[y][x])
                a[y][x] = val;
            if(to == '>' && val<a[x][y])
                a[x][y] = val;
        }
        Floyd();
        start = mat[str[0]];
        for(i = 1; i<=c; i++)
            sum+=a[start][mat[str[i]]]+a[mat[str[i]]][start];
        printf("%d. %d\n",cas++,sum);
    }

    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 2923 Einbahnstrasse(最短路径,多源点到单源点)

Einbahnstrasse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
  • weixin_38327682
  • weixin_38327682
  • 2017年08月04日 13:09
  • 85

集训队专题(3)1011 Einbahnstrasse

Einbahnstrasse Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
  • RaAlGhul
  • RaAlGhul
  • 2016年02月05日 01:45
  • 209

HDU 2102 A计划(深搜)

Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的...
  • Lcc_2016
  • Lcc_2016
  • 2016年07月15日 16:43
  • 612

HDU:2112 HDU Today(floyd求最短路径+变形题)

HDU Today Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tot...
  • zugofn
  • zugofn
  • 2016年08月04日 21:50
  • 506

hdu1317 负权最短路(Floyd+bellman)

首先要读懂题,做这个题时读题看样例琢磨了半天才明白= =; 题目的意思是,一个人从一号房间走到最后一个房间,每个房间有相应的能量值(可正可负),当走到这个房间的时候可以获取这个房间的能量值,如果走到...
  • zs120197
  • zs120197
  • 2016年07月24日 12:45
  • 258

HDU 2819 Swap (行列匹配+输出解)

题意:能否使对角线上全是1 ,这个简单直接按行列匹配,难在路径的输出,我们知道X,Y左右匹配完了之后,不一定是1–1,2–2,3–3……这样的匹配。可能是1–3,2–1,3–2,我们要把他们交换成前一...
  • u013167299
  • u013167299
  • 2015年08月24日 22:16
  • 574

HDU 1874 畅通工程续 + HDU 2544 最短路 最短路水题,floyd水

题目: 1874 http://acm.hdu.edu.cn/showproblem.php?pid=1874 2444 http://acm.hdu.edu.cn/showproblem.php...
  • hcbbt
  • hcbbt
  • 2013年06月16日 20:25
  • 2285

HDU -1151 二分匹配与DAG图(最小覆盖路径)

Consider a town where all the streets are one-way and each street leads from one intersection to ano...
  • wangxiaai
  • wangxiaai
  • 2017年07月31日 15:57
  • 176

[hdu5985]概率题的推导

题目描述Bob has collected a lot of coins in different kinds. He wants to know which kind of coins is luc...
  • aaron_1996
  • aaron_1996
  • 2016年11月30日 23:04
  • 1002

poj 1422 Air Raid 最小路径覆盖 二分图匹配 解题报告

Description Consider a town where all the streets are one-way and each street leads from one inte...
  • qq_21899803
  • qq_21899803
  • 2016年08月19日 17:16
  • 447
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU2923:Einbahnstrasse(Floyd)
举报原因:
原因补充:

(最多只允许输入30个字)