[Usaco2006 Feb]Stall Reservations 专用牛棚

Problem ：

目录

Problem ：

Description

Input

Output

Sample Input

Sample Output

---

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 149  Solved: 66
[Submit][Status][Web Board]

Description

Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over s
ome precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviou
sly, FJ must create a reservation system to determine which stall each cow can be assigned for her m
ilking time. Of course, no cow will share such a private moment with other cows. Help FJ by determin
ing: * The minimum number of stalls required in the barn so that each cow can have her private milki
ng period * An assignment of cows to these stalls over time

有N头牛,每头牛有个喝水时间,这段时间它将专用一个Stall 现在给出每头牛的喝水时间段,问至少要多少个Stall
才能满足它们的要求

Input

* Line 1: A single integer, N
* Lines 2..N+1: Line i+1 describes cow i's milking interval with two space-separated integers.

Output

* Line 1: The minimum number of stalls the barn must have.
* Lines 2..N+1: Line i+1 describes the stall to which cow i will be assigned for her milking period.

Sample Input

5
1 10
2 4
3 6
5 8
4 7

Sample Output

4
//Here's a graphical schedule for this output:
Time 1 2 3 4 5 6 7 8 9 10
Stall 1 c1>>>>>>>>>>>>>>>>>>>>>>>>>>>
Stall 2 .. c2>>>>>> c4>>>>>>>>> .. ..
Stall 3 .. .. c3>>>>>>>>> .. .. .. ..
Stall 4 .. .. .. c5>>>>>>>>> .. .. ..
Other outputs using the same number of stalls are possible.

#include <cstdio>
#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;

typedef long long LL;

inline int read()
{
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
        s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}

const int N = 5e4 + 10;

struct node
{
    int st, ed, index, ans;
} a[N];

bool cmp1(node x, node y)
{
    return x.index < y.index;
}

bool cmp2(node x, node y)
{
    return x.st < y.st;
}

struct qnum
{
    int x;
    bool operator<(const qnum &t) const
    {
        return a[x].ed > a[t.x].ed;
    }
};

int main()
{
    int n = read();
    for (int i = 1; i <= n; i++)
        a[i].st = read(), a[i].ed = read(), a[i].index = i, a[i].ans = 0;
    priority_queue<qnum, vector<qnum>> q;
    sort(a + 1, a + n + 1, cmp2);
    qnum k;
    k.x = 1;
    q.push(k);
    a[1].ans = 1;
    for (int i = 2; i <= n; i++)
    {
        if (a[q.top().x].ed < a[i].st)
        {
            a[i].ans = a[q.top().x].ans;
            q.pop();
            qnum k;
            k.x = i;
            q.push(k);
        }
        else
        {
            qnum k;
            k.x = i;
            q.push(k);
            a[i].ans = q.size();
        }
    }
    cout << q.size() << "\n";
    sort(a + 1, a + n + 1, cmp1);
    for (int i = 1; i <= n; i++)
    {
        cout << a[i].ans << "\n";
    }
}