[USACO07DEC]观光奶牛Sightseeing Cows

                             [USACO07DEC]观光奶牛Sightseeing Cows

题目描述

Farmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows must decide how best to spend their free time.

Fortunately, they have a detailed city map showing the L (2 ≤ L ≤ 1000) major landmarks (conveniently numbered 1.. L) and the P (2 ≤ P ≤ 5000) unidirectional cow paths that join them. Farmer John will drive the cows to a starting landmark of their choice, from which they will walk along the cow paths to a series of other landmarks, ending back at their starting landmark where Farmer John will pick them up and take them back to the farm. Because space in the city is at a premium, the cow paths are very narrow and so travel along each cow path is only allowed in one fixed direction.

While the cows may spend as much time as they like in the city, they do tend to get bored easily. Visiting each new landmark is fun, but walking between them takes time. The cows know the exact fun values Fi (1 ≤ Fi ≤ 1000) for each landmark i.

The cows also know about the cowpaths. Cowpath i connects landmark L1i to L2i (in the direction L1i -> L2i ) and requires time Ti (1 ≤ Ti ≤ 1000) to traverse.

In order to have the best possible day off, the cows want to maximize the average fun value per unit time of their trip. Of course, the landmarks are only fun the first time they are visited; the cows may pass through the landmark more than once, but they do not perceive its fun value again. Furthermore, Farmer John is making the cows visit at least two landmarks, so that they get some exercise during their day off.

Help the cows find the maximum fun value per unit time that they can achieve.

作为对奶牛们辛勤工作的回报，Farmer John决定带她们去附近的大城市玩一天。旅行的前夜，奶牛们在兴奋地讨论如何最好地享受这难得的闲暇。 很幸运地，奶牛们找到了一张详细的城市地图，上面标注了城市中所有L(2 <= L <= 1000)座标志性建筑物（建筑物按1..L顺次编号），以及连接这些建筑物的P(2 <= P <= 5000)条道路。按照计划，那天早上Farmer John会开车将奶牛们送到某个她们指定的建筑物旁边，等奶牛们完成她们的整个旅行并回到出发点后，将她们接回农场。由于大城市中总是寸土寸金，所有的道路都很窄，政府不得不把它们都设定为通行方向固定的单行道。 尽管参观那些标志性建筑物的确很有意思，但如果你认为奶牛们同样享受穿行于大城市的车流中的话，你就大错特错了。与参观景点相反，奶牛们把走路定义为无趣且令她们厌烦的活动。对于编号为i的标志性建筑物，奶牛们清楚地知道参观它能给自己带来的乐趣值F_i (1 <= F_i <= 1000)。相对于奶牛们在走路上花的时间，她们参观建筑物的耗时可以忽略不计。 奶牛们同样仔细地研究过城市中的道路。她们知道第i条道路两端的建筑物 L1_i和L2_i（道路方向为L1_i -> L2_i），以及她们从道路的一头走到另一头所需要的时间T_i(1 <= T_i <= 1000)。 为了最好地享受她们的休息日，奶牛们希望她们在一整天中平均每单位时间内获得的乐趣值最大。当然咯，奶牛们不会愿意把同一个建筑物参观两遍，也就是说，虽然她们可以两次经过同一个建筑物，但她们的乐趣值只会增加一次。顺便说一句，为了让奶牛们得到一些锻炼，Farmer John要求奶牛们参观至少2个建筑物。 请你写个程序，帮奶牛们计算一下她们能得到的最大平均乐趣值。

输入输出格式

输入格式：

 

  • Line 1: Two space-separated integers: L and P

  • Lines 2..L+1: Line i+1 contains a single one integer: Fi

  • Lines L+2..L+P+1: Line L+i+1 describes cow path i with three space-separated integers: L1i , L2i , and Ti

 

输出格式：

 

  • Line 1: A single number given to two decimal places (do not perform explicit rounding), the maximum possible average fun per unit time, or 0 if the cows cannot plan any trip at all in accordance with the above rules.

 

输入输出样例

输入样例#1：
5 7
30
10
10
5
10
1 2 3
2 3 2
3 4 5
3 5 2
4 5 5
5 1 3
5 2 2
输出样例#1：
6.00

这道题 有dalao说是分数规划。。 一点不懂
ans=Σ乐趣值/Σ无趣值 
所以 可以变式为 Σ无趣值*ans-Σ乐趣值=0 
要找出最大的ans 可以二分 
边权值变为   目的地乐趣值-ans*无趣值 
检查是否有负环 有则可以更优

  1 #include <queue>
  2 #include <cstdio>
  3 #include <cctype>
  4 #include <cstring>
  5 
  6 const int INF=0x3f3f3f3f;
  7 const int MAXM=1000001;
  8 const int MAXN=5010;
  9 
 10 int n,m;
 11 
 12 int val[MAXN],q[MAXM],num[MAXN];
 13 
 14 double dis[MAXN];
 15 
 16 bool vis[MAXN];
 17 
 18 struct node {
 19     int to;
 20     int next;
 21     int val;
 22     double p;
 23     node() {}
 24     node(int to,int val,int next):to(to),val(val),next(next) {}
 25 };
 26 node Edge[MAXN<<1];
 27 
 28 int head[MAXN],tot;
 29 
 30 inline void read(int&x) {
 31     int f=1;register char c=getchar();
 32     for(x=0;!isdigit(c);c=='-'&&(f=-1),c=getchar());
 33     for(;isdigit(c);x=x*10+c-48,c=getchar());
 34     x=x*f;
 35 }
 36 
 37 inline void add(int x,int y,int z) {
 38     Edge[++tot]=node(y,z,head[x]);
 39     head[x]=tot;
 40 }
 41 
 42 /*inline bool SPFA() {
 43     for(int i=1;i<=n;++i) vis[i]=false,dis[i]=INF,num[i]=0;
 44     int hea=0,tail=1;
 45     q[tail]=1;
 46     dis[1]=0;num[1]=1;
 47     while(hea<tail) {
 48         int u=q[++hea];
 49         vis[u]=false;
 50         for(int i=head[u];i;i=Edge[i].next) {
 51             int v=Edge[i].to;
 52             if(dis[v]>dis[u]+Edge[i].p) {
 53                 dis[v]=dis[u]+Edge[i].p;
 54                 if(!vis[v]) {
 55                     vis[v]=true;q[++tail]=v;
 56                     ++num[v];
 57                     if(num[v]>n) return true;
 58                 }
 59             }
 60         }
 61     }
 62     return false;
 63 }*/
 64 
 65 inline bool SPFA(int u) {
 66     vis[u]=true;
 67     for(int i=head[u];i;i=Edge[i].next) {
 68         int v=Edge[i].to;
 69         if(dis[v]>dis[u]+Edge[i].p) {
 70             dis[v]=dis[u]+Edge[i].p;
 71             if(vis[v]||SPFA(v)) {
 72                 vis[v]=false;
 73                 return 1;
 74             }
 75         }
 76     }
 77     vis[u]=false;
 78     return false;
 79 }
 80 
 81 inline bool check() {
 82     for(int i=1;i<=n;++i) 
 83       if(SPFA(i)) return true;
 84     return false;
 85 }
 86 
 87 int hh() {
 88     read(n);read(m);
 89     for(int i=1;i<=n;++i) read(val[i]);
 90     for(int x,z,y,i=1;i<=m;++i) {
 91         read(x);read(y);read(z);
 92         add(x,y,z);
 93     }
 94     double l=.0,r=1000000,ans;
 95     while(l+0.00001<r) {
 96         double mid=(l+r)/2;
 97         for(int i=1;i<=tot;++i) Edge[i].p=(double)mid*Edge[i].val-val[Edge[i].to];
 98         if(check()) l=mid;
 99         else r=mid;
100     }
101     printf("%.2lf\n",l);
102     return 0;
103 }
104 
105 int sb=hh();
106 int main(int argc,char**argv) {;}
代码

 

posted @ 2017-09-15 18:28  拿叉插猹哈  阅读(173)  评论(0)  编辑  收藏  举报