Stall Reservations

Stall Reservations

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit   Status   Practice   POJ 3190

Appoint description:   System Crawler  (2015-04-27)

Description

Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must create a reservation system to determine which stall each cow can be assigned for her milking time. Of course, no cow will share such a private moment with other cows.  

Help FJ by determining:

• The minimum number of stalls required in the barn so that each cow can have her private milking period
• An assignment of cows to these stalls over time

Many answers are correct for each test dataset; a program will grade your answer.

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
1
2
3
2
4

Hint

Explanation of the sample:  

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
#include
#include
#include
#include
using namespace std;
struct Cow{
 int st;
 int ed;
 int id;
 bool operator <(const Cow &a)const
 {
  return ed > a.ed;
 }
}cow[50005];
int leap[50005], stall[500005];
bool cmp(const Cow&a, const Cow&b)
{
 if (a.st == b.st)return a.ed < b.ed;
 return a.st < b.st;
}
priority_queueq;
int main()
{

 int n, i, j;
 cin >> n;
 for (i = 1; i <= n; i++)
 {
  scanf("%d%d", &cow[i].st, &cow[i].ed);
  cow[i].id = i;
 }
 sort(cow + 1, cow + 1 + n, cmp);
 memset(leap, 0, sizeof(leap));
 
 int pre, ans;
 ans = 1;
 q.push(cow[1]);
 stall[cow[1].id] = ans;
 for (i = 2; i <= n; i++)
 {
  if (!q.empty() && q.top().ed < cow[i].st)
  {
   stall[cow[i].id] = stall[q.top().id];
   q.pop();
  }
  else
  {
   ans++;
   stall[cow[i].id] = ans;
  }
  q.push(cow[i]);
 }
 printf("%d\n", ans);
 for (i = 1; i <= n; i++)
  printf("%d\n", stall[i]);
 return 0;
}