P5837 [USACO19DEC] Milk Pumping G

#include<bits/stdc++.h>
#define pb push_back
#define PII pair<int,pair<int,int> >
#define Pii pair<int,int >
#define int long long
#define fi first
#define se second
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
 
using namespace std;
 
const int N = 1e5;
int n,m;
int dist[N];
int vis[N]; 
vector<PII>e[N];
int check(int mid)
{
	for(int i=1;i<=n;i++) dist[i]=1e18,vis[i]=0;
	priority_queue<Pii,vector<Pii>,greater<Pii>>q;
	q.push({0,1});
	dist[1]=0;
	while(q.size())
	{
		auto t=q.top();
		q.pop();
		int now=t.se;
		if(vis[now]) continue;
		vis[now]=1;
		for(auto tt:e[now])
		{
			int spot=tt.fi,c=tt.se.fi,f=tt.se.se;
			if(dist[spot]>dist[now]+c&&f>=mid)
			{
				dist[spot]=dist[now]+c;
				q.push({dist[spot],spot});
			}
		}
	}
	return (dist[n]!=1e18);	
}
signed main()
{
    IOS;
  	cin>>n>>m;
  	while(m--)
	{
  		int a,b,c,f;
  		cin>>a>>b>>c>>f;
  		e[a].pb({b,{c,f}});
  		e[b].pb({a,{c,f}});
	}
	int maxn=-1e18;
	for(int i=1;i<=1000;i++)
	{
		if(check(i))
		{
			int now=(double)i/dist[n]*1e6;
			maxn=max(maxn,now);
		}
	}
	cout<<maxn;
	return 0;
}