poj 1511 Invitation Cards

Description
In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the necessary information and with the programme. A lot of students were hired to distribute these invitations among the people. Each student volunteer has assigned exactly one bus stop and he or she stays there the whole day and gives invitation to people travelling by bus. A special course was taken where students learned how to influence people and what is the difference between influencing and robbery.

The transport system is very special: all lines are unidirectional and connect exactly two stops. Buses leave the originating stop with passangers each half an hour. After reaching the destination stop they return empty to the originating stop, where they wait until the next full half an hour, e.g. X:00 or X:30, where ‘X’ denotes the hour. The fee for transport between two stops is given by special tables and is payable on the spot. The lines are planned in such a way, that each round trip (i.e. a journey starting and finishing at the same stop) passes through a Central Checkpoint Stop (CCS) where each passenger has to pass a thorough check including body scan.

All the ACM student members leave the CCS each morning. Each volunteer is to move to one predetermined stop to invite passengers. There are as many volunteers as stops. At the end of the day, all students travel back to CCS. You are to write a computer program that helps ACM to minimize the amount of money to pay every day for the transport of their employees.

Input
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case begins with a line containing exactly two integers P and Q, 1 <= P,Q <= 1000000. P is the number of stops including CCS and Q the number of bus lines. Then there are Q lines, each describing one bus line. Each of the lines contains exactly three numbers - the originating stop, the destination stop and the price. The CCS is designated by number 1. Prices are positive integers the sum of which is smaller than 1000000000. You can also assume it is always possible to get from any stop to any other stop.

Output
For each case, print one line containing the minimum amount of money to be paid each day by ACM for the travel costs of its volunteers.
题目要求求源点到每个节点的最短路径和每个节点到源点的最短路径
两次spfa + queue实现
注意：
要用scanf 大数据读写
vis、dist、edgehead数组记得初始化
两次spfa 第二次反转了指向

//spfa queue 数组实现静态链表
/*
这个题目中用数组模拟实现邻接表 ,一个edge数组用来存放所有的边

*/
#include<iostream>
#include<stdio.h>
#include<queue>

#include<cstring>
using namespace std;
const int N = 1000005;
const long long  INF = 1e10;

//边： u-->v，权重为w,  类似于邻接表中的边数据结构
struct{
    int v;// 边的终点
    int w;//边的权重
    int next;//从起点v出发的另外一条边 在数组edge中的位置 edge[next]
}edge[N];
int a[N][3];//存放输入
//类似于邻接表中的起点数据结构 edgehead[v] = k;说明节点v的第一条边所在的位置为k
int edgehead[N];
int k = 1;//用来记录边的节点数组 其实就是存入edge数组中的下标
long long int dist[N];
bool vis[N];
void init(int nodes){
    k = 1;
    memset(edgehead,0,sizeof(edgehead));
    memset(edge,0,sizeof(edge));
    for(int i = 1; i <= nodes; i++){
        dist[i] = INF;
    }

}
//头插法
void addEdge(int u,int v,int w){
    //存入边的信息
    edge[k].v = v;
    edge[k].w = w;
    //头插法 并且移动k
    edge[k].next = edgehead[u];
    edgehead[u] = k++;
}
//spfa
long long spfa(int nodes,int start){

    queue<int> q; //q中有元素表示该图还可以进行松弛
    //初始化
    dist[start] = 0;
    q.push(start);
    while(!q.empty()){
        int n = q.front();
        q.pop();
        vis[n] = false;
        //i表示节点的下标
        for(int i = edgehead[n];i; i = edge[i].next){
            int v = edge[i].v;
            int w = edge[i].w;
            if(dist[v] > dist[n] + w){ //注意这里 判断是否可以松弛 不能判断是否在队列中
                dist[v] = dist[n] + w;
                if(!vis[v]){ //优化 避免重复加入
                    q.push(v);
                    vis[v] = true;
                }
            }
        }
    }
    long long ans = 0;
    for(int i = 1; i <= nodes; i++){
        ans += dist[i];
    }
    return ans;
}
int main(){

    int nodes,Q,cases;
    cin>>cases;

    while(cases--){
        scanf("%d %d",&nodes,&Q);
        init(nodes);
        for(int i = 0; i < Q;i++){
            scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
            addEdge(a[i][0],a[i][1],a[i][2]);
        }

        long long ans = spfa(nodes,1);
        init(nodes);
        for(int i = 0; i < Q; i++){
            addEdge(a[i][1],a[i][0],a[i][2]);
        }
        ans += spfa(nodes,1);
        cout<<ans<<endl;

    }


}