POJ 1922:Ride to School 【水】
来源:互联网 发布:开淘宝网店注册收费 编辑:程序博客网 时间:2024/06/05 04:20
Ride to School
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20573 Accepted: 8306
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.
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.
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
420025-1552719030240221022340
Sample Output
780771
Charley到达时间与出发时间大于零的最早到的人时间一致
AC-code:
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;struct node{int p,d;double t;}s[10005];bool cmp(node a,node b){return a.t<b.t;}int main(){int n,i,j,ans;while(scanf("%d",&n),n){for(i=0;i<n;i++){scanf("%d%d",&s[i].p,&s[i].d);s[i].t=s[i].d+4.5/s[i].p*3600; }sort(s,s+n,cmp);for(i=0;i<n;i++)if(s[i].d>=0)break;ans=s[i].t;if(ans!=s[i].t)ans++;printf("%d\n",ans);}return 0;}
0 0
- POJ 1922:Ride to School 【水】
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- poj 1922 Ride to School
- poj 1922 Ride to School
- POJ 1922 Ride to School
- POJ:1922 Ride to School
- POJ 1922 - Ride to School
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- POJ-1922 Ride to School
- POJ 1922 Ride to School 解题报告
- Ride to School(POJ 1922)
- Ride to School - POJ 1922 水题
- POJ 1922:Ride to School:水题练java
- POJ 1922 Ride to School 简单模拟
- POJ——1922 Ride to School
- zoj 1221 Risk【最短路 3种方法】
- nyoj458小光棍数
- matlab BP神经网络 机器学习 函数逼近
- HDU 2151 Worm (动态规划)
- poj3254 Corn Fields
- POJ 1922:Ride to School 【水】
- 关于SAE没有file_put_contents写权限的问题
- JavaWeb将数据包装成JSON以及JSP通过ajax对JSON的获取与解析(代码实例)
- 关于Eclipse使用天天模拟器调试Android程序
- 跟Tennant一起学编程--Python环境配置及各种HelloWorld的姿势
- 算法导论例程——快速排序
- Java字节流
- poj2724 Purifying Machine
- 接口1