ccf 交通规划

这道题目不能用邻接矩阵实现，会超内存。
我用的是优先队列。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
const int N = 10001;
int cost[N];
int dis[N];
int visit[N];
int n,m;
struct Edge{
    int to,cost;
    Edge(int to, int cost):to(to),cost(cost){};
};
struct Item{
    int v;
    int dis;//每个节点到出发点的距离
    Item(int v,int dis):v(v),dis(dis){};
    friend bool operator<(Item item, Item item1){
        return item.dis > item1.dis;
    }
};
vector<Edge> vector1[N];
priority_queue<Item> pq;

void dij(){
    dis[1] = cost[1] = 0;
    pq.push(Item(1,0));
    Item temp(0,0);
    int index = 0;
    while(!pq.empty()){
        temp = pq.top();
        pq.pop();
        int v = temp.v;
        if (!visit[v]){
            visit[v] = true;
            index++;
            if (index == n) break;
            for (int i = 0; i < vector1[v].size(); ++i) {
                int vv = vector1[v][i].to;
                if (visit[vv]) continue;
                if (dis[vv]>dis[v]+vector1[v][i].cost){
                    dis[vv] =  dis[v]+vector1[v][i].cost;
                    cost[vv] = vector1[v][i].cost;
                    pq.push(Item(vv,dis[vv]));
                } else if (dis[vv]== dis[v]+vector1[v][i].cost){
                    cost[vv] = min(cost[vv],vector1[v][i].cost);
                }
            }
        }
    }
}
int main(){
    memset(dis,0x7f, sizeof(dis));
    memset(visit,false, sizeof(visit));
    memset(cost,0x7f, sizeof(cost));
    scanf("%d %d",&n,&m);
    int a,b,c;
    for (int i = 0; i < m; ++i) {
        scanf("%d %d %d",&a,&b,&c);
        vector1[a].push_back(Edge(b,c));
        vector1[b].push_back(Edge(a,c));
    }
    dij();
    int res = 0;
    for (int i = 2; i <= n; i++) {
        res += cost[i];
    }
    cout << res << endl;

    return 0;
}