Game of Flying Circus --(hdu5515)
来源:互联网 发布:linux redis 启动 编辑:程序博客网 时间:2024/06/05 00:35
The discovery of anti-gravitations technology changed the world. The invention of anti-gravitation shoes (Grav-shoes) enables people to fly in the sky freely. This led to the rise of a new sky sport: ``Flying Circus".
Utilizing Grav-shoes and personal flying suits, competitors battle it out in a special field, where they compete scoring obtainm m points within a certain time limit. The field is a square with edge length 300 300 meters. Moreover, there are four buoys floating at each corner of the square. Four buoys are numbered as 1,2,3,4 1,2,3,4 in clockwise order.
Two players start at buoy#1 #1. When game begin, they will try to touch four floating buoys in clockwise order.
(Since buoy#1 #1 is the start point, the first buoy they need to touch will be buoy #2 #2, and after that, they need to touch buoy #3,#4,#1 #3,#4,#1 in order) Note that they could fly freely in the field, even fly inside the square field.
Under two situations the player could score one point.
⋅ ⋅1. If you touch a buoy before your opponent, you will get one point. For example if your opponent touch the buoy #2 #2 before you after start, he will score one point. So when you touch the buoy #2 #2, you won't get any point. Meanwhile, you cannot touch buoy #3 #3 or any other buoys before touching the buoy #2 #2.
⋅ ⋅2. Ignoring the buoys and relying on dogfighting to get point. If you and your opponent meet in the same position, you can try to fight with your opponent to score one point. For the proposal of game balance, two players are not allowed to fight before buoy #2 #2 is touched by anybody.
There are three types of players.
Speeder: As a player specializing in high speed movement, he/she tries to avoid dogfighting while attempting to gain points by touching buoys.
Fighter: As a player specializing in dogfighting, he/she always tries to fight with the opponent to score points. Since a fighter is slower than a speeder, it's difficult for him/her to score points by touching buoys when the opponent is a speeder.
All-Rounder: A balanced player between Fighter and Speeder.
There will be a training match between Asuka (All-Rounder) and Shion (Speeder).
Since the match is only a training match, the rules are simplified: the game will end after the buoy#1 #1 is touched by anybody. Shion is a speed lover, and his strategy is very simple: touch buoy #2,#3,#4,#1 #2,#3,#4,#1 along the shortest path.
Asuka is good at dogfighting, so she will always score one point by dogfighting with Shion, and the opponent will be stunned for T seconds after dogfighting.Since Asuka is slower than Shion, she decides to fight with Shion for only one time during the match. It is also assumed that if Asuka and Shion touch the buoy in the same time, the point will be given to Asuka and Asuka could also fight with Shion at the buoy. We assume that in such scenario, the dogfighting must happen after the buoy is touched by Asuka or Shion.
The speed of Asuka isV1 m/s V1 m/s. The speed of Shion is V2 m/s V2 m/s. Is there any possibility for Asuka to win the match (to have higher score)?
Utilizing Grav-shoes and personal flying suits, competitors battle it out in a special field, where they compete scoring obtain
Two players start at buoy
(Since buoy
Under two situations the player could score one point.
There are three types of players.
Speeder: As a player specializing in high speed movement, he/she tries to avoid dogfighting while attempting to gain points by touching buoys.
Fighter: As a player specializing in dogfighting, he/she always tries to fight with the opponent to score points. Since a fighter is slower than a speeder, it's difficult for him/her to score points by touching buoys when the opponent is a speeder.
All-Rounder: A balanced player between Fighter and Speeder.
There will be a training match between Asuka (All-Rounder) and Shion (Speeder).
Since the match is only a training match, the rules are simplified: the game will end after the buoy
Asuka is good at dogfighting, so she will always score one point by dogfighting with Shion, and the opponent will be stunned for T seconds after dogfighting.Since Asuka is slower than Shion, she decides to fight with Shion for only one time during the match. It is also assumed that if Asuka and Shion touch the buoy in the same time, the point will be given to Asuka and Asuka could also fight with Shion at the buoy. We assume that in such scenario, the dogfighting must happen after the buoy is touched by Asuka or Shion.
The speed of Asuka is
Each line contains three double
21 10 13100 10 13
Case #1: NoCase #2: Yes
Asuka could fly to the mid point of the edge between buoy #2 and buoy #3, and wait there until Shion come. Asuka will fight with Shion when they meet. As a result, Shion will be stunned (It means Shion cannot move for 100 seconds.) Then Asuka could fly back to buoy #2, since the buoy #2 is touched, she will get no point by touching buoy #2. But after that, she could fly to buoy #3, #4, #1 along the edge and get three points.
题意及题解:http://blog.csdn.net/snowy_smile/article/details/49535301
简直是再清晰不过了:
#include <iostream>#include <cmath>#include <cstdio>using namespace std;int main(){ int T; scanf("%d",&T); int cas=0; while(T--) { double t,v1,v2,t1,t2; cas++; scanf("%lf%lf%lf",&t,&v1,&v2); t1=300.0/v1; t2=300.0/v2; if(v1==v2) printf("Case #%d: Yes\n",cas); else if(v1*v1*2>v2*v2)//能否 #2——#3相遇 { double l=0,r=300; for(int i=0;i<=100;i++)//二分查找相遇点 { double mid=(l+r)/2; double a=sqrt((300*300+mid*mid))/v1; double b=(300+mid)/v2; if(a>b) { l=mid; } else r=mid; } double ta=sqrt(l*l+300*300)/v1+l/v1+2*t1; double tb=t+3*t2; // 计算谁能先到达#4点 if(ta>tb) printf("Case #%d: No\n",cas); else printf("Case #%d: Yes\n",cas); } else if(3*v1>v2)//能否再#3——#4相遇 { double l=0.0,r=300.0,mid; for(int i=0;i<100;i++)//二分查找相遇点 { mid=(l+r)/2; double a=sqrt(300*300+(300-mid)*(300-mid)); a=a/v1; double b=(600+mid)/v2; if(a>b) l=mid; else r=mid; } double a,b; a=sqrt(300*300+(300-l)*(300-l))/v1+sqrt(300*300+l*l)/v1+3*t1; b=t+4*t2; // 计算谁能先到达#1点 if(a>b) printf("Case #%d: No\n",cas); else printf("Case #%d: Yes\n",cas); } else printf("Case #%d: No\n",cas); } return 0;}
阅读全文
0 0
- HDU5515-Game of Flying Circus
- Game of Flying Circus --(hdu5515)
- HDU5515 Game of Flying Circus(二分)
- 【HDU5515】【2015ACM/ICPC亚洲区沈阳站】 Game of Flying Circus 二分
- 【HDU5515 2015沈阳赛区G】【解方程or二分 模拟】Game of Flying Circus 跑垒游戏 【翻译错误 出题事故】
- 【hdu5515】【2015ACM/ICPC亚洲区沈阳站】 Game of Flying Circus 题意&题解&代码(C++)
- HDU 5514 Game of Flying Circus
- HDU 5515 Game of Flying Circus 二分
- HDU 5515 Game of Flying Circus
- hdu 5515 Game of Flying Circus(二分、模拟)
- hdu 5515 Game of Flying Circus 二分+阅读理解
- HDU 5515 (ACM 2015 沈阳) Game of Flying Circus [贪心+二分]
- HDU 5515 Game of Flying Circus (2015沈阳G题&&二分模拟)
- HDOJ 5515 Game of Flying Circus 【2015沈阳现场赛】杂题(数学二分)
- Welcome to the Flying Circus
- HDU Dome of Circus
- LA4986 Dome of Circus
- UVA1473 - Dome of Circus
- user space 通过SIOCSIFNAME修改网口的name
- ASP.Net 在IIS中的处理过程
- 双向可控硅晶片光耦(TLP160J TLP260J TLP525G)基本原理及应用实例
- hibernate 主键自增策略
- TensorFlow实现卷积神经网络CNN
- Game of Flying Circus --(hdu5515)
- LeetCode 392. Is Subsequence
- mysql乐观锁初步认识
- Android传感器介绍
- 编程十戒
- 达内课程-流程控制语句(下)
- 委托和事件理解(转)
- 详解SVN的使用
- 博客园首页新随笔联系管理订阅 随笔- 216 文章- 1 评论- 2 Java ConcurrentModificationException异常原因和解决方法