POJ1922
2015-08-08 14:45
218 查看
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
心得:
基本没什么算法技巧,但是精度问题需要特别注意,WA几次都栽在精度问题上= =!向上取整函数ceil,向下取整函数floor,头文件include<cmath>
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 20165 | Accepted: 8139 |
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<cstdio> #include<iostream> #include<cmath> using namespace std; int main() { int n; double s,min,x,t; while(scanf("%d",&n)&&n>0) { min=99999.0; while(n--) { scanf("%lf%lf",&x,&t); if(t>=0) { s=t+4.50/(x/3600); if(s<min) min=s; } } printf("%.0lf\n",ceil(min)); } return 0; }
心得:
基本没什么算法技巧,但是精度问题需要特别注意,WA几次都栽在精度问题上= =!向上取整函数ceil,向下取整函数floor,头文件include<cmath>
相关文章推荐
- bfs 和 dfs 专题
- Java垃圾回收机制详解
- LeetCode224——Basic Calculator
- UVA - 11396 Claw Decomposition(二分图染色)
- study linux mutithread
- ARM+linux环境下程序的开发和烧录
- Android 中listview 和scrollview 滚动冲突事件的解决方法
- 内部连接与外部连接
- jQuery ajax参数详解
- 安装eclipse插件,重启后报错,恢复启动方法备忘
- JSTL核心标签库学习笔记
- UVALive 6485 Electric Car Rally (BFS,PQ)
- JS中的数学计算<之简单实例讲解>
- String.valueOf传null参数的不同表现
- 单例设计模式
- java中继承和多态区别.
- mysql性能优化的19个要点
- TI BLE协议栈 按键流程分析
- HDU 1875 畅通工程再续
- 【HDU4570】【Multi-bit Trie】