POJ ~ 2387 ~ Til the Cows Come Home（Dijkstra）

题意：求无向图1~n的最短路。n个点m条边，然后m行，每行输入u~v的边权为w。

思路：Dijkstra。注意有重边，M和N输入顺序是反着的，先输入边数M，在输入顶点数N。懒得写了，直接怼模板就过了。

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int MAXN = 1e5 + 6;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, dist;       //起点,终点,距离
    Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};

struct Dijkstra
{
    int n, m;                 //结点数,边数(包括反向弧)
    vector<Edge> edges;       //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];      //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int vis[MAXN];            //标记数组
    int d[MAXN];              //s到各个点的最短路
    int pre[MAXN];            //上一条弧

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void add_edge(int from, int to, int dist)
    {
        edges.push_back(Edge(from, to, dist));
        m = edges.size();
        G[from].push_back(m - 1);
    }

    void dijkstra(int s)
    {
        for (int i = 0; i <= n; i++) d[i] = INF;
        d[s] = 0;
        memset(vis, 0, sizeof(vis));
        for (int i = 1; i <= n; i++)
        {
            int  pos, MIN = INF;
            for (int j = 1; j <= n; j++)
            {
                if(!vis[j] && d[j] <= MIN) MIN = d[pos = j];
            }
            vis[pos] = true;
            for (int j = 0; j < G[pos].size(); j++)
            {
                Edge& e = edges[G[pos][j]];
                if (d[e.to] > d[pos] + e.dist)
                {
                    d[e.to] = d[pos] + e.dist;
                    pre[e.to] = G[pos][j];
                }
            }
        }
    }
};
Dijkstra solve;
int main()
{
    int n, m;
    while (~scanf("%d%d", &m, &n))
    {
        solve.init(n);
        while (m--)
        {
            int u, v, w;
            scanf("%d%d%d", &u, &v, &w);
            solve.add_edge(u, v, w);
            solve.add_edge(v, u, w);
        }
        solve.dijkstra(n);
        printf("%d\n", solve.d[1]);
    }
    return 0;
}
/*
5 5
1 2 20
2 3 30
3 4 20
4 5 20
1 5 100
*/
//Answer:90