【模拟】【USACO】Shaping Regions

 

N opaque rectangles (1 <= N <= 1000) of various colors are placed on a white sheet of paper whose size is A wide by B long. The rectangles are put with their sides parallel to the sheet's borders. All rectangles fall within the borders of the sheet so that different figures of different colors will be seen.

The coordinate system has its origin (0,0) at the sheet's lower left corner with axes parallel to the sheet's borders.

PROGRAM NAME: rect1

INPUT FORMAT

The order of the input lines dictates the order of laying down the rectangles. The first input line is a rectangle "on the bottom".

Line 1:	A, B, and N, space separated (1 <= A,B <= 10,000)
Lines 2-N+1:	Five integers: llx, lly, urx, ury, color: the lower left coordinates and upper right coordinates of the rectangle whose color is `color' (1 <= color <= 2500) to be placed on the white sheet. The color 1 is the same color of white as the sheet upon which the rectangles are placed.

SAMPLE INPUT (file rect1.in)

20 20 3
2 2 18 18 2
0 8 19 19 3
8 0 10 19 4

INPUT EXPLANATION

Note that the rectangle delineated by 0,0 and 2,2 is two units wide and two high. Here's a schematic diagram of the input:

11111111111111111111
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
11222222442222222211
11222222442222222211
11222222442222222211
11222222442222222211
11222222442222222211
11222222442222222211
11111111441111111111
11111111441111111111

The '4's at 8,0 to 10,19 are only two wide, not three (i.e., the grid contains a 4 and 8,0 and a 4 and 8,1 but NOT a 4 and 8,2 since this diagram can't capture what would be shown on graph paper).

OUTPUT FORMAT

The output file should contain a list of all the colors that can be seen along with the total area of each color that can be seen (even if the regions of color are disjoint), ordered by increasing color. Do not display colors with no area.

SAMPLE OUTPUT (file rect1.out)

1 91
2 84
3 187
4 38

 
 

描述
N个不同的颜色的不透明的长方形(1 <= N <= 1000)被放置在一张横宽为A竖长为B的白纸上。 这些长方形被放置时，保证了它们的边与白纸的边缘平行。 所有的长方形都放置在白纸内，所以我们会看到不同形状的各种颜色。 坐标系统的原点(0,0)设在这张白纸的左下角，而坐标轴则平行于边缘。
[编辑]格式
PROGRAM NAME: rect1
INPUT FORMAT:
(file rect1.in)
按顺序输入放置长方形的方法。第一行输入的是那个放在底的长方形(即白纸)。
第 1 行: A ， B 和 N, 由空格分开 (1 <=A, B<=10,000)
第 2 到N+1行: 为五个整数　llx, lly, urx, ury, color　这是一个长方形的左下角坐标，右上角坐标(x+1,y+1)和颜色。
颜色 1和底部白纸的颜色相同。 (1 <= color <= 2500)
OUTPUT FORMAT：
(file rect1.out)
输出且仅输出所有能被看到颜色，和该颜色的总面积(可以由若干个不连通的色块组成)，按color增序排列。
 
[编辑]SAMPLE INPUT
20 20 3
2 2 18 18 2
0 8 19 19 3
8 0 10 19 4


[编辑]SAMPLE OUTPUT
1 91
2 84
3 187
4 38


[编辑]INPUT EXPLANATION
请注意：被(0,0)和(2,2)所描绘的是2个单位宽、2个单位高的区域
这里有一个示意图输入：
11111111111111111111
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
33333333443333333331
11222222442222222211
11222222442222222211
11222222442222222211
11222222442222222211
11222222442222222211
11222222442222222211
11111111441111111111
11111111441111111111

'4'在(8,0)与(10,19)形成的是宽为2的区域,而不是3.（也就是说，4形成的区域包含(8,0)和(8,1) ，而不是(8,0)和(8,2)） 。
 

 
 

/*
ID:sephiro5
LANG:C++
PROG:rect1
*/
#include <stdio.h>
#define maxn 10010

int color[maxn];
int x1[maxn],x2[maxn],y1[maxn],y2[maxn];
int ans[maxn];
int n,maxcol;
int a,b;
int l[maxn],r[maxn],s[maxn],d[maxn],cl[maxn];
bool v[maxn];

void dfs(int l,int r,int s,int d,int k,int cl)
{
     while ((k<=n)&&((r<=x1[k])||(l>=x2[k])||(s>=y2[k])||(d<=y1[k])))
           ++k;
     if (k>n) 
     {
              ans[cl]+=(r-l)*(d-s);
              return;
     }
     if (l<=x1[k])
     {
                  dfs(l,x1[k],s,d,k+1,cl);
                  l=x1[k];
     }
     if (r>=x2[k])
     {
                  dfs(x2[k],r,s,d,k+1,cl);
                  r=x2[k];
     }
     if (s<=y1[k])
     {
                  dfs(l,r,s,y1[k],k+1,cl);
                  s=y1[k];
     }
     if (d>=y2[k]) dfs(l,r,y2[k],d,k+1,cl);
}

int main()
{
    freopen("rect1.in","r",stdin);
    freopen("rect1.out","w",stdout);
    
    scanf("%d%d%d",&a,&b,&n);
    x2[0]=a; y2[0]=b; cl[0]=1;
    v[1]=1;
    for (int i=1;i<=n;++i)
    {
        scanf("%d%d%d%d%d",&x1[i],&y1[i],&x2[i],&y2[i],&cl[i]);
        if (cl[i]>maxcol) maxcol=cl[i];
        v[cl[i]]=1;
    }
                         
    for (int i=n;i>=0;--i)
        dfs(x1[i],x2[i],y1[i],y2[i],i+1,cl[i]);
        
    for (int i=1;i<=maxcol;++i)
        if (ans[i])
           printf("%d %d/n",i,ans[i]);
    
    return 0;
}