题目链接: Coding Contest Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others) Problem Description A coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks,…

从源点向每个点连接容量为该点人数,费用为1的边, 把原图中的每条边拆成两条,一条容量为1,费用为1,另一条容量为ci-1,费用为1-pi 从每个点向汇点连接容量为该点面包数量,费用为1的边. 跑的费用流为按照乘积跑个最大费用流. 可以取个对数,乘法变成加法, 可以再取个负数,最大费用变成最小费用. 别忘了最后还原回来. #include<cstdio> #include<algorithm> #include<cstring> #include<queue>…

首先这是个费用流,用log转乘法为加法,外加模板的修改,需加eps 下面是废话,最好别看 闲来无事(鼓起勇气)写这篇博客 这是个自带影像回访的题目 青岛的炼铜之旅,大学的acm生涯就这样结束了.或许还会刷刷题目,但是也再也没有证明自己的机会和心气. 回想大学的这段旅程. 大一下接触acm,为进集训队拼命刷题,因为基础差在暑假的集训后没有能够去区域赛.郁闷的大二上加寒假没有刷题.大二下因为特别的机会得以和老队友参加省赛,差一名得金.从大二下开始每天从早上到晚上刷题.本以为可以报大腿在之后获得银牌甚…

2016青岛现场赛的一题,由于第一次走过不会产生影响,需要拆点,不过比赛时没想到,此外还有许多细节要注意,如要加eps,时间卡得较紧要注意细节优化等 #include <iostream> #include <cstring> #include <queue> #include <cstdio> #include <cmath> #include <cstdlib> #include <algorithm> #includ…

题目链接:https://www.nowcoder.com/acm/contest/207/G 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5988 时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述 A coding contest will be held in this university, in a huge playground. Th…

HDU5988 题意: 有n个区域,每个区域有s个人,b份饭.现在告诉你每个区域间的有向路径,每条路有容量和损坏路径的概率.问如何走可以使得路径不被破坏的概率最小.第一个人走某条道路是百分百不会损坏道路的. 思路: 对于每个人,他从起点到目的地,不损坏道路的概率是(1 - p[1]*p[2]...*p[r]).相乘不好做,对减号右边的乘法取对数,就成了相加,就可以愉快的做相加运算了,就是可以跑费用流了.这道题spfa还有加入esp=1e-8. //#pragma GCC optimize(3)…

Coding Contest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1751    Accepted Submission(s): 374 Problem Description A coding contest will be held in this university, in a huge playground. The…

Coding Contest http://acm.hdu.edu.cn/showproblem.php?pid=5988 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5337    Accepted Submission(s): 1256 Problem Description A coding contest will be he…

Coding Contest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5968    Accepted Submission(s): 1413 Problem Description A coding contest will be held in this university, in a huge playground. Th…

Problem DescriptionA coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks, and there would be M directed paths linking these blocks. The i-th path goes from the ui-th block to the v…