UVA 11134 - Fabled Rooks(贪心+优先队列)
We would like to place n rooks, 1 ≤ n ≤ 5000, on a n×n board subject to the following restrictions
- The i-th rook can only be placed within the rectangle given by its left-upper corner (xli, yli) and its right-lower corner (xri, yri), where 1 ≤ i ≤ n, 1 ≤ xli ≤ xri ≤ n, 1 ≤ yli ≤ yri ≤ n.
- No two rooks can attack each other, that is no two rooks can occupy the same column or the same row.
The input consists of several test cases. The first line of each of them contains one integer number, n, the side of the board. n lines follow giving the rectangles where the rooks can be placed as described above. The i-th line among them gives xli, yli, xri, and yri. The input file is terminated with the integer `0' on a line by itself.
Your task is to find such a placing of rooks that the above conditions are satisfied and then output n lines each giving the position of a rook in order in which their rectangles appeared in the input. If there are multiple solutions, any one will do. Output IMPOSSIBLE if there is no such placing of the rooks.
Sample input
8 1 1 2 2 5 7 8 8 2 2 5 5 2 2 5 5 6 3 8 6 6 3 8 5 6 3 8 8 3 6 7 8 8 1 1 2 2 5 7 8 8 2 2 5 5 2 2 5 5 6 3 8 6 6 3 8 5 6 3 8 8 3 6 7 8 0
Output for sample input
1 1 5 8 2 4 4 2 7 3 8 5 6 6 3 7 1 1 5 8 2 4 4 2 7 3 8 5 6 6 3 7
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;
const int N = 5005;
int n;
struct Car {
int xl, xr, yl, yr;
int px, py, id;
} car[N];
bool cmp1(Car a, Car b) {
if (a.yl != b.yl)
return a.yl < b.yl;
return a.yr < b.yr;
}
bool cmp2(Car a, Car b) {
if (a.xl != b.xl)
return a.xl < b.xl;
return a.xr < b.xr;
}
bool cmp3(Car a, Car b) {
return a.id < b.id;
}
void init() {
for (int i = 0; i < n; i ++) {
scanf("%d%d%d%d", &car[i].xl, &car[i].yl, &car[i].xr, &car[i].yr);
car[i].id = i;
}
}
bool solve() {
sort(car, car + n, cmp1);
for (int i = 1; i <= n; i ++) {
if (car[i - 1].yl > i || car[i - 1].yr < i) return false;
car[i - 1].py = i;
}
sort(car, car + n, cmp2);
for (int i = 1; i <= n; i ++) {
if (car[i - 1].xl > i || car[i - 1].xr < i) return false;
car[i - 1].px = i;
}
sort(car, car + n, cmp3);
return true;
}
int main() {
while (~scanf("%d", &n) && n) {
init();
if (solve()) {
for (int i = 0; i < n; i ++)
printf("%d %d\n", car[i].px, car[i].py);
}
else printf("IMPOSSIBLE\n");
}
return 0;
}