bzoj 1050 题解

sort+并查集

Code：

/**************************************************************
    Problem: 1050
    User: wohenshuai
    Language: C++
    Result: Accepted
    Time:912 ms
    Memory:1452 kb
****************************************************************/
 
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
  int x,y,d,next;
}a[11000]; int len,first[510];
int n,m;
void ins(int x,int y,int d)
{
  len++; a[len].x=x; a[len].y=y; a[len].d=d;
  a[len].next=first[x]; first[x]=len;
}
bool Cmp(node x,node y){return x.d<y.d;}
int st,ed;
void Input()
{
  scanf("%d%d",&n,&m);
  len=0; memset(first,0,sizeof(first));
  for(int i=1;i<=m;i++)
  {
    int x,y,d;
    scanf("%d%d%d",&x,&y,&d);
    ins(x,y,d);
  }
  sort(a+1,a+len+1,Cmp);
  scanf("%d%d",&st,&ed);
}
int fa[510];
int find(int x)
{
  if(fa[x]==x) return x;
  else return fa[x]=find(fa[x]);
}
double ans; int x,y;
int gcd(int ka,int kb)
{
  if(kb==0) return ka;
  else return gcd(kb,ka%kb);
}
void Solve()
{
  ans=9999999; x=9999999; y=9999999;
  for(int i=1;i<=len;i++)
  {
    int l,r;
    l=i; r=999999;
    for(int j=1;j<=n;j++) fa[j]=j;
    for(int j=i;j<=len;j++)
    {
      int fax=find(a[j].x); int fay=find(a[j].y);
      fa[fax]=fay;
      if(find(st)==find(ed))
      {
        r=j;
        break;
      }
    }
    if(r!=999999)
    {
      int s=a[r].d; int t=a[l].d;
      if(((s*1.0)/(t*1.0))<ans)
      {
        int k=gcd(s,t);
        x=s/k; y=t/k;
        ans=(s*1.0)/(t*1.0);
      }
    }
    else break;
  }
}
void Output()
{
  if(x==9999999&&y==9999999){printf("IMPOSSIBLE\n"); return ;}
  int p=(int)(ans);
  if(ans-p<1&&ans-p>0) printf("%d/%d\n",x,y);
  else printf("%.0lf\n",ans);
}
int main()
{
  Input();
  Solve();
  Output();
  return 0;
}