Muddy roads

     
     

      
      

       
       

      
      
      
      

       
       H - Muddy roads
      
      
      
      Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu
      
      

       
       Submit 
       
       Status
      
      
     
     
     
     

      
      

       
       

        
        
Description
        
        

         
         

          
          Farmer John has a problem: the dirt road from his farm to town has suffered in the recent rainstorms and now contains (1 <= N <= 10,000) mud pools. 

Farmer John has a collection of wooden planks of length L that he can use to bridge these mud pools. He can overlap planks and the ends do not need to be anchored on the ground. However, he must cover each pool completely. 

Given the mud pools, help FJ figure out the minimum number of planks he needs in order to completely cover all the mud pools.
         
         
        
        
       
       
       
       

        
        
Input
        
        

         
         

          
          * Line 1: Two space-separated integers: N and L 

* Lines 2..N+1: Line i+1 contains two space-separated integers: s_i and e_i (0 <= s_i < e_i <= 1,000,000,000) that specify the start and end points of a mud pool along the road. The mud pools will not overlap. These numbers specify points, so a mud pool from 35 to 39 can be covered by a single board of length 4. Mud pools at (3,6) and (6,9) are not considered to overlap. 

         
         
        
        
       
       
       
       

        
        
Output
        
        

         
         

          
          * Line 1: The miminum number of planks FJ needs to use.
         
         
        
        
       
       
       
       

        
        
Sample Input
        
        

         
         
3 3
1 6
13 17
8 12
         
         

         
         
          
          

           
           

            
            
#include<algorithm>
#include<math.h>
#include<stdio.h>
#include<string.h>
using namespace std;
int now=0,ans,t;
struct node
{
    int x,y;
}aa[10005];
int cmp(node m,node n)
{
    return m.x<n.x;
}
int main()
{
    int m,l;
    ans=0;
    scanf("%d%d",&m,&l);
    for(int i=0;i<m;i++)
    scanf("%d%d",&aa[i].x,&aa[i].y);
    sort(aa,aa+m,cmp);
    for(int i=0;i<m;i++)
    {
        if(now>=aa[i].y)
            continue;
        now=max(now,aa[i].x);
        int k=aa[i].y-now;
        t=k/l;
        if(k%l)
            t++;
        ans+=t;
        now+=t*l;
    }
    printf("%d\n",ans);
}