UVA 11722 Joining with Friend
来源:互联网 发布:mac pocomaker 编辑:程序博客网 时间:2024/06/08 10:11
题目链接
题意: 两个人坐火车, 在某个城市到站的时间段分别为[t1, t2] , [s1, s2],停在站台的时间均为w,问两人能见面的概率。
分析:高中的线性规划问题。总可能为S=(s2-s1)*(t2-t1);又停站时间为w所以|x-y|<=w,所以范围为t1<=x<=t2,s1<=y<=s2,|x-y|<=w所围成的面积。除一下即可。
#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>using namespace std;double t1,t2,s1,s2,w;double tot;double get_area(double b){ if(t1+b>=s2) return tot; else if(t1+b<s1) { if(t2+b<=s1) return 0; else if(t2+b>s1&&t2+b<=s2) return (t2+b-s1)*(t2+b-s1)*0.5; else return 0.5*(t2-s1+b+t2-s2+b)*(s2-s1); } else { if(t2+b>s2) return tot-0.5*(s2-t1-b)*(s2-t1-b); else return 0.5*(t2-t1)*(t1+b-s1+t2+b-s1); }}int main(void){ int cas=1; int t; scanf("%d",&t); while(t--) { scanf("%lf%lf%lf%lf%lf",&t1,&t2,&s1,&s2,&w); tot=(t2-t1)*(s2-s1); double area1=get_area(w); double area2=get_area(-w); double area=area1-area2; printf("Case #%d: %.8lf\n",cas++,area/tot); } return 0;}
0 0
- UVA 11722 Joining with Friend
- UVA 11722 Joining with Friend
- UVA 11722 - Joining with Friend(概率)
- uva 11722 - Joining with Friend(概率)
- UVA - 11722 Joining with Friend (概率)
- UVA 11722 Joining with Friend【概率】
- UVA 11722 Joining with Friend 图形面积+概率
- UVa 11722 - Joining with Friend (概率 数形结合)
- UVA 11722 Joining with Friend 概率与期望
- Uva11722 Joining with Friend
- uva11722 Joining with Friend
- Uva11722 joining with friend 概率 几何计算
- UVA11722Joining with Friend概率dp
- Joining an array of keys to a hash with key value pairs like excel vlookup
- Joining data
- friend
- friend
- Friend
- CmFree
- 暑期dp46道(42)--HDOJ 1789 Doing Homework again 贪心
- 4.2KNN算法实例2--python机器学习
- 使用GSON抛出com.google.gson.stream.MalformedJsonException异常
- HDU1867:A + B for you again【kmp】
- UVA 11722 Joining with Friend
- 主窗体(MDI窗体显示)
- Android、java的输入流和输出流
- 基于MTK 的 TP 驱动分析
- BZOJ4653 NOI2016DAY2T1区间 线段树
- 最大子段和(分治与动态规划典例)
- 求面积
- ShareSDK分享
- Xcode_7 iOS_9 工具栏_导航栏 Objective-C (4)