JZOJ P5771. 【NOIP2008模拟】遨游

---

题目：

传送门

---

分析：

看起来好像用各种最短路，但其实并不用
首先，预处理出所有路段在省级优惠后的价格
然后二分最便宜的路段，在用并查集看下$s$和$t$是否连通

---

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>  
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
#define h happy
#define ch cheap
#define XJQ 99999999
#define HSZGB 还是欠老子400块 
using namespace std;
inline LL read() {
    LL d=0,f=1;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
    return d*f;
}
int min(int x,int y) {return x>y?y:x;}
struct node{
	int x,y;double w;
}x[100005];
bool cmp(node x,node y){return x.w<y.w;}
int f[50005],ch[50005];
int find(int x) {return f[x]==x?x:f[x]=find(f[x]);}
int main()
{
	int n=read(),m=read();
	for(int i=1;i<=m;i++)
		x[i].x=read(),x[i].y=read(),scanf("%lf",&x[i].w);
	int cnt=0,city[50005];
	for(int i=1;i<=n;i++)
	{
		int t=read();cnt+=t;
		for(int j=1;j<=t;j++)
		  {int king=read();city[king]=i;}
	}
	for(int i=1;i<=n;i++) ch[i]=read();
	for(int i=1;i<=m;i++)
	{
		double money;
		if(city[x[i].x]==city[x[i].y]) 
			money=x[i].w*(double)ch[city[x[i].x]]/100;
		else money=(double)x[i].w*((double)ch[city[x[i].x]]/100+(double)ch[city[x[i].y]]/100)/2;
		x[i].w=money;
	}
	int s=read(),t=read();
	sort(x+1,x+1+m,cmp);
	int l=1,r=m;
	int ans1=0,ans2=99999999;
	while(l<r)
	{
		int mid=(l+r)>>1;
		for(int i=1;i<=cnt;i++) f[i]=i;
		int i;
		for(i=mid;i<=m;i++)
		{
			int fr=x[i].x,to=x[i].y;
			if(find(fr)!=find(to)) f[find(fr)]=find(to);
			if(find(s)==find(t)) break; 
		}
		if(find(s)!=find(t)) r=mid;
		else
		{
			l=mid+1;
			int k1=(int)x[mid].w,k2=(int)x[i].w+1;
			if(k1>ans1) ans1=k1,ans2=k2;
			else if(k1==ans1) ans2=min(ans2,k2);
		}
	}
	printf("%d %d",ans1,ans2);
	return 0;
}