Codeforces #282 div 1 C Helping People 题解
CF 282 C
Helping People 题解
【原题】
2 seconds
512 megabytes
standard input
standard output
Malek is a rich man. He also is very generous. That's why he decided to split his money between poor people. A charity institute knows npoor people numbered
from 1 to n. The institute gave Malek q recommendations.
A recommendation is a segment of people like [l, r]which means the institute recommended that Malek gives one dollar to every person whose number
is in this segment.
However this charity has very odd rules about the recommendations. Because of those rules the recommendations are given in such a way that for every two recommendation [a, b] and [c, d] one
of the following conditions holds:
- The two segments are completely disjoint. More formally either a ≤ b < c ≤ d or c ≤ d < a ≤ b
- One of the two segments are inside another. More formally either a ≤ c ≤ d ≤ b or c ≤ a ≤ b ≤ d.
The goodness of a charity is the value of maximum money a person has after Malek finishes giving his money. The institute knows for each recommendation what is the probability that Malek will
accept it. They want to know the expected value of goodness of this charity. So they asked you for help.
You have been given the list of recommendations and for each recommendation the probability of it being accepted by Malek. You have also been given how much money each person initially has. You must find the expected value of goodness.
In the first line two space-separated integers n, q (1 ≤ n ≤ 105, 1 ≤ q ≤ 5000)
are given.
In the second line n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 109)
are given meaning that person number i initially has ai dollars.
Each of the next q lines contains three space-separated numbers li, ri, pi (1 ≤ li ≤ ri ≤ n, 0 ≤ p ≤ 1)
where li and ri are
two integers describing the segment of recommendation and pi is
a real number given with exactly three digits after decimal point which is equal to probability of Malek accepting this recommendation.
Note that a segment may appear several times in recommendations.
Output the sought value. Your answer will be considered correct if its absolute or relative error is less than 10 - 6.
5 2
1 7 2 4 3
1 3 0.500
2 2 0.500
8.000000000
5 2
281 280 279 278 282
1 4 1.000
1 4 0.000
282.000000000
3 5
1 2 3
1 3 0.500
2 2 0.250
1 2 0.800
1 1 0.120
2 2 0.900
4.465000000
【废话】好久没写博客了。(我不会告诉你我是离线写的)于是来水经验来了。
【来源简述】CF 282 C
【原题简述】有N(10^5)个人,每一个人有初始的钱。
再给出M(5000)个操作L,R,P。
每次表示L~R这些人有几率P(0<=P<=1)给他们每人一元。
求最后全部人钱数最大值的期望。
【算法简述】首先把这些操作建立出树结构(能够借鉴线段树)。
节点i表示范围Li~Ri,它的父亲一定包括它,它也包括它的全部子树。为了方便,建立一个L=1,R=N,P=0的无效节点作为根。
观察到M的范围小。我们用f[i][j]表示在节点i表示的范围内,加的钱数<=j的期望(注意原先的钱数能够用RMQ计算出)。至于为什么是<=,由于后面要用到前缀和——反正f算的时候再前缀和一下。那么到节点i,我们开一数组tmp[j]表示全部子树中影的最多(注意还是前缀和性质)加了j元的期望。
那么tmp[j]= ∏f[son][mx[i]+j-mx[son]];
mx[o]是原先区间o的最大钱数。
(这里就用到了f的前缀和性质了)
注意到求完后做一步tmp[j]-=tmp[j-1],取消前缀和性质。
然后我们的任务是求出i的全部f值。
那么ans[i][j]=ans[i][j-1]+tmp[j-1]*p[i]+tmp[j]*(1-p[i]);
ans[i][j-1]:前缀和
tmp[j-1]*p[i]:由子树中得最大加j-1,且当前也加
tmp[j]*(1-p[i]):由子树中得最大加j,且当前不加
求完了全部的f[i][j]后,我们对于新加的点K,最后的ans满足
ANS=ans[m][0]*mx[m]+Σ (ans[m][i]-ans[m][i-1])*(mx[m]+i);
【*精华所得】类似于分治的树形算法。
【代码】
#include<cstdio>
#include<algorithm>
#include<cmath>
#define N 100005
#define M 5005
using namespace std;
struct arr{int l,r;double p;}a[M];
int f[N][18],mx[N],used[N],n,i,j,T,m,k;
double ans[M][M],tmp[M],ANS;
inline int ask(int x,int y)
{
int len=(int)log2(y-x+1);
return max(f[x][len],f[y-(1<<len)+1][len]);
}
inline int cmp(const arr &a,const arr &b){return a.r-a.l<b.r-b.l;}
int main()
{
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++) scanf("%d",&f[i][0]);
for (j=1;j<=17;j++)
for (i=1;i<=n;i++)
T=i+(1<<(j-1)),f[i][j]=max(f[i][j-1],(T<=n)? f[T][j-1]:0);
for (i=1;i<=m;i++)
scanf("%d%d%lf",&a[i].l,&a[i].r,&a[i].p);
a[++m]=(arr){1,n,0};
sort(a+1,a+m+1,cmp);
for (i=1;i<=m;i++)
{
mx[i]=ask(a[i].l,a[i].r);
for (k=0;k<=m;k++) tmp[k]=1.0;
for (j=1;j<i;j++)
if (a[j].l>=a[i].l&&a[j].r<=a[i].r&&!used[j])
{
used[j]=1;
for (k=0;k<=m;k++)
if (mx[i]+k-mx[j]<=m) tmp[k]*=ans[j][mx[i]+k-mx[j]];
}
for (k=m;k;k--)
tmp[k]-=tmp[k-1];
ans[i][0]=(1-a[i].p)*tmp[0];
for (k=1;k<=m;k++)
ans[i][k]=ans[i][k-1]+tmp[k-1]*a[i].p+tmp[k]*(1-a[i].p);
//ans[i][k-1]:加上k-1的期望(ans[i]实质是前缀和性质)
//tmp[k-1]*p[i]:由子树中得最大加k-1,且当前也加
//tmp[k]*(1-p[i]): 由子树中得最大加k,且当前不加
}
ANS=ans[m][0]*mx[m];
for (i=1;i<=m;i++)
ANS+=(ans[m][i]-ans[m][i-1])*(mx[m]+i);
printf("%.10lf",ANS);
}
Codeforces #282 div 1 C Helping People 题解的更多相关文章
- 【codeforces #282(div 1)】AB题解
A. Treasure time limit per test 2 seconds memory limit per test 256 megabytes input standard input o ...
- Codeforces Round #609 (Div. 2)前五题题解
Codeforces Round #609 (Div. 2)前五题题解 补题补题…… C题写挂了好几个次,最后一题看了好久题解才懂……我太迟钝了…… 然后因为longlong调了半个小时…… A.Eq ...
- Codeforces #344 Div.2
Codeforces #344 Div.2 Interview 题目描述:求两个序列的子序列或操作的和的最大值 solution 签到题 时间复杂度:\(O(n^2)\) Print Check 题目 ...
- Lyft Level 5 Challenge 2018 - Final Round (Open Div. 2) (前三题题解)
这场比赛好毒瘤哇,看第四题好像是中国人出的,怕不是dllxl出的. 第四道什么鬼,互动题不说,花了四十五分钟看懂题目,都想砸电脑了.然后发现不会,互动题从来没做过. 不过这次新号上蓝名了(我才不告诉你 ...
- Codeforces #345 Div.1
Codeforces #345 Div.1 打CF有助于提高做题的正确率. Watchmen 题目描述:求欧拉距离等于曼哈顿距离的点对个数. solution 签到题,其实就是求有多少对点在同一行或同 ...
- Codeforces Beta Round #27 (Codeforces format, Div. 2)
Codeforces Beta Round #27 (Codeforces format, Div. 2) http://codeforces.com/contest/27 A #include< ...
- Codeforces#441 Div.2 四小题
Codeforces#441 Div.2 四小题 链接 A. Trip For Meal 小熊维尼喜欢吃蜂蜜.他每天要在朋友家享用N次蜂蜜 , 朋友A到B家的距离是 a ,A到C家的距离是b ,B到C ...
- codeforces #592(Div.2)
codeforces #592(Div.2) A Pens and Pencils Tomorrow is a difficult day for Polycarp: he has to attend ...
- codeforces #578(Div.2)
codeforces #578(Div.2) A. Hotelier Amugae has a hotel consisting of 1010 rooms. The rooms are number ...
随机推荐
- Robocopy用法
----------------[参数]-------------------robocopy /?------------------------------------------------- ...
- C#操作XML序列化与反序列化
public class XmlSerializerHelper { /// <summary> /// 从XML文件中反序列化读取对象 /// </summary> /// ...
- jquery_EasyUI使用细节注意
一.属性key不加双引号,value加双引号,对于url的value,添加‘’单引号:url的访问地址可以使用以下格式: datagrid中的url格式: var datagrid; $(functi ...
- JAVA向EXE文件尾追加配置信息,用于解决局版客户端的程序IP配置问题
package com.demo.blog; import java.io.DataOutputStream;import java.io.File;import java.io.FileOutput ...
- OpenJDK中java.lang.NoClassDefFoundError: com/sun/image/codec/jpeg/ImageFormatException解决办法
http://www.cnblogs.com/xusweeter/p/9667801.html
- [BZOJ1997][Hnoi2010]Planar 2-sat (联通分量) 平面图
1997: [Hnoi2010]Planar Time Limit: 10 Sec Memory Limit: 64 MBSubmit: 2317 Solved: 850[Submit][Stat ...
- J.U.C并发框架源码阅读(二)AbstractQueuedSynchronizer
基于版本jdk1.7.0_80 java.util.concurrent.locks.AbstractQueuedSynchronizer 代码如下 /* * ORACLE PROPRIETARY/C ...
- POJ 2524 Ubiquitous Religions (并查集)
Description 当今世界有很多不同的宗教,很难通晓他们.你有兴趣找出在你的大学里有多少种不同的宗教信仰.你知道在你的大学里有n个学生(0 < n <= 50000).你无法询问每个 ...
- python实现无重复字符串的最长子串
给定一个字符串,请你找出其中不含有重复字符的 最长子串 的长度. 示例 1: 输入: "abcabcbb" 输出: 3 解释: 因为无重复字符的最长子串是 "abc&qu ...
- 腾讯消消乐 (状态压缩DP)
腾讯消消乐 题意 给出长度为 n 的序列,每次可以选择删除序列的一个连续区间,要求这一段区间内所有数最大公约数不小于 k ,删除后剩下的序列仍然构成连续序列. 定义 f(i) 为进行 i 次操作将整个 ...