PAT1003Emergency(25)

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了PAT1003Emergency(25)，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含3637字，纯文字阅读大概需要6分钟。

内容图文

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

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 Input5 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 Output2 4

const int maxn = 510;
int ans, n, m, s, t, v[maxn], dis[maxn], mapPA[maxn][maxn], x, y, z, vis[maxn];
long long cnt[maxn];
//n-城市数量，m-道路数量，s-起点，t-终点
void dfs(int x, int y, int z){
    ans = max(ans, z);
    if (x == y || dis[x] == -1)return;
    for (int i = 0; i < n; ++i){
        if (mapPA[x][i] != -1 && dis[x] == dis[i] + mapPA[x][i]){
            dfs(i, y, z + v[i]);
        }
    }
    dis[x] = -1;
}
void PAT1003A(){
    cin >> n >> m >> s >> t;
    for (int i = 0; i < n; ++i)cin >> v[i];
    memset(mapPA, -1, sizeof(mapPA));
    memset(dis, -1, sizeof(dis));
    while (m--){
        cin >> x >> y >> z;
        mapPA[x][y] = mapPA[y][x] = z;
    }
    dis[s] = 0; cnt[s] = 1;
    while (true){
        int now = -1;
        for (int i = 0; i < n; ++i){
            if (now == -1)now = i; else now = dis[now] < dis[i] ? now : i;
        }
        if (now == -1)break;
        vis[now] = 1;
        for (int i = 0; i < n; ++i)
        {
            if (mapPA[now][i] != -1){
                if (dis[i] == -1 || dis[i] > dis[now] + mapPA[now][i]){ 
                    dis[i] = dis[now] + mapPA[now][i];
                    cnt[i] = cnt[now];
                }
                else if (dis[i] == dis[now] + mapPA[now][i])cnt[i] += cnt[now];
            }
        }
    }
    dfs(t, s, v[t]);
    cout << cnt[t] << ans;
}

方法二：only 深搜

//深搜+回溯
#define N 505
int n, m, s, e;
int team[N];
int numDis, minDis, maxTeam;
int vis[N];
int matrix[N][N];
vector<int>path;
void DFS(int next){
    int i;
    if (next == e){
        int curTeam = 0, curDis = 0;
        for (i = 0; i < path.size(); ++i){
            curTeam += team[path[i]];
        }
        for (i = 0; i < path.size() - 1; ++i){
            curDis += matrix[path[i]][path[i + 1]];
        }
        if (curDis < minDis){
            numDis = 1;
            minDis = curDis;
            maxTeam = curTeam;
        }
        else if (curDis == minDis){
            numDis++;
            if (curTeam > maxTeam)maxTeam = curTeam;
        }
        return;
    }

    for (i = 0; i < n; ++i){
        if (matrix[next][i] != -1){
            if (!vis[i])
            {
                vis[i] = 1;
                path.push_back(i);
                DFS(i);
                path.pop_back();
                vis[i] = 0;
            }
        }
    }
}
void PAT1003A(){
    int i, a, b, d, j;
    while (cin >> n >> m >> s >> e)
    {
        for (i = 0; i < n; i++, matrix[i][i] = 0, vis[i] = 0)
        {
            for (j = 0; j < n; j++)
            {
                matrix[i][j] = -1;
            }
        }
        for (i = 0; i < n; i++)
        {
            cin >> team[i];
        }
        for (i = 0; i < m; i++)
        {
            cin >> a >> b >> d;
            matrix[a][b] = matrix[b][a] = d;
        }

        path.clear();
        numDis = 0;
        minDis = 0x7fffffff;
        maxTeam = -1;

        //开始
        vis[s] = 1;
        path.push_back(s);
        DFS(s);
        path.pop_back();
        vis[s] = 0;
            cout << numDis << " " << maxTeam << endl;


}

内容总结

以上是互联网集市为您收集整理的PAT1003Emergency(25)全部内容，希望文章能够帮你解决PAT1003Emergency(25)所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端