CSUOJ 1603 Scheduling the final examination

1603: Scheduling the final examination

Time Limit: 10 Sec Memory Limit: 128 MB
Submit: 49 Solved: 15

Description

For the most of the university students，what they most want is that they can obtain 60 points from the final examination of every subject. Now, final examination is coming. As an excellent programmer，you are asked for help. The full mark is 100, and it is need greater than or equal to 60 to pass subjects. Given the description of every subject, you should schedule the time of review to every subject in order to pass every subject and at the same time to obtain the higher total scores as possible.

Input

The input consists of multiple test cases. For each test case, the first line is an integer n (1<=n<=50), which is the number of subjects. Then n lines follow, each line has four integers si, ti, ai, di to describe the subject. si(0<=si<=100)：the score that he can obtained without reviewing，ti(1<=ti<720)：the time of examination，
ai(1<=ai<=40)：the first hour reviewing on this subject will improve ai scores，di(0<=di<=4)：the improving scores will decrease di every reviewing hour. For example，when ai = 10, di = 2, the first hour viewing will improve 10 scores , and the second hour viewing will only improve 8 scores.

Output

For each test case, to output in one line. If he can pass all the subjects, please output an integer which is the highest total scores, otherwise please output a string “you are unlucky”.

Sample Input

Sample Output

65

63

280

274

you are unlucky

HINT

Please noting: every subject’ full scores is 100. So when you get a result of one subject which is bigger than 100, you should regard the result as 100.

解题：贪心

首先要保证都及格，按考试时间从小到大排序，设置一个时间占用的数组用以标记此时间是否被占用，然后对没及格的科目，从截至时间从后往前走，发现一个没被用的时间，就占用该时间，直到及格。

然后用优先队列，优先选择当前能获得分数最高的先复习，同样是从截至时间往前走，遇到没占用的，直接占用，跳出循环。如果有多个最高值，直接选择截至时间靠前的。。。

 #include <bits/stdc++.h>

 using namespace std;

 const int maxn = ;

 struct node {

     int s,t,a,d;

     bool operator<(const node &x) const {

         if(a == x.a) return t < x.t;

         return a < x.a;

     }

 } course[maxn];

 int n;

 bool used[maxn];

 priority_queue<node>q;

 bool cmp(const node &x,const node &y) {

     return x.t < y.t;

 }

 int main() {

     int ret;

     bool flag;

     while(~scanf("%d",&n)) {

         memset(used,false,sizeof used);

         flag = true;

         while(!q.empty()) q.pop();

         for(int i = ret = ; i < n; ++i)

             scanf("%d %d %d %d",&course[i].s,&course[i].t,&course[i].a,&course[i].d);

         sort(course,course+n,cmp);

         for(int i = ; i < n; ++i) {

             for(int j = course[i].t; course[i].a >  && j >  && course[i].s < ; --j) {

                 if(!used[j]) {

                     used[j] = true;

                     course[i].s = min(,course[i].s + course[i].a);

                     course[i].a = max(,course[i].a - course[i].d);

                 }

             }

             if(course[i].s < ) {

                 flag = false;

                 break;

             } else q.push(course[i]);

         }

         while(flag && !q.empty()) {

             node now = q.top();

             q.pop();

             if(now.s ==  || now.a == ) {

                 ret += now.s;

                 continue;

             }

             bool mark = false;

             for(int i = now.t; i > ; --i) {

                 if(!used[i]) {

                     mark = used[i] = true;

                     now.s = min(,now.s + now.a);

                     now.a = max(,now.a - now.d);

                     break;

                 }

             }

             if(mark) q.push(now);

             else ret += now.s;

         }

         if(flag) printf("%d\n",ret);

         else puts("you are unlucky");

     }

     return ;

 }