HDU 5078-Osu!(签到)
来源:互联网 发布:linux 查看进程日志 编辑:程序博客网 时间:2024/05/21 09:52
Osu!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 58 Accepted Submission(s): 41
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 <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <cctype>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <set>#include <map>#include <list>#define ll long longusing namespace std;const int INF=0x3f3f3f3f;const int maxn=1010;ll t[maxn],x[maxn],y[maxn];int main(){ int T,n; cin>>T; while(T--) { cin>>n; for(int i=0;i<n;i++) cin>>t[i]>>x[i]>>y[i]; double ans=-INF; for(int i=1;i<n;i++) { double tem=sqrt((x[i]-x[i-1])*(x[i]-x[i-1])+(y[i]-y[i-1])*(y[i]-y[i-1]))/(double)(t[i]-t[i-1]); ans=max(ans,tem); } printf("%.10lf\n",ans); } return 0;}
1 0
- HDU 5078-Osu!(签到)
- hdoj 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 5078 Osu!
- hdu 5078 Osu!(水)
- hdu 5078——Osu!
- HDU 5003 Osu!(数学题)
- HDU 5003 Osu!(水题)
- hdu 5078 Osu! (鞍山现场赛I题)
- 关于ubuntu 9.04密码的重设
- leetcode Multiply Strings
- static和const
- Android 自定义控件打造史上最简单的侧滑菜单
- 开源飞控OpenPilot的扩展卡尔曼滤波EKF学习笔记(三)
- HDU 5078-Osu!(签到)
- oc 函数节流
- HTML
- [LeetCode OJ]Integer to Roman
- Android笔记 fragment的Tab样式demo
- iPhone应用程序 将图片保存到相册实例
- C#自定义异常类
- Fruit Ninja
- 基于WiFi的室内定位在美团总部的实践与应用(上)