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 <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <set>
#include <queue>
#include <string.h>
#define INF 0x3fffffff
#define maxn 50005
typedef long long LL;
using namespace std;
struct Node {
int s, e, p;
// 按照结束位置小的排序,之后取耗时短的,即开始时间大
friend bool operator < (const Node &a, const Node &b) {
if (a.e == b.e) {
return a.s < b.s;
} else {
return a.e > b.e;
}
}
}node[maxn];
int ans[maxn];
// 按照起始时间排序,之后取耗时短的,即结束时间小
bool cmp(const Node &a, const Node &b) {
if (a.s == b.s) {
return a.e < b.e;
} else {
return a.s < b.s;
}
}
int main() {
//freopen("in.txt", "r", stdin);
int n;
while (cin >> n) {
for (int i = 0; i < n; i++) {
scanf("%d%d", &node[i].s, &node[i].e);
node[i].p = i; // record the position
}
sort(node, node+n, cmp);
int sum = 1;
ans[node[0].p] = 1;
priority_queue<Node> q;
q.push(node[0]);
for (int i = 1; i < n; i++) {
if (!q.empty() && q.top().e < node[i].s) {
ans[node[i].p] = ans[q.top().p];
q.pop();
q.push(node[i]);
} else {
sum++;
ans[node[i].p] = sum;
q.push(node[i]);
}
}
printf("%d\n", sum);
for (int i = 0; i < n; i++) {
printf("%d\n", ans[i]);
}
}
return 0;
}