hd5078 Osu!
来源:互联网 发布:淘宝上二手4s能买吗 编辑:程序博客网 时间:2024/05/22 06:51
Osu!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1271 Accepted Submission(s): 664
Special Judge
Problem Description
Osu! is a very popular music game. Basically, it is a game about clicking. Some points will appear on the screen at some time, and you have to click them at a correct time.
Now, you want to write an algorithm to estimate how diffecult a game is.
To simplify the things, in a game consisting of N points, point i will occur at time ti at place (xi, yi), and you should click it exactly at ti at (xi, yi). That means you should move your cursor from point i to point i+1. This movement is called a jump, and the difficulty of a jump is just the distance between point i and point i+1 divided by the time between ti and ti+1. And the difficulty of a game is simply the difficulty of the most difficult jump in the game.
Now, given a description of a game, please calculate its difficulty.
Now, you want to write an algorithm to estimate how diffecult a game is.
To simplify the things, in a game consisting of N points, point i will occur at time ti at place (xi, yi), and you should click it exactly at ti at (xi, yi). That means you should move your cursor from point i to point i+1. This movement is called a jump, and the difficulty of a jump is just the distance between point i and point i+1 divided by the time between ti and ti+1. And the difficulty of a game is simply the difficulty of the most difficult jump in the game.
Now, given a description of a game, please calculate its difficulty.
Input
The first line contains an integer T (T ≤ 10), denoting the number of the test cases.
For each test case, the first line contains an integer N (2 ≤ N ≤ 1000) denoting the number of the points in the game. Then N lines follow, the i-th line consisting of 3 space-separated integers, ti(0 ≤ ti < ti+1 ≤ 106), xi, and yi (0 ≤ xi, yi ≤ 106) as mentioned above.
For each test case, the first line contains an integer N (2 ≤ N ≤ 1000) denoting the number of the points in the game. Then N lines follow, the i-th line consisting of 3 space-separated integers, ti(0 ≤ ti < ti+1 ≤ 106), xi, and yi (0 ≤ xi, yi ≤ 106) as mentioned above.
Output
For each test case, output the answer in one line.
Your answer will be considered correct if and only if its absolute or relative error is less than 1e-9.
Your answer will be considered correct if and only if its absolute or relative error is less than 1e-9.
Sample Input
252 1 93 7 25 9 06 6 37 6 01011 35 6723 2 2929 58 2230 67 6936 56 9362 42 1167 73 2968 19 2172 37 8482 24 98
Sample Output
9.219544457354.5893762558嗯,题目大一就是说求两点之间距离相对时间值,就是说距离除以时间,然后寻找最大值,保留10位小数,结构体#include<cstdio>#include<cstring>#include<math.h>#include<algorithm>using namespace std;struct node{int time;double x,y;}p[1010];int cmp(node a,node b){return a.time<b.time;}double dis(double x1,double y1,double x2,double y2){return sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));}int main(){int t,n;double s,max;scanf("%d",&t);while(t--){max=-1;scanf("%d",&n);for(int i=0;i<n;++i)scanf("%d%lf%lf",&p[i].time,&p[i].x,&p[i].y);sort(p,p+n,cmp);for(int i=1;i<n;++i){s=dis(p[i-1].x,p[i-1].y,p[i].x,p[i].y)/(p[i].time-p[i-1].time);if(s>max)max=s;}printf("%.10lf\n",max);}return 0;}
0 0
- hd5078 Osu!
- osu
- 【BZOJ4318】OSU!
- [BZOJ4318] OSU!
- bzoj4318: OSU!
- BZOJ4318: OSU!
- BZOJ4318: OSU!
- 【jzoj4783】【Osu】
- hdu5078 Osu!
- [bzoj4318]OSU!
- hdu 5003 Osu!(水题)
- hdu 5078 Osu!
- [ACM] HDU 5078 Osu!
- hdu 5078 Osu!(水题)
- HDU 5078 Osu!
- hdu 5003 Osu!
- HDU 5078 Osu!
- HDU oj Osu! 5003
- c++调用Matlab引擎编程(用于画图,数值计算)
- 派生类规则
- SpringMVC Spring3 MVC 注解,注释 用@RequestMapping处理请求,多个请求,提交,.do,带参数,url重写
- win7下安装ubuntu时格式化的磁盘,新建卷的时候提示没有足够的磁盘空间
- 根据IP获取所在地天气
- hd5078 Osu!
- Java 8 之默认方法(Default Methods)
- AFNetworking2.0源码解析
- eclipse Python配置
- 通过Word或WLW离线发布CSDN博客
- Java TCP通信
- caffe示例实现之3使用底层C++ API进行图像分类
- 这个问题挺有意思的。多线程处理,互斥锁和syn同步锁
- 2015Android开发环境的建立