CF925F.Parametric Circulation
NOI/NOI+/CTSC
通过率:0%
时间限制:2.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Vova has recently learned what a circulaton in a graph is. Recall the definition: let G=(V,E) be a directed graph. A circulation f is such a collection of non-negative real numbers fe (e∈E), that for each vertex v∈V the following conservation condition holds:
sumlimits_eindelta−(v)f_e=sumlimits_eindelta+(v)f_e
where δ+(v) is the set of edges that end in the vertex v, and δ−(v) is the set of edges that start in the vertex v. In other words, for each vertex the total incoming flow should be equal to the total outcoming flow.
Let a lr-circulation be such a circulation f that for each edge the condition le≤fe≤re holds, where le and re for each edge e∈E are two non-negative real numbers denoting the lower and upper bounds on the value of the circulation on this edge e.
Vova can't stop thinking about applications of a new topic. Right now he thinks about the following natural question: let the graph be fixed, and each value le and re be a linear function of a real variable t:
l\_e(t) = a\_e t + b\_e$$ $$r\_e(t) = c\_e t + d\_eNote that t is the same for all edges.
Let t be chosen at random from uniform distribution on a segment [0,1]. What is the probability of existence of lr-circulation in the graph?
沃瓦最近学习了图中“循环流”(circulation)的概念。回顾其定义:设 G=(V,E) 是一个有向图。一个循环流 f 是一组非负实数 fe(其中 e∈E),满足对每个顶点 v∈V,如下守恒条件成立:
e∈δ−(v)∑fe=e∈δ+(v)∑fe
其中 δ+(v) 表示以顶点 v 为终点的边集,δ−(v) 表示以顶点 v 为起点的边集。换言之,对每个顶点,总流入量应等于总流出量。
称一个循环流 f 为 lr-循环流,若对每条边 e 均满足约束 le≤fe≤re,其中对每条边 e∈E,le 和 re 是两个非负实数,分别表示该边上循环流取值的下界与上界。
沃瓦无法停止思考这一新概念的应用。此刻他正考虑如下自然问题:图 G 固定不变,且对每条边 e,其上下界 le 和 re 均为实变量 t 的线性函数:
l_e(t) = a_e t + b_e$$ $$r_e(t) = c_e t + d_e注意:所有边共享同一个变量 t。
设 t 在区间 [0,1] 上服从均匀分布,随机选取。问:图中存在 lr-循环流的概率是多少?
输入格式
The first line contains two integers n, m (1≤n≤1000, 1≤m≤2000).
Each of the next m lines describes edges of the graph in the format ue, ve, ae, be, ce, de (1≤ue,ve≤n, −104≤ae,ce≤104, 0≤be,de≤104), where ue and ve are the startpoint and the endpoint of the edge e, and the remaining 4 integers describe the linear functions for the upper and lower bound of circulation.
It is guaranteed that for any t∈[0,1] and for any edge e∈E the following condition holds 0≤le(t)≤re(t)≤104.
第一行包含两个整数 n、m(1≤n≤1000,1≤m≤2000)。
接下来的 m 行每行描述图中的一条边,格式为 ue、ve、ae、be、ce、de(其中 1≤ue,ve≤n,−104≤ae,ce≤104,0≤be,de≤104),ue 和 ve 分别为边 e 的起点和终点,其余四个整数用于描述该边上流的上界与下界所对应的线性函数。
保证对任意 t∈[0,1] 及任意边 e∈E,均有 0≤le(t)≤re(t)≤104。
输出格式
Print a single real integer — the probability of existence of lr-circulation in the graph, given that t is chosen uniformly at random from the segment [0,1]. Your answer is considered correct if its absolute difference from jury's answer is not greater than 10−6.
输出一个实数——在 t 于区间 [0,1] 上均匀随机选取的前提下,图中存在 lr-环流的概率。若你的答案与标准答案的绝对误差不超过 10−6,则视为正确。
输入输出样例
输入#1
3 3 1 2 0 3 -4 7 2 3 -2 5 1 6 3 1 0 4 0 4
输出#1
0.25
说明/提示
In the first example the conservation condition allows only circulations with equal values fe for all three edges. The value of circulation on the last edge should be 4 whatever t is chosen, so the probability is
P(4 \\in \[3, -4t + 7\]~~\\&~~4 \\in \[-2t + 5, t + 6\]) = 0.25在第一个例子中,守恒条件仅允许三条边上的环流值 fe 均相等。无论选择何种 t,最后一条边上的环流值都必须为 4,因此所求概率为
P(4∈[3,−4t+7] & 4∈[−2t+5,t+6])=0.25
输入解题思路,AI测评打分。不知道怎么写?