HDU 1839 Delay Constrained Maximum Capacity Path

目测二分正确是因为容量限制越大可选的边就越少，酱紫满足一个大概的单调性，然后去二分得到结果……

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;
const __int64 INF = 0x7f7f7f7f7f7f7f7fll;

#define   mark(a) cout<<"a"<<endl;

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define gret(a,b) (((a)-(b))>eps)
#define less(a,b) (((b)-(a))>eps)
#define greq(a,b) (((a)-(b))>-eps)
#define leeq(a,b) (((b)-(a))>-eps)
#define equl(a,b) (fabs((a)-(b))<eps)

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (gret(a,b)?(a):(b))
#define fmin(a,b) (less(a,b)?(a):(b))

const int MAXV = 12000;
const int MAXE = 120000;

struct node
{
    int v,w,c;
}G[MAXE];
int _index,pre[MAXV],next[MAXE];

void clear(void)
{
    _index=0;
    memset(pre,-1,sizeof(pre));
}
void add(int u,int v,int w,int c)
{
    G[_index].v=v;
    G[_index].w=w;
    G[_index].c=c;
    next[_index]=pre[u];
    pre[u]=_index++;
}

bool inQ[MAXV];
int dis[MAXV],Q[MAXV];

int SPFA(int src,int des,int cap)
{
    int u,v,w;
    memset(dis,inf,sizeof(dis));
    memset(inQ,false,sizeof(inQ)); Q[dis[src]=0]=src;

    for(int f=0,r=1;f!=r;f=(f+1)%MAXV)
    {
        inQ[u=Q[f]]=false;
        for(int i=pre[u];i!=-1;i=next[i])
        {
            v=G[i].v;
            w=G[i].w;
            if(G[i].c>=cap&&dis[v]>dis[u]+w)
            {
                dis[v]=dis[u]+w;
                if(!inQ[v])
                {
                    inQ[Q[r]=v]=true;
                    r=(r+1)%MAXV;
                }
            }
        }
    }

    return dis[des];
}

int tcase,n,m,t,u,v,w,c;

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("Delay Constrained Maximum Capacity Path.txt","r",stdin);
    #endif

    scanf("%d",&tcase);while(tcase--)
    {
        clear();
        scanf("%d %d %d",&n,&m,&t);

        int Max=0,Min=inf;
        for(int i=0;m>i;i++)
        {
            scanf("%d %d %d %d",&u,&v,&c,&w);
            add(u,v,w,c);
            add(v,u,w,c);
            Max=max(Max,c);
            Min=min(Min,c);
        }
        int Mid,Ans;
        while(Min<=Max)
        {
            Mid=(Min+Max)/2;
            if(SPFA(1,n,Mid)<=t) Min=(Ans=Mid)+1;
            else Max=Mid-1;
        }
        printf("%d\n",Ans);
    }
    return 0;
}