POJ - 1502 MPI Maelstrom

题目链接

题意：有n个基站，给定m条线路，线路上有不同的时间，从1号基站开始发送信息，当每一个基站接到信息时，它同时向其他基站发送信息，问多久能传输给所有基站。

思路：dijkstra裸题，堆优化写就行。

#pragma GCC optimize(2)
#include<map>
#include<queue>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

#define fi first
#define se second
#define ff double
//#define int long long
#define PII pair<int,int>
#define all(x) x.begin(),x.end()
#define debug(x) cout << x << endl
#define mem(a,b) memset(a,b,sizeof(a))

const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 2e4 + 5;
int n, m, dis[N], vis[N];
int h[N], e[N], w[N], ne[N], idx;
void add(int a, int b, int c){e[idx] = b; w[idx] = c;ne[idx] = h[a]; h[a] = idx ++;}
void dij(){
    mem(dis, INF); mem(vis, 0);
    dis[1] = 0;
    priority_queue<PII, vector<PII>, greater<PII> > q;
    q.push({0, 1});
    while(q.size()){
        PII t = q.top(); q.pop();
        int v = t.se, d = t.fi;
        if(vis[v]) continue;
        vis[v] = 1;
        for(int i = h[v]; i != -1;i = ne[i]){
            int j = e[i];
            if(dis[j] > w[i] + d){
                dis[j] = w[i] + d; 
                q.push({dis[j], j});
            }   
        }
    }
    return;
}
signed main() {
    mem(h, -1); idx = 0;
    cin >> n;
    for(int i = 2;i <= n;i ++)
        for(int j = 1;j < i;j ++){
            char u[5];
            cin >> u;
            if(strcmp(u,"x") != 0){//（不要写成u != "x"） 我是伞兵
                add(i, j, atoi(u));
                add(j, i, atoi(u));
            }
        }
        dij();
        int ans = 0;
        for(int i = 1;i <= n;i ++)
            ans = max(ans, dis[i]);
        cout << ans << endl;
}