zoukankan      html  css  js  c++  java
  • HDU 1445 Ride to School

    http://acm.hdu.edu.cn/showproblem.php?pid=1445

    Problem 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

     题解:贪心

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    #define inf 0x3f3f3f3f
    int n;
    
    struct Node {
        int v;
        int t;
        int need;
    }node[10000];
    
    int main(){
        while(~scanf("%d", &n)){
            if(!n) break;
    
            for(int i = 0; i < n; i ++)
                scanf("%d%d", &node[i].v, &node[i].t);
    
            for(int i = 0; i < n; i ++){
                if(node[i].t < 0) {
                    node[i].need = inf;
                } else{
                    node[i].need = (int)((4500 * 3.6) / node[i].v + node[i].t);
                    if((int)(4500 * 3.6) % node[i].v)
                        node[i].need ++;
                }
            }
    
            int ans = node[0].need;
            for(int i = 1; i < n; i ++)
                ans = min(ans, node[i].need);
    
            printf("%d
    ", ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    2019 年百度之星—初赛一 B题 Game
    蒲公英
    集训队8月17日
    CodeForces 550E Brackets in Implications 推理
    11076: 小P的集合 位运算
    树状数组区间修改版本模板
    Contest1692
    POJ
    树状数组进阶-区间修改+区间查询
    具体数学-第二章-和式
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9698896.html
Copyright © 2011-2022 走看看