PAT A1111 Online Map (30分)

PAT A1111 Online Map (30分)

前言：此乃本人第一次写博客，之所以要写这篇题解，实乃记录我被此题折磨之惨重，愿我能永记教诲，不再犯此之错误，也希望能养成爱记录的好习惯。

题目描述：Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths to your user: one is the shortest, and the other is the fastest. It is guaranteed that a path exists for any request.

输入：Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N (2≤N≤500), and M, being the total number of streets intersections on a map, and the number of streets, respectively. Then M lines follow, each describes a street in the format:
V1 V2 one-way length time

where V1 and V2 are the indices (from 0 to N−1) of the two ends of the street; one-way is 1 if the street is one-way from V1 to V2, or 0 if not; length is the length of the street; and time is the time taken to pass the street.

Finally a pair of source and destination is given.
输出：Output Specification:

For each case, first print the shortest path from the source to the destination with distance D in the format:

Distance = D: source -> v1 -> ... -> destination

Then in the next line print the fastest path with total time T:

Time = T: source -> w1 -> ... -> destination

In case the shortest path is not unique, output the fastest one among the shortest paths, which is guaranteed to be unique. In case the fastest path is not unique, output the one that passes through the fewest intersections, which is guaranteed to be unique.

In case the shortest and the fastest paths are identical, print them in one line in the format:

Distance = D; Time = T: source -> u1 -> ... -> destination

Sample Input 1:

10 15
0 1 0 1 1
8 0 0 1 1
4 8 1 1 1
3 4 0 3 2
3 9 1 4 1
0 6 0 1 1
7 5 1 2 1
8 5 1 2 1
2 3 0 2 2
2 1 1 1 1
1 3 0 3 1
1 4 0 1 1
9 7 1 3 1
5 1 0 5 2
6 5 1 1 2
3 5

Sample Output 1:

Distance = 6: 3 -> 4 -> 8 -> 5
Time = 3: 3 -> 1 -> 5

Sample Input 2:

7 9
0 4 1 1 1
1 6 1 1 3
2 6 1 1 1
2 5 1 2 2
3 0 0 1 1
3 1 1 1 3
3 2 1 1 2
4 5 0 2 2
6 5 1 1 2
3 5

Sample Output 2:

Distance = 3; Time = 4: 3 -> 2 -> 5

题目大意：相当于给出一个有向图，让求给定两点间的最短路径，不过路径却多了一个时间属性，所以就相当于让求两次给定两点间的最短路径。第一次求距离最短，第二次求所用时间最短。若距离最短路径不唯一，则取用时最短的一条，如果时间最短路径不唯一，则取经过节点最少的那一条。

解题思路1：深搜DFS，（最后一个测试点会超时，所以不做过多叙述）

#include<bits/stdc++.h>
using namespace std;

//深搜算法，测试点4超时
struct Node
{
   
    int id;
    bool one;
    int length;
    int time;
};
unordered_map<int ,vector<Node>> match;//用来存放所有最短路径
bool visited[501];
vector<int> temp_path,path,maxpath;//path存放距离最短路径，maxpath存放时间最短路径
int max_path=0,min_path=99999999,max_time=99999999,min_time=0,max_node=0;
void Dfs(int source,int destination,int length,int time,int numNode)
{
   
    temp_path.push_back(source);
    if(source==destination)
    {
   
        if(time<max_time)
        {
   
            max_path=length;
            maxpath=temp_path;
            max_time=time;
            max_node=numNode;
        }
        else if(time==max_time&&numNode<max_node)
        {