PTA甲级 1018 Public Bike Management (C++)

There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.

The Public Bike Management Center (PBMC) keeps monitoring the real-time capacity of all the stations. A station is said to be in perfect condition if it is exactly half-full. If a station is full or empty, PBMC will collect or send bikes to adjust the condition of that station to perfect. And more, all the stations on the way will be adjusted as well.

When a problem station is reported, PBMC will always choose the shortest path to reach that station. If there are more than one shortest path, the one that requires the least number of bikes sent from PBMC will be chosen.

The above figure illustrates an example. The stations are represented by vertices and the roads correspond to the edges. The number on an edge is the time taken to reach one end station from another. The number written inside a vertex $S$ is the current number of bikes stored at $S$. Given that the maximum capacity of each station is 10. To solve the problem at $S_3$, we have 2 different shortest paths:

1. PBMC -> $S_1$ -> $S_3$. In this case, 4 bikes must be sent from PBMC, because we can collect 1 bike from $S_1$ and then take 5 bikes to $S_3$, so that both stations will be in perfect conditions.
2. PBMC -> $S_2$ -> $S_3$. This path requires the same time as path 1, but only 3 bikes sent from PBMC and hence is the one that will be chosen.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 numbers: $C_{max}(\le 100)$, always an even number, is the maximum capacity of each station; $N(\le 500)$, the total number of stations; $S_p$, the index of the problem station (the stations are numbered from 1 to $N$, and PBMC is represented by the vertex 0); and $M$, the number of roads. The second line contains $N$ non-negative numbers $C_i(i=1,\cdots ,N)$ where each $C_i$ is the current number of bikes at $S_i$ respectively. Then $M$ lines follow, each contains 3 numbers: $S_i$, $S_j$, and $T_{ij}$ which describe the time $T_{ij}$ taken to move betwen stations $S_i$ and $S_j$. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print your results in one line. First output the number of bikes that PBMC must send. Then after one space, output the path in the format: $0->S_1->\cdots ->S_p$. Finally after another space, output the number of bikes that we must take back to PBMC after the condition of $S_p$ is adjusted to perfect.

Note that if such a path is not unique, output the one that requires minimum number of bikes that we must take back to PBMC. The judge’s data guarantee that such a path is unique.

Sample Input:

10 3 3 5
6 7 0
0 1 1
0 2 1
0 3 3
1 3 1
2 3 1

Sample Output:

3 0->2->3 0

Caution:

建议看一下《算法笔记》10.4.1的内容，Dijkstra + DFS。

Solution:

// Talk is cheap, show me the code
// Created by Pengxiao Guo 2021-09-03 18:45:28
// All rights reserved.

#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int cmax, n, sp, m;
int storage[505];
int streets[505][505];
int dis[505];
vector<vector<int>> pre;

int minNeed = 2147483647, minBack = 2147483647;
unordered_map<int, bool> visited;

vector<int> ans;
vector<int> tmp;

void dfs(int idx){
    tmp.push_back(idx);

    if(idx == 0){
        int need = 0, back = 0;

        for(int i = tmp.size() - 2; i >= 0; --i){
            int id = tmp[i];

            if(storage[id] >= cmax / 2) back += storage[id] - cmax / 2;
            else{
                if(back > (cmax / 2 - storage[id])) back += storage[id] - cmax / 2;
                else{
                    need += (cmax / 2 - storage[id] - back);
                    back = 0;
                }
            }
        }

        if(need < minNeed){
            minNeed = need;
            minBack = back;
            ans = tmp;
        }
        else if(need == minNeed && back < minBack){
            minBack = back;
            ans = tmp;
        }

        tmp.pop_back();
        return;
    }

    for(int i = 0; i < pre[idx].size(); ++i) dfs(pre[idx][i]);
    tmp.pop_back();

    return;
}


int main(){

    fill(dis, dis + 505, 2147483647);
    scanf("%d %d %d %d", &cmax, &n, &sp, &m);
    pre.resize(n + 1);

    for(int i = 1; i <= n; ++i) scanf("%d", &storage[i]);

    for(int i = 0; i < m; ++i){
        int s1, s2, t;
        scanf("%d %d %d", &s1, &s2, &t);

        streets[s1][s2] = t;
        streets[s2][s1] = t;
    }

    // Dijkstra
    dis[0] = 0;
    for(int i = 0; i < n; ++i){

        int u = -1, minDis = 2147483647;

        for(int j = 0; j <= n; ++j){
            if(!visited[j] && dis[j] < minDis){
                u = j;
                minDis = dis[j];
            }
        }

        if(u == -1) break;
        visited[u] = true;

        for(int j = 0; j <= n; ++j){
            if(!visited[j] && streets[u][j] != 0){
                if(dis[j] > dis[u] + streets[u][j]){
                    dis[j] = dis[u] + streets[u][j];
                    pre[j].clear();
                    pre[j].push_back(u);
                }
                else if(dis[j] == dis[u] + streets[u][j]) pre[j].push_back(u);
            }
        }
    }

    dfs(sp);

    printf("%d 0", minNeed);
    for(int i = ans.size() - 2; i >= 0; --i) printf("->%d", ans[i]);
    printf(" %d\n", minBack);

    return 0;
}