poj2373 浇灌草场

#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<vector>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<stack>
#include<memory.h>
#include<ctype.h>

using namespace std;
typedef long long ll;

const int maxl(1000000+10);
const int maxn=1000+10;
const int inf=1<<30;
int cow[maxl];
int f[maxl];
int n,l,a,b;
struct fx{
    int x,f;
    bool operator<(const fx& fa)const{
        return f>fa.f;

    }
    fx(int xx=0,int yy=0):x(xx),f(yy){}
};
priority_queue<fx> q;
int main(){

     while(cin>>n>>l>>a>>b){
            while(!q.empty()){
                q.pop();
            }
      a<<=1;b<<=1;
      int s,e;
      memset(cow,0,sizeof(cow));
      for(int i=0;i<n;i++){
            cin>>s>>e;
            ++cow[s+1];
            --cow[e];
      }
      int cows=0;
      for(int i=0;i<=l;i++){
        f[i]=inf;
        cows+=cow[i];
        cow[i]=cows>0;
      }
      for(int i=a;i<=b;i+=2){
            if(!cow[i]){
                    f[i]=1;
                    if(i<=b+2-a){
                        q.push(fx(i,1));
                    }
            }
      }
      for(int i=b+2;i<=l;i+=2){
        if(!cow[i]){
            fx x;
            while(!q.empty()){
                x=q.top();
                if(x.x<i-b){
                    q.pop();
                }
                else break;
            }
            if(!q.empty())f[i]=x.f+1;
        }
            if(f[i-a+2]!=inf){
                q.push(fx(i-a+2,f[i-a+2]));
            }
        
      }
      if(f[l]==inf)cout<<-1<<endl;
      else cout<<f[l]<<endl;
      }
      return 0;



}//再研究一下，未完