POJ 1922 Ride to School 简单模拟
2015-08-07 19:42
471 查看
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
AC代码:
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
AC代码:
#include <iostream> #include <cmath> #include <algorithm> using namespace std; int main(){ int n; double a[10000],b[10000],c[10000]; while(cin>>n&&n){ int count=0; for(int i=0;i<n;++i){ cin>>a[i]>>b[i]; if(b[i]>=0) c[count++]=4.5*3600/a[i]+b[i]; } sort(c,c+count); cout<<ceil(c[0])<<'\n'; } return 0; }
相关文章推荐
- Codeforces Gym 100418K Cards 暴力打表
- Scala学习笔记-14
- 外键查询及删除
- swirl 6: Subsetting Vectors
- hdu 5355 Cake dfs暴搜 构造
- HashMap和HashSet的区别
- HDU 1201 18岁生日
- POJ 2017 Speed Limit 简单模拟
- sizeof运算符
- Java程序设计之Constructor
- Ubuntu 14.10 下设置静态IP
- 请听一个故事------>百度员工离职总结:如何做个好员工
- maven使用私服(其他我没测试)无法导入jar文件问题
- IOS开发UI篇-NavigationController的基本使用
- ACM
- 请大胆的和你职业相关的人保持沟通
- HashSet,TreeSet和LinkedHashSet的区别
- Dijkstra算法(Dijkstra's algorithm)
- 95. Unique Binary Search Trees
- Swift编程语言学习4.1——周期