题目大意:给一个无向图,每条边有权值,给出终点t和起点s,要求在满足从s到t的路上边权最大的最小,选出从s到t的最短路;
感想:辣鸡出题人卡我常数。小到大排序,先用并查集维护,直到s于t联通时退出,记录这时的权值ans,他一定是s到t边权最大的边的最小值,把权值小于ans的边建图,跑一边DIJ。然而我写的spfa,至于为什么不写DIJ,是因为DIJ复杂度nlogn,数据给的1e6,加个log我有点慌,然后又想到在稀疏图上spfa好像跑的贼快,渐进o(n),于是聪明(zuosi)的写了spfa+向前星,测了几组大数据也跑的飞快,感觉很稳,结果被卡飞了。事实告诉我们在无负权的情况下,一定写DIJ,一定不会被卡的。
# include <iostream>
# include <cstdio>
# include <cstring>
# include <queue>
# include <algorithm>
using namespace std;
typedef long long ll;
ll read()
{
ll i=0;char ch=getchar();
while(ch<'0'||ch>'9')
{
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
i=(i<<3)+(i<<1)+ch-'0';
ch=getchar();
}
return i;
}
int buf[1024];
inline void write(long long x){
if(!x){putchar('0');return ;}
if(x<0){putchar('-');x=-x;}
while(x){buf[++buf[0]]=x%10,x/=10;}
while(buf[0]) putchar(buf[buf[0]--]+48);
return ;
}
const int N=1000005;
const int M=500005;
struct node{
int u,v,w,c;
friend bool operator <(const node &a,const node &b){
return a.w<b.w;
}
}E[N];
struct data
{
ll v,next,w;
}edge[N<<1];
int n,m,t,c,x,y,S,T,ans,cnt;
int fa[M],first[M];
ll dis[N];
priority_queue<pair<ll,int> >q;
int getfa(int x){
return x==fa[x] ? x : getfa(fa[x]);
}
inline void AddEdge(int x,int y,int t,int c)
{
edge[++cnt].next=first[x];first[x]=cnt;
edge[cnt].v=y;edge[cnt].w=(ll)t*c;
}
inline void DIJ(){
memset(dis,0x3f,sizeof(dis));
dis[S]=0;
q.push(make_pair(-dis[S],S));
while(!q.empty()){
int u=q.top().second;q.pop();
if(u==T) break;
for(register int i=first[u];i;i=edge[i].next){
int v=edge[i].v;
if(dis[v]>dis[u]+edge[i].w){
dis[v]=dis[u]+edge[i].w;q.push(make_pair(-dis[v],v));
}
}
}
}
inline void work2(){
sort(E+1,E+m+1);
for(register int i=1;i<=n;++i) fa[i]=i;
for(register int i=1;i<=m;++i){
x=getfa(E[i].u);y=getfa(E[i].v);
if(x!=y){
fa[x]=y;ans=E[i].w;
if(getfa(S)==getfa(T)) break;
}
}
for(register int i=1;i<=m;++i)
{
if(E[i].w>ans)break;
AddEdge(E[i].u,E[i].v,E[i].w,E[i].c);
AddEdge(E[i].v,E[i].u,E[i].w,E[i].c);
}
DIJ();
write(ans);putchar(' ');write(dis[T]);
}
int main(){
n=read(),m=read();
int res=0,ret=0;
for(register int i=1;i<=m;++i){
x=read(),y=read();t=read(),c=read();
E[i].u=x,E[i].v=y;E[i].w=t;E[i].c=c;
}
S=read(),T=read();work2();
}