HDU 5078--Osu!【水题】
来源:互联网 发布:单点登录系统源码 编辑:程序博客网 时间:2024/05/20 17:25
Osu!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1242 Accepted Submission(s): 650
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
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;using namespace std;int time[1010];double x[1010];double y[1010];double dis(int a,int b){ return sqrt( (x[a]-x[b]) * (x[a]-x[b]) + (y[a]-y[b]) * (y[a]-y[b]) );}int main(){ int T; scanf("%d", &T); while(T--){ int n; scanf("%d", &n); for(int i = 0 ; i < n ; ++i) scanf("%d%lf%lf",&time[i], &x[i], &y[i]); double temp = 0; for(int i = 1; i < n ; ++i){ double d = dis(i, i-1) / (time[i] - time[i-1]); if( temp < d ) temp = d; } printf("%.10lf\n",temp); } return 0;}
0 0
- hdu 5078 Osu!(水题)
- HDU 5078--Osu!【水题】
- HDU 5078 Osu!(水题)
- hdu 5078 Osu!
- [ACM] HDU 5078 Osu!
- HDU 5078 Osu!
- HDU 5078 Osu!
- HDU 5078 Osu!
- hdu 5078 Osu!
- hdu 5078 Osu!
- hdu 5078 Osu!(水)
- hdu 5003 Osu!(水题)
- HDU 5078-Osu!(签到)
- hdu 5078——Osu!
- HDU 5003 Osu!(水题)
- hdu 5078 Osu!(鞍山现场赛)
- hdu 5003 Osu!
- HDU oj Osu! 5003
- AngularJs 初学
- linux kafka 搭建运行环境
- .net连接sqlite数据库
- Xcode 报错: Extra argument in call
- 抽象工厂模式-Abstract Factory Pattern
- HDU 5078--Osu!【水题】
- Squid Epoll网络模型
- poj 1837 dp
- C++内联函数
- wireshark抓包图解 TCP三次握手/四次挥手详解
- Android通过Xutils注解实例化以及事件绑定
- Squares
- enum类型,定义、变量长度、与int转换、与string转换
- openwrt中基于L2TP的VPN测试