HDU 4442 Physical Examination (贪心选择）

Physical Examination

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6823    Accepted Submission(s): 2006

Problem Description

WANGPENG is a freshman. He is requested to have a physical examination when entering the university.
Now WANGPENG arrives at the hospital. Er….. There are so many students, and the number is increasing!
There are many examination subjects to do, and there is a queue for every subject. The queues are getting longer as time goes by. Choosing the queue to stand is always a problem. Please help WANGPENG to determine an exam sequence, so that he can finish all the physical examination subjects as early as possible.

 

Input

There are several test cases. Each test case starts with a positive integer n in a line, meaning the number of subjects(queues).
Then n lines follow. The i-th line has a pair of integers (ai, bi) to describe the i-th queue:
1. If WANGPENG follows this queue at time 0, WANGPENG has to wait for ai seconds to finish this subject.
2. As the queue is getting longer, the waiting time will increase bi seconds every second while WANGPENG is not in the queue.
The input ends with n = 0.
For all test cases, 0<n≤100000, 0≤a _i,b _i<2 ³¹.

 

Output

For each test case, output one line with an integer: the earliest time (counted by seconds) that WANGPENG can finish all exam subjects. Since WANGPENG is always confused by years, just print the seconds mod 365×24×60×60.

 

Sample Input

  
  

   
   5
1 2
2 3
3 4
4 5
5 6
0
  
  

 

Sample Output

  
  

   
   1419

   
   

    
    

     
     Hint
    
    
In the Sample Input, WANGPENG just follow the given order. He spends 1 second in the first queue, 5 seconds in the 2th queue, 27 seconds in the 3th queue, 
169 seconds in the 4th queue, and 1217 seconds in the 5th queue. So the total time is 1419s. WANGPENG has computed all possible orders in his 
120-core-parallel head, and decided that this is the optimal choice.

   
   
   
    
  
  

 

Source

2012 Asia JinHua Regional Contest

题解：

假设已经花了t秒，现在有两个选择，所需时间分别为a1, b1和a2, b2。

先选项目1再选项目2所需时间为：t1 = a1+b1*t + b2*(a1+b1*t+t)+a2 = a1+a2+(b1+b2)*t+b1*b2*t+a1*b2

先选项目2再选项目1所需时间为：t2 = a2+b2*t + b1*(a2+b2*t+t)+a1 = a1+a2+(b1+b2)*t+b1*b2*t+a2*b1

我们发现， 这个等式只与最后一个有关，

所以我们可以重载一个结构体的小于号， 然后排序贪心选择即可。

#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long LL;
const int N = 100010;
const LL MOD = 365*24*60*60;

struct node{
    LL a, b;
    bool operator<(const node & X) const {
        return a * X.b < X.a * b;
    }
}Node[N];

int main() {
    int n;
    while (scanf("%d", &n), n) {
        for (int i = 0; i < n; ++i)
            scanf("%lld%lld", &Node[i].a, &Node[i].b);
        sort(Node, Node + n);
        LL ans = 0;
        LL t = 0;
        for (int i = 0; i < n; ++i) {
            t = (Node[i].a + Node[i].b * ans) % MOD;
            ans = (ans + t) % MOD;
        }

        printf("%lld\n", ans);

    }

    return 0;
}