2020 GDUT Rating Contest I (Div. 2) F - Milk Pumping 题解

原题

题目大意

有n个城市，m条管道，每条管道有一个价值和流速，要找到一个 最小流速/费用和 最大的解决方案，输出答案*1e6的下取整

题目分析

明显是最短路嘛……这题没过的原因就是看题不认真(英语太差)，不知道truncated是什么意思……

当然这不是一条裸的最短路，因为要 最小流速/费用和 最大，也就是要让最小流速尽量大而费用和尽量小，所以我们先把最大的最小流速二分出来，再求出费用和

#include<cstdio>
#include<cstring>
#define max(a,b) (a > b ? a : b)
#define min(a,b) (a < b ? a : b)
 
typedef struct pipe
{
    int e;
    int c,f;
};
 
int head[4001],next[4001],nt = 0;
pipe data[4001];
int f[10011],fs,ft;
int mindis[1011];
bool been[1011];
double ans = 0.0;
int main()
{
    int n,m;
    memset(head,0xff,sizeof(head));
    scanf("%d%d",&n,&m);
    for (int i = 0;i < m;i++)
    {
        int a,b,c,f;
        scanf("%d%d%d%d",&a,&b,&c,&f);
        data[nt].e = b,data[nt].c = c,data[nt].f = f;
        next[nt] = head[a],head[a] = nt++;
        data[nt].e = a,data[nt].c = c,data[nt].f = f;
        next[nt] = head[b],head[b] = nt++;
    }
    int l = 1,r = 1000;
    while (l <= r)
    {
        int mid = (l + r) >> 1,minc = 0x3f3f3f3f;
        memset(mindis,0x3f,sizeof(mindis));
        fs = 0,ft = 0;
        f[ft++] = 1;mindis[1] = 0;
        while (fs < ft)
        {
            for (int i = head[f[fs]];i != -1;i = next[i])
            {
                if (data[i].f < mid) continue;
                if (mindis[data[i].e] > mindis[f[fs]] + data[i].c)
                {
                    f[ft++] = data[i].e;
                    mindis[data[i].e] = mindis[f[fs]] + data[i].c;
                }
            }
            ++fs;
        }
        if (mindis[n] < 0x3f3f3f3f) l = mid + 1,ans = max(ans,(double)mid / mindis[n]);
        else r = mid - 1;
    }
    printf("%.0lf",ans * 1000000);
    return 0;
}

当然就不是答案了啊，怎么可能让一个数最大另一个数就保证最小，况且这里还是四舍五入……
然后我就将流速从下限跑到上限，把最大的答案提取出来，就是最终的答案了，记住截尾哦

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#define max(a,b) (a > b ? a : b)
#define min(a,b) (a < b ? a : b)
 
typedef struct pipe
{
    int e;
    int c,f;
};
 
int head[4001],next[4001],nt = 0;
pipe data[4001];
int f[10011],fs,ft;
int mindis[1011];
bool been[1011];
double ans = 0.0;
int minf = 0x3f3f3f3f;
int main()
{
    int n,m;
    memset(head,0xff,sizeof(head));
    scanf("%d%d",&n,&m);
    for (int i = 0;i < m;i++)
    {
        int a,b,c,f;
        scanf("%d%d%d%d",&a,&b,&c,&f);
        data[nt].e = b,data[nt].c = c,data[nt].f = f;
        next[nt] = head[a],head[a] = nt++;
        data[nt].e = a,data[nt].c = c,data[nt].f = f;
        next[nt] = head[b],head[b] = nt++;
        minf = min(minf,f),been[f] = true;
    }
    int l = 1,r = 1000;
    while (l <= r)
    {
        int mid = (l + r) >> 1,minf = 0x3f3f3f3f;
        memset(mindis,0x3f,sizeof(mindis));
        fs = 0,ft = 0;
        f[ft++] = 1;mindis[1] = 0;
        while (fs < ft)
        {
            for (int i = head[f[fs]];i != -1;i = next[i])
            {
                if (data[i].f < mid) continue;else minf = min(minf,data[i].f);
                if (mindis[data[i].e] > mindis[f[fs]] + data[i].c)
                {
                    f[ft++] = data[i].e;
                    mindis[data[i].e] = mindis[f[fs]] + data[i].c;
                }
            }
            ++fs;
        }
        if (mindis[n] < 0x3f3f3f3f) l = mid + 1,ans = max(ans,(double)minf / mindis[n]);
        else r = mid - 1;
    }
    for (int xcf = minf;xcf < r;xcf++)
    {
        minf = 0x3f3f3f3f;
        if (not been[xcf]) continue;
        memset(mindis,0x3f,sizeof(mindis));
        fs = 0,ft = 0;
        f[ft++] = 1;mindis[1] = 0;
        while (fs < ft)
        {
            for (int i = head[f[fs]];i != -1;i = next[i])
            {
                if (data[i].f < xcf) continue;
                if (mindis[data[i].e] > mindis[f[fs]] + data[i].c)
                {
                    f[ft++] = data[i].e;
                    mindis[data[i].e] = mindis[f[fs]] + data[i].c;
                }
            }
            ++fs;
        }
        if (mindis[n] < 0x3f3f3f3f) ans = max(ans,(double)xcf / mindis[n]);
    }
    ans = trunc(ans * 1000000);
    printf("%.0f",ans);
    return 0;
}

ps：其实不用前向星存图的，数据规模挺小的