ZOJ 2281
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2281
这道题由于点数太多边数太多所以直接跑dijkstra会各种MLE,SPFA是肯定要挂的。
所以因为只要找一种方案且是最优的条件,所以用优先队列或者堆优化即可。
1,我们每次从队列取出边权最大的边,也就是now.point与他的前驱所连起来的边的边权最大,这里已经进行了选择,即流量的最大值(这个选择判断条件就是要改最短路里面松弛的地方)。
2,用最大流量的这条边去找他旁边的节点,松弛,如果旁边这个节点next.point的dis小于min(now.val, next.val),那么就更新他,并且把它加入队列。
3,如果出队列的节点就是终点,即可退出。
代码如下:
#include<bits/stdc++.h>
using namespace std;
const int maxm = 1000005;
const int maxn = 100005;
const int INF = 0x7fffffff;
int head[maxm], front[maxm], to[maxm], vst[maxn], p;
int value[maxm];
int dis[maxn];
int n, m;
struct node
{
int v;
int val;
node(){}
node(int b, int c)
{
v = b;
val = c;
}
bool operator < (const node a)const
{
if(val == a.val)
return v < a.v;
return val < a.val;
}
};
void add(int u, int v, int val)
{
front[p] = head[u];
to[p] = v;
value[p] = val;
head[u] = p++;
}
void bfs(int s, int e)
{
int t;
for(int i = 0; i <= n; i++)
dis[i] = 0;
node now, next;
priority_queue <node> q;
q.push(node(s, INF));
while(!q.empty())
{
now = q.top();
q.pop();
if(now.v == e)
break;
for(int i = head[now.v]; ~i; i = front[i])
{
t = min(value[i], now.val);
if(dis[ to[i] ] < t)
{
dis[ to[i] ] = t;
q.push(node(to[i], t));
}
}
}
cout << dis[e] << endl;
}
int main()
{
int u, v;
int val;
while(cin >> n >> m)
{
p = 0;
memset(head, -1, sizeof(head));
memset(vst, 0, sizeof(vst));
for(int i = 0; i < m; i++)
{
scanf("%d%d%d", &u, &v, &val);
add(u, v, val);
add(v, u, val);
}
scanf("%d%d", &u, &v);
bfs(u, v);
}
return 0;
}
POJ 1797
一样的意思,直接把上面代码改一改就行了。
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int maxm = 1000005;
const int maxn = 1005;
const int INF = 0x7fffffff;
int head[maxm], front[maxm], to[maxm], vst[maxn], p;
int value[maxm];
int dis[maxn];
int n, m;
struct node
{
int v;
int val;
node(){}
node(int b, int c)
{
v = b;
val = c;
}
bool operator < (const node a)const
{
if(val == a.val)
return v < a.v;
return val < a.val;
}
};
void add(int u, int v, int val)
{
front[p] = head[u];
to[p] = v;
value[p] = val;
head[u] = p++;
}
void bfs(int s, int e)
{
int t;
for(int i = 0; i <= n; i++)
dis[i] = 0;
node now, next;
priority_queue <node> q;
q.push(node(s, INF));
while(!q.empty())
{
now = q.top();
q.pop();
if(now.v == e)
break;
for(int i = head[now.v]; ~i; i = front[i])
{
t = min(value[i], now.val);
if(dis[ to[i] ] < t)
{
dis[ to[i] ] = t;
q.push(node(to[i], t));
}
}
}
cout << dis[e] << endl;
}
int main()
{
int T, u, v, k = 1;
int val;
cin >> T;
while(T--)
{
cin >> n >> m;
p = 0;
memset(head, -1, sizeof(head));
memset(vst, 0, sizeof(vst));
for(int i = 0; i < m; i++)
{
scanf("%d%d%d", &u, &v, &val);
add(u, v, val);
add(v, u, val);
}
// scanf("%d%d", &u, &v);
printf("Scenario #%d:\n", k++);
bfs(1, n);
if(T)
cout << endl;
}
return 0;
}