eoj 1848 你是ACM吗？

有N个点，求点1到其余N-1点的最小环路之和.

无向图中的最小环可用floyd变式方法求得，有向图中的最小环可用两次dij求.

#include <iostream>
#include <cstdio>
#include <map>
#include <queue>
#include <vector>
using namespace std;

/*  用到的还是最基本的dij方法，求点1到点2,3...n-1套用模版就行
    在求点2,3...n-1到点1的最短路时若使用n-1次dij则会超时(这样
    做的复杂度也就类似与floyd方法)，正确的处理方法是反向建边，
    再用一次dij就可得答案*/

struct edge
{
    int to;
    long long dist;
    edge(int v, long long d) :
        to(v), dist(d) {}
};


struct node
{
    int from;
    long long d;
    node(long long dd, int too):
        d(dd), from(too) {}
    bool operator < (const node& rhs) const{
        return d > rhs.d;
    }
};

const int maxn = 1e6;
const int inf = 0x3f3f3f3f;
vector <edge> edges[maxn];
vector <edge> edges2[maxn];
int d[maxn];
int n;

void dijkstra(int s)
{
    priority_queue <node> q;
    for (int i = 0; i != n; ++i)
        d[i] = inf;
    d[s] = 0;

    q.push(node(0,s));

    while (!q.empty())
    {
        node x = q.top();
        q.pop();

        if (x.d != d[x.from])
            continue;

        for (int i = 0; i != edges[x.from].size(); ++i)
        {
            edge& e = edges[x.from][i];  
            if (d[e.to] > d[x.from] + e.dist)
            {
                d[e.to] = d[x.from] + e.dist;
                q.push(node(d[e.to], e.to));
            }
        }
    }
}

void dijkstra2(int s)
{
    priority_queue <node> q;
    for (int i = 0; i != n; ++i)
        d[i] = inf;
    d[s] = 0;

    q.push(node(0,s));

    while (!q.empty())
    {
        node x = q.top();
        q.pop();

        if (x.d != d[x.from])
            continue;

        for (int i = 0; i != edges2[x.from].size(); ++i)
        {
            edge& e = edges2[x.from][i];  
            if (d[e.to] > d[x.from] + e.dist)
            {
                d[e.to] = d[x.from] + e.dist;
                q.push(node(d[e.to], e.to));
            }
        }
    }
}


int main()
{
    int k;
    int ss;
    cin >> ss;
    while (ss--)
    {
        scanf("%d%d",&n,&k);
        int p1, p2;
        long long dis;
        for (int i = 0; i != k; ++i)
        {
            scanf("%d%d%I64d",&p1,&p2,&dis);
            edges[p1-1].push_back(edge(p2-1,dis)); 
            edges2[p2-1].push_back(edge(p1-1,dis));  //另开一个vector反向建边
        }

        dijkstra(0);   //调用两次dij
        long long ans = 0;
        for (int i = 0; i != n; ++i)
            ans += d[i];
        dijkstra2(0);
        for (int i = 1; i != n; ++i)
            ans += d[i];

        cout << ans << endl;
        
        for (int i = 0; i != k; ++i)
            {
                edges[i].clear();
                edges2[i].clear();
            }
    }
    return 0;
}