POJ-1922 Ride to School
2015-08-07 19:57
447 查看
Ride to School
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
Sample Output
Source
Beijing 2004 Preliminary@POJ
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 20162 | Accepted: 8138 |
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
Source
Beijing 2004 Preliminary@POJ
#include<iostream> #include<math.h> using namespace std; int main() { int n,i; double v,t,x,min; while(cin>>n&&n!=0) { min=1e100; for(i=0; i<n; ++i) { cin>>v>>t; x=t+(4.5*3600/v); if(x<min&&t>=0) min=x; } cout<<ceil(min)<<endl; } return 0; }
相关文章推荐
- Android Java设置一个图片的颜色为透明色(不显示,不是背景色),可用于无透明通道的ImageView
- ZOJ3818 Pretty Poem(暴力)
- swirl 7: Matrices and Data Frames
- VC程序版本更新后部分客户无法启动
- ACdream 完美数
- 【Cocos2d入门教程一】Cocos2d-x环境搭建
- Course Schedule
- POJ-1316 Self Numbers-自数
- 如何使自己编译的驱动程序具有读写权限
- MFC+OpenGL单文档制作三维图像
- UVA 10020 - Minimal coverage 解题心得
- npm常用命令->nodejs
- 黑马程序员--- objective-c 匿名类的使用
- HDU - 1247 Hat’s Words 字典树
- Java — 开发环境(Core Java I)
- HDU 2700 Parity
- POJ 2864 Pascal Library 水
- 获取android手机版本
- 欢迎访问我的文艺博客
- Arduino入门知识