POJ 3268 Silver Cow Party(dij堆优化)
Solution
吐了这个POJ的评测机。。
一道 dij 模板题,我用了堆优化
建两张图跑两次 dij 即可,没啥要注意的细节
代码
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<queue>
#include<set>
//#define int long long
using namespace std;
typedef pair<int, int> pii;
typedef double dd;
typedef long long ll;
const int MAXN = 1010;
const int MAXM = 100010;
const dd eps = 1e-6;
const int inf = 0x3f3f3f3f;
struct TY{
int v, w, nxt;
}e[MAXM << 1];
int n, m, x;
int head[2][MAXN], cnt, dis[2][MAXN];
bool vis[MAXN];
void add(int u,int v,int w, int head[]){
e[++cnt].nxt = head[u];
e[cnt].v = v;
e[cnt].w = w;
head[u] = cnt;
}
void dij(int s, int dis[], int head[])
{
memset(vis, 0, sizeof(vis));
priority_queue<pii,vector<pii>,greater<pii> > q;
q.push(pii(0, s));
dis[s] = 0;
while(q.size())
{
int u = q.top().second;
q.pop();
if(vis[u])
continue;
vis[u] = 1;
for (int i = head[u]; i; i = e[i].nxt)
{
int v = e[i].v, w = e[i].w;
if(dis[v] > dis[u] + w)
{
dis[v] = dis[u] + w;
q.push(pii(dis[v], v));
}
}
}
}
int main()
{
cin >> n >> m >> x;
memset(dis, 0x3f, sizeof(dis));
for (int i = 1; i <= m; i++)
{
int u, v, w;
cin >> u >> v >> w;
add(u, v, w, head[0]);
add(v, u, w, head[1]);
}
dij(x, dis[0], head[0]);
dij(x, dis[1], head[1]);
int mx = 0;
for (int i = 1; i <= n;i++)
if(dis[0][i] != inf && dis[1][i] != inf) //实测这个 if 加不加都行,貌似没有不可到达的点
mx = max(mx, dis[0][i] + dis[1][i]);
printf("%d", mx);
}