简单水贪心 hdu 2831

Plants VS Zombies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 530    Accepted Submission(s): 213
Special Judge

Problem Description

Plants VS Zombies is a popular game in the TJU ACM Team now. However, RoBa is not very good at this game, so he wants you to write a program to help him.

We take a simplified version of this game. There are N rows in your backyard, and there are N zombies want to walk through your yard to eat your brain, and exactly one zombie in each row. The only method to defense the zombies is to plant “peashooter” on the other side of the yard. However, you need T seconds to plant one peashooter. Once the peashooter is planted, it will begin to shoot at the zombies in its row. The zombies have different speed Vi and defense Di, which means that, the zombie in the i-th row need Vi second the walk though the yard, and the i-th zombie will be killed after Di second of shooting. Please note you can only plant one peashooter in each row.

Unfortunately, in some cases, for the zombies are too fast and/or too strong and/or your planting is too slow, you cannot kill all the zombies in time, so the zombies will eat your brains.

 

Input

There are several test cases in the input. The first line of each test case contains two integers N (1 <= N <= 100) and T, indicating the number of rows and the time for planting one peashooter. Then N lines follow, each of which contains two integers Vi and Di.

 

Output

Output one line for each test case. If you can kill all the zombies, output N numbers separated by a space, that is, a permutation of 1,2,…N, indicating the order of your planting. If you cannot defend your yard, output “The zombies eat your brains!” in one line.

 

Sample Input

  
  

   
   3 10
20 10
40 10
30 10
3 10
20 10
40 11
30 10
  
  

 

Sample Output

  
  

   
   1 3 2
The zombies eat your brains!

   
   

    
    

     
     Hint
    
    
Hint: For the first case, you should plant a peashooter in the first row, then plant in the third row, then the second row. 
Then all the zombies are killed just in time. For the second case, however, the zombie in second row is a little stronger, so you cannot kill all of them.

   
   
   
    
  
  

 

Source

2009 Multi-University Training Contest 2 - Host by TJU

 

Recommend

gaojie   |   We have carefully selected several similar problems for you:   2832  2826  2828  2829  2834 

 

贪心策略：   空闲时间少的   优先考虑  

源代码：

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct js
{
  int d,t,r,s;       
}j[105];
int cmp(js a,js b)
{
  return a.s<b.s;    
}
int main()
{
       int n,t;
       while(scanf("%d%d",&n,&t)!=EOF)
          {
              for(int i=0;i<n;i++)
               {
                 scanf("%d%d",&j[i].t,&j[i].d);
                 j[i].r=i+1;
                 j[i].s=j[i].t-j[i].d-t;
               }
              sort(j,j+n,cmp);
              int flag=0,time=t;
              for(int i=0;i<n;i++)
               {
             //    printf("%d %d %d\n",j[i].t,j[i].d,time);
                 if(j[i].t<(j[i].d+time)) {flag=1; break;} 
                 time += t;    
               }
              if(flag)  printf("The zombies eat your brains!\n");
              else  {
                       int i;
                       for(i=0;i<n;i++)
                        {
                         printf("%d",j[i].r);
                         break;
                        }
                       for(int k=i+1;k<n;k++)
                        {
                         printf(" %d",j[k].r);       
                        }
                       printf("\n");
                    }                               
          }
}