HDU 1445 Ride to School 贪心
来源:互联网 发布:计算机病毒预防软件 编辑:程序博客网 时间:2024/06/08 11:21
Ride to School
Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u
Submit
Status
Description
Many graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus - Yanyuan. Students in Wanliu have to either take a bus or ride a bike to go to school. Due to the bad traffic in Beijing, many students choose to ride a bike.
We may assume that all the students except “Charley” ride from Wanliu to Yanyuan at a fixed speed. Charley is a student with a different riding habit - he always tries to follow another rider to avoid riding alone. When Charley gets to the gate of Wanliu, he will look for someone who is setting off to Yanyuan. If he finds someone, he will follow that rider, or if not, he will wait for someone to follow. On the way from Wanliu to Yanyuan, at any time if a faster student surpassed Charley, he will leave the rider he is following and speed up to follow the faster one.
We assume the time that Charley gets to the gate of Wanliu is zero. Given the set off time and speed of the other students, your task is to give the time when Charley arrives at Yanyuan.
Input
There are several test cases. The first line of each case is N (1 <= N <= 10000) representing the number of riders (excluding Charley). N = 0 ends the input. The following N lines are information of N different riders, in such format:
Vi [TAB] Ti
Vi is a positive integer <= 40, indicating the speed of the i-th rider (kph, kilometers per hour). Ti is the set off time of the i-th rider, which is an integer and counted in seconds. In any case it is assured that there always exists a nonnegative Ti.
Output
Output one line for each case: the arrival time of Charley. Round up (ceiling) the value when dealing with a fraction.
Sample Input
4
20 0
25 -155
27 190
30 240
2
21 0
22 34
0
Sample Output
780
771
时间小于0的不用考虑 追得上的不用跟 想要跟的追不上。
计算最快到达的人的时间。
#include<iostream>#include<stdio.h>#include<cstring>#include<vector>#include<math.h>#include<sstream>#include<set>#include<map>#include<algorithm>using namespace std;const int MAX=10000+5;const double D=4500;struct rider{ int v; int t;};bool cmp(rider a,rider b){ if (a.t==b.t) return a.v<b.v; else return a.t<b.t;}rider rs[MAX];int main(){ int N; while (cin>>N&&N) { double minT=99999999; for (int i=0; i<N; i++) { cin>>rs[i].v>>rs[i].t; } sort(rs,rs+N,cmp); int ptr=0; for (ptr=0; ptr<N; ptr++) if (rs[ptr].t>=0) break; for (;ptr<N;ptr++) { double time=D/rs[ptr].v*3.6+rs[ptr].t; minT=min(minT,time); } cout<<ceil(minT)<<endl; } return 0;}
- HDU 1445 Ride to School 贪心
- 文章标题 HDU 1445 : Ride to School (贪心)
- hdu 1445 Ride to School
- HDU 1445 - Ride to School
- hdu 1445 Ride to School
- POJ 1922 Ride to School (贪心)
- Ride to School
- POJ1922-Ride to School
- Ride to School(水题)
- POJ1992 Ride to School
- POJ1922 Ride to School
- Ride to School
- POJ1922 Ride to School
- Ride to School
- S-Ride to School
- POJ 1922 Ride to School
- fjnu 1007 Ride to School
- POJ 1922 Ride to School
- 8086汇编语言 除数8位DIV指令实例
- Android集成微信支付让你不再踩坑
- 批量修改文件(或文件夹)权限或所有者
- c++设计模式之装饰模式
- 停止线程
- HDU 1445 Ride to School 贪心
- Python中常用的正则表达式处理函数
- Java版抓取网站妹子图片
- dedecms tag 标签调用方法(详细介绍)
- TreeMap和TreeSet在排序时如何比较元素?Collections工具类中的sort()方法如何比较元素?
- BZOJ1854 [Scoi2010]游戏
- HDU 1050 Moving Tables 求最大重复次数
- JavaScript中Element与Node的区别,children与childNodes的区别
- hdu 1052 田忌赛马(贪心)