1003. Emergency (25)

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible.

Input

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (<= 500) - the number of cities (and the cities are numbered from 0 to N-1), M - the number of roads, C1 and C2 - the cities that you are currently in and that you must save, respectively. The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city. Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively. It is guaranteed that there exists at least one path from C1 to C2.

Output

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather.
All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

Sample Input

5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1

Sample Output

2 4

题目描述:

抽象出来就是给你一张图,给你起点终点,着到起点到终点的所有最短路径,每个点上有一个数,代表这个点上的搜救队的数量,要求输出这些最短路径中你能召集到的最大的搜救队的数量。

算法分析:

思路1、dijsktra

简单题,最短路径算法(e.g. Dijastra),但是要稍微变化一下,要记录所有的的最短路径,所以从终点回溯上去可能有多于一个的parent。那么就在每个node上面挂一个 list好了,记录所有的parents. 得到后可以从终点DFS到起点,记录下每条最短路径上的搜救队的数量和。保存最大的那个输出即可。

思路2、DFS

注意点:

这个题目其实就是最短路径的小小变形,注意最原始的最短路径算法通过记录每个node最短路径上的parent来保存一条这样的最短路径,这里话就 是相当于,要多点判断,当新的路径和当前路径相同长度时,也要记录下来,但是后面如果找到更短的,那么之前的路径就要清空,记录路径的代码稍微注意一点就 没问题了。

Dijkstra

#include <iostream>
#include <cstring>
#include <cstdio> using namespace std; #define INF 0x3f3f3f3f
#define MX 501 int mp[MX][MX];
int v[MX];
int dist[MX];
int amount[MX];
int teams[MX];
int pathcount[MX];
int N,M,start,en; void dijkstra(int s){
amount[s] = teams[s];
dist[s] = ;
pathcount[s] = ; while (){
int u, dmin=INF;
for (int i=; i<N; i++){
if (v[i]== && dist[i]<dmin){
dmin = dist[i];
u = i;
}
}
if (dmin==INF || u==en) break;
v[u] = ;
for (int i=; i<N; i++){
if(v[i]==){
if (dist[i] > dist[u] + mp[u][i]){
dist[i] = dist[u] + mp[u][i];
amount[i] = amount[u] + teams[i];
pathcount[i] = pathcount[u];
}else if (dist[i] == dist[u] + mp[u][i]){
pathcount[i] += pathcount[u];
if (amount[i] < amount[u] + teams[i])
amount[i] = amount[u] + teams[i];
}
}
}
}
} int main()
{
scanf("%d%d%d%d", &N,&M,&start,&en);
for (int i=; i<N; i++)
{
scanf("%d", &teams[i]);
}
for (int i=; i<N; i++)
{
dist[i] = INF;
for (int j=; j<N; j++)
mp[i][j] = INF;
}
for (int i=; i<M; i++)
{
int c1, c2, L;
scanf("%d%d%d", &c1,&c2,&L);
mp[c1][c2] = mp[c2][c1] = L;
} dijkstra(start);
printf("%d %d", pathcount[en], amount[en]); return ;
}

DFS

#include<cstdio>
#include<cstring> #define INF 0x7FFFFF
int u[]={};
int teams[]={};
int dist[];
int mp[][];
int n,m,st,en;
int shortNum=,maxteam=,mindist=INF; void dfs(int s,int dis,int team){//到达S结点时的距离,teams
if(s==en){
if(dis<mindist){
mindist=dis;
shortNum=;
maxteam=team;
}else if(dis==mindist){
shortNum++;
if(team>maxteam) maxteam=team;
}
return;
}
u[s]=;
for(int i=;i<n;i++){
if(u[i]== && mp[s][i]>){
dfs(i,dis+mp[s][i],team+teams[i]);
}
}
u[s]=;
} int main(){
freopen("in.txt","r",stdin);
int i;
scanf("%d%d%d%d",&n,&m,&st,&en);
for(i=;i<n;i++) scanf("%d",&teams[i]);
memset(mp,-,sizeof(mp));
for(i=;i<m;i++){
int t1,t2,dis;
scanf("%d%d%d",&t1,&t2,&dis);
mp[t1][t2]=mp[t2][t1]=dis;
} //u[st]=1;
dfs(st,,teams[st]); printf("%d %d\n",shortNum,maxteam);
return ;
}

PAT 解题报告 1003. Emergency (25)的更多相关文章

  1. PAT 解题报告 1010. Radix (25)

    1010. Radix (25) Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 11 ...

  2. PAT (Advanced level) 1003. Emergency (25) Dijkstra

    As an emergency rescue team leader of a city, you are given a special map of your country. The map s ...

  3. PAT (Advanced Level) 1003. Emergency (25)

    最短路+dfs 先找出可能在最短路上的边,这些边会构成一个DAG,然后在这个DAG上dfs一次就可以得到两个答案了. 也可以对DAG进行拓扑排序,然后DP求解. #include<iostrea ...

  4. 【PAT甲级】1003 Emergency (25 分)(SPFA,DFS)

    题意:n个点,m条双向边,每条边给出通过用时,每个点给出点上的人数,给出起点终点,求不同的最短路的数量以及最短路上最多能通过多少人.(N<=500) AAAAAccepted code: #in ...

  5. PAT 1003. Emergency (25)

    1003. Emergency (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue As an emerg ...

  6. PAT 1003. Emergency (25) dij+增加点权数组和最短路径个数数组

    1003. Emergency (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue As an emerg ...

  7. PAT 甲级 1003. Emergency (25)

    1003. Emergency (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue As an emerg ...

  8. 1003 Emergency (25)(25 point(s))

    problem 1003 Emergency (25)(25 point(s)) As an emergency rescue team leader of a city, you are given ...

  9. 1003 Emergency (25分) 求最短路径的数量

    1003 Emergency (25分)   As an emergency rescue team leader of a city, you are given a special map of ...

随机推荐

  1. 百度BAE环境下WordPress安装教程

    不了解代码的童鞋慎重使用这种方法哦,安装过程中可能会出现一些简单的错误. 前两天有位网友在QQ上联系我,他告诉我自己在百度BAE上安装WordPress程序总是出错.我让他按照网络上的教程逐步安装,但 ...

  2. Networking with PHP

    PHP Advanced and Object-Oriented Programming 3rd Edition

  3. flat file

    Computer Science An Overview _J. Glenn Brookshear _11th Edition The term database refers to a collec ...

  4. xinwajueji

    #include<stdio.h> int map[10][10]={0}; int step[30]={0}; int max=99999; int ans[99]={0};  int ...

  5. OmniThreadLibrary 3.03b发布了

    虽然版本号升的不大,但这也是一个重要的版本.作者发现了一个长期存在的bug,就是建立一个线程,如果不指定线程的优先级则默认设置为idle.(正确的应是Normal) 看一下具体的改动情况: 新功能: ...

  6. Delphi的哈希表(一)

    哈希表是通过哈希值来访问的,通过一定的内存浪费获取检索速度,在检索项时是不需要逐一检索.在编程中有一定的好处. unit Unit1; interface uses Windows, Messages ...

  7. jsp页面直接编写csss

    <style> .logoZL{ width:550px; float:right; text-align:right; padding-right:15px; margin-right: ...

  8. 将所有程序设置XML集中到一个单独XML配置文件的方法:使用appSettings元素的configSource元素

    在.NET程序中,程序的配置文件默认都会放在程序根目录下的web.config(网站程序)或App.config(控制台等程序),在该配置文件中可以定义若干程序配置信息. 在此以网站程序为例,首先将下 ...

  9. php apc

    APC,全称是Alternative PHP Cache,官方翻译叫”可选PHP缓存”.它为我们提供了缓存和优化PHP的中间代码的框架. APC的缓存分两部分:系统缓存和用户数据缓存. 系统缓存 它是 ...

  10. 使用多种客户端消费WCF RestFul服务(三)——.net4.5篇

    .net 4.5篇 在.net 4.5下面微软提供了System.Net.Http.dll可以非常方便的使用HTTP请求(其实是用来支持Asp.Net Web Api的,不过我们可以拿过来用) 服务仍 ...