【第22期】观点:IT 行业加班,到底有没有价值?

Fire Station

翻译 2015年11月17日 21:10:56

Description

A city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest station is too far, so a new station is to be built. You are to choose the location of the fire station so as to reduce the distance to the nearest station from the houses of the disgruntled residents.

The city has up to 500 intersections, connected by road segments of various lengths. No more than 20 road segments intersect at a given intersection. The location of houses and firestations alike are considered to be at intersections (the travel distance from the intersection to the actual building can be discounted). Furthermore, we assume that there is at least one house associated with every intersection. There may be more than one firestation per intersection.


Input



The first line of input contains two positive integers: f,the number of existing fire stations (f <= 100) and i, the number of intersections (i <= 500). The intersections are numbered from 1 to i consecutively. f lines follow; each contains the intersection number at which an existing fire station is found. A number of lines follow, each containing three positive integers: the number of an intersection, the number of a different intersection, and the length of the road segment connecting the intersections. All road segments are two-way (at least as far as fire engines are concerned), and there will exist a route between any pair of intersections.

Subsequent test cases are separated with a single blank line.


Output



You are to output a single integer for each test case: the lowest intersection number at which a new fire station should be built so as to minimize the maximum distance from any intersection to the nearest fire station.


Sample Input



1 6
2
1 2 10
2 3 10
3 4 10
4 5 10
5 6 10
6 1 10


Sample Output



5


这道题意思真难懂,首先输入数据,第一行两个数分别表示消防站和十字路口的个数,

第二行表示消防站所在的路口,接下来若干行表示每个十字路口的相连和长度,最后

输入会有一个空行结束(坑死在这里了),找到每个十字路口距离最近的消防站,求出

在最小坐标建立消防站使得最远距离最小。


可以先求出每个消防站到每个点的距离,统计每个点的最小值就是各点到消防站的最

短路,统计一个最大就是得到距离消防站最远距离是多少了,然后对每个没有处理

的十字路口进行假设此处有一个消防站,求出距离最近的消防站的最大距离是否比

开始求出的最大值小,如果小那么此点设一个消防站就更优一些。

#include <stdio.h>
#include <vector>
#include <queue>
#include <string.h>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 505;
int f[maxn], dis[maxn], m, ans[maxn];
bool vis[maxn];
char str[maxn];
struct node
{
    int v, len;
} t;
vector < node > mp[maxn];
queue < int > q;
void init ( )
{
    for ( int i = 0; i <= m; i ++ )
        mp[i].clear ( );
    memset ( ans, 0x3f, sizeof ( ans ) );
    memset ( f, 0, sizeof ( f ) );
}
inline int Max ( int a, int b )
{
    return a > b ? a : b;
}
inline int Min ( int a, int b )
{
    return a < b ? a : b;
}
void spfa ( int s ) //求单源最短路
{
    for ( int i = 1; i <= m; i ++ )
        vis[i] = false, dis[i] = INF;
    while ( ! q.empty ( ) )
        q.pop ( );
    dis[s] = 0;
    q.push ( s );
    while ( ! q.empty ( ) )
    {
        int u = q.front ( );
        q.pop ( );
        vis[u] = false;
        for ( int i = 0; i < mp[u].size ( ); i ++ )
        {
            t = mp[u][i];
            if ( t.len+dis[u] < dis[t.v] )
            {
                dis[t.v] = t.len+dis[u];    //更新s-v的最短路
                if ( vis[t.v] == false )    //没有进队列
                {
                    vis[t.v] = true;
                    q.push ( t.v );
                }
            }
        }
    }
}
void print ( )
{
    for ( int i = 1; i <= m; i ++ )
        printf ( "%d ", dis[i] );
    printf ( "\n" );
}
int main ( )
{
    int n, x, u, v, l, res, id;
    while ( ~ scanf ( "%d%d", &n, &m ) )
    {
        init ( );
        for ( int i = 0; i < n; i ++ )
        {
            scanf ( "%d", &x );
            f[x] = 1;
        }
        getchar ( );
        while ( gets ( str ) && strlen ( str ) )    //注意这里是多组,不是m组
        {
            sscanf ( str, "%d%d%d", &u, &v, &l );
            t.v = v, t.len = l;
            mp[u].push_back ( t );
            t.v = u;
            mp[v].push_back ( t );
        }
        for ( int i = 1; i <= m; i ++ )
        {
            if ( f[i] ) //求出每个消防站到每个十字路口的距离
            {
                spfa ( i );
                for ( int j = 1; j <= m; j ++ )
                //找每个十字路径距离最近的消防站
                    ans[j] = Min ( ans[j], dis[j] );
                //print ( );
            }
        }
        res = 0;
        for ( int i = 1; i <= m; i ++ ) //找距离最远
            res = Max ( res, ans[i] );
        id = 1;
        for ( int i = 1; i <= m; i ++ )
        {
            if ( f[i] == 0 )    //对每个没求过的十字路口假设设定一个消防站,求出最优值
            {
                spfa ( i );
                int mx = 0;
                for ( int j = 1; j <= m; j ++ ) //找距离最近的最大值
                    mx = Max ( mx, Min ( ans[j], dis[j] ) );
                if ( mx < res ) //res大于mx证明在i这个位置更优一些
                {
                    res = mx;
                    id = i;
                }
            }
        }
        printf ( "%d\n", id );
    }
    return 0;
}


举报

相关文章推荐

SGU - 465 Fire Station Building floyd+三分

题意:有n个城市m条双向边,计划在一条道路上建立一个消防局,并且它离城市的距离不能小于R,每个城市i有一个发生火灾的概率pi,要求找出最优的地点,是出警需要的期望路程最小。 floyd+三分 di表示...

POJ 2607 Fire Station

又是一道最短路的题,为了提高效率,我用的邻接链表+SPFA做的,速度很快,0ms过的。 首先,初始化完dist数组后,对每个消防站作为起点都求一次最短路,期间不再初始化dist数组,这样最后得到的dist数组就是每个居民到最近的消防站的距离。 然后枚举每个点,每次求一下最短路,用其中的最大值比较...

程序员升职加薪指南!还缺一个“证”!

CSDN出品,立即查看!

ZOJ-1857(POJ-2607) Fire Station

Fire Station Time Limit: 2 Seconds      Memory Limit: 65536 KB A city is served by a number of...

UVa Problem 10278 Fire Station (消防站)

// Fire Station (消防站) // PC/UVa IDs: 111003/10278, Popularity: B, Success rate: low Level: 2 // Verdict: Accepted // Submission Date: 2011-10-05 // UV...

sgu 465 Fire Station Building 三分

sgu 465 Fire Station Building 三分 sgu题目虽然不多,但是题题经典,数据也是很给力的。。 本题,最短路处理后在每条边上三分。 写完后在testcase...
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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