Treasure Map（ZOJ - 3209）

最新推荐文章于 2020-07-11 23:18:41 发布

Spidy_harker

最新推荐文章于 2020-07-11 23:18:41 发布

阅读量414

点赞数

分类专栏： # 专题三 Dancing Links 数据结构 dfs

本文链接：https://blog.csdn.net/Spidy_harker/article/details/105109874

版权

本文介绍了一种解决宝藏地图拼接问题的方法，利用DLX算法确定最少的矩形碎片来组成完整的地图。题目给出地图的宽度、高度和矩形碎片数量，然后列出每个矩形碎片的坐标。你需要不重叠地使用这些碎片，以重建完整的地图。如果可能，输出最少所需的碎片数量，否则输出-1。示例中展示了不同情况的结果，包括能够用单个碎片完成的地图，无法避免重叠的案例，以及可以使用更少碎片的情况。

摘要由CSDN通过智能技术生成

Your boss once had got many copies of a treasure map. Unfortunately, all the copies are now broken to many rectangular pieces, and what make it worse, he has lost some of the pieces. Luckily, it is possible to figure out the position of each piece in the original map. Now the boss asks you, the talent programmer, to make a complete treasure map with these pieces. You need to make only one complete map and it is not necessary to use all the pieces. But remember, pieces are not allowed to overlap with each other (See sample 2).

Input

The first line of the input contains an integer T (T <= 500), indicating the number of cases.

For each case, the first line contains three integers n m p (1 <= n, m <= 30, 1 <= p <= 500), the width and the height of the map, and the number of pieces. Then p lines follow, each consists of four integers x1 y1 x2 y2 (0 <= x1 < x2 <= n, 0 <= y1 < y2 <= m), where (x1, y1) is the coordinate of the lower-left corner of the rectangular piece, and (x2, y2) is the coordinate of the upper-right corner in the original map.

Cases are separated by one blank line.

在这里插入图片描述

Output

If you can make a complete map with these pieces, output the least number of pieces you need to achieve this. If it is impossible to make one complete map, just output -1.
Sample Input

3
5 5 1
0 0 5 5

5 5 2
0 0 3 5
2 0 5 5

30 30 5
0 0 30 10
0 10 30 20
0 20 30 30
0 0 15 30
15 0 30 30
Sample Output

1
-1
2
Hint

For sample 1, the only piece is a complete map.

For sample 2, the two pieces may overlap with each other, so you can not make a complete treasure map.

For sample 3, you can make a map by either use the first 3 pieces or the last 2 pieces, and the latter approach one needs less pieces.

思路：
把小矩形的块数作为行数，大矩形的小格子数作为列数，DLX即可

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int maxnode = 500010;
const int MaxM = 1010;
const int MaxN = 510;
struct DLX
{
   
    int n,m,siz;
    int U[maxnode],D[maxnode],R[maxnode],L[maxnode],Row[maxnode],Col[maxnode];
    int H[MaxN],S[MaxM];
    int ansed;
    void init(int _n,int _m)
    {
   
        n = _n;
        m = _m;
        for(int i = 0;i <=

最低0.47元/天解锁文章