USACO 3.1.4 Shaping Regions

比较经典的一道题目了。

我这次用的是漂浮法，从最后一个矩形开始做，每次都把新进来的矩形压到最底层，一层一层往上浮，并检查剩下那些部分即可。

用空学一下离散化+线段树+扫面线，还没写过~

/*
PROG:rect1
LANG:C++
*/

#include <cstdio>

const int N = 1001;
int l[N], r[N], b[N], t[N], c[N], sum[3000], color, n;

void calc(int L, int R, int B, int T, int now)
{
    while (now <= n && (R < l[now] || L > r[now] ||
                        B > t[now] || T < b[now])) ++now;
    if (now > n) { sum[color] += (R-L) * (T-B);return; }
    if (L < l[now]) { calc(L, l[now], B, T, now+1); L = l[now]; }
    if (R > r[now]) { calc(r[now], R, B, T, now+1); R = r[now]; }
    if (B < b[now]) calc(L, R, B, b[now], now+1);
    if (T > t[now]) calc(L, R, t[now], T, now+1);
}

int main()
{
    freopen("rect1.in", "r", stdin);
    freopen("rect1.out", "w", stdout);
    scanf("%d%d%d", &r[0], &t[0], &n);
    c[0] = 1;
    for (int i = 1;i <= n;++i)
        scanf("%d%d%d%d%d", &l[i], &b[i], &r[i], &t[i], &c[i]);
    for (int i = n;i >= 0;--i)
    {
        color = c[i];
        calc(l[i], r[i], b[i], t[i], i+1);
    }
    for (int i = 1;i <= 2500;++i)
    if (sum[i])
        printf("%d %d\n", i, sum[i]);
}