poj 2376

Cleaning Shifts
Time Limit: 1000MS        Memory Limit: 65536K
Total Submissions: 36226        Accepted: 8749
Description

Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000), the first being shift 1 and the last being shift T. 

Each cow is only available at some interval of times during the day for work on cleaning. Any cow that is selected for cleaning duty will work for the entirety of her interval. 

Your job is to help Farmer John assign some cows to shifts so that (i) every shift has at least one cow assigned to it, and (ii) as few cows as possible are involved in cleaning. If it is not possible to assign a cow to each shift, print -1.
Input

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

* Lines 2..N+1: Each line contains the start and end times of the interval during which a cow can work. A cow starts work at the start time and finishes after the end time.
Output

* Line 1: The minimum number of cows Farmer John needs to hire or -1 if it is not possible to assign a cow to each shift.
Sample Input

3 10
1 7
3 6
6 10
Sample Output

2
Hint

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed. 

INPUT DETAILS: 

There are 3 cows and 10 shifts. Cow #1 can work shifts 1..7, cow #2 can work shifts 3..6, and cow #3 can work shifts 6..10. 

OUTPUT DETAILS: 

By selecting cows #1 and #3, all shifts are covered. There is no way to cover all the shifts using fewer than 2 cows.
Source

USACO 2004 December Silver

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
typedef long long ll;
#define lowbit(x) (x&(-x))
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
using namespace std;
#define pi acos(-1)
#define P pair<ll,ll>
const int N  = 2e6+200;
const ll mod= 1000000007;
ll n,t;
int main()
{
    scanf("%lld%lld",&n,&t);
    ll x,y;
    priority_queue<P,vector<P>,greater<P> >Q;
    for(int i=0;i<n;i++){
        scanf("%lld%lld",&x,&y);
        Q.push(P(x,y));
    }    
    int flag=1;
    ll  en=0,cnt=0;
    while(en<t&&flag){
        flag=0;
        int st = en+1;
        while(!Q.empty()&&Q.top().first<=st){//和区间问题有差异，点是独立的。 
            ll u = Q.top().second;
            Q.pop();
            if(u>en){
                en = u;
                flag=1;//只要flag =1，那么en 就在不断变大 
                // 找到的第一个的左一定是1，而右是符合条件里面的的最大值 
            }
        }
        cnt++;
    }
    if(flag) printf("%lld
",cnt);//只要flag==1,就一定可以找到满足题意的。 
    else printf("-1
");    
    return 0;
}