URAL 1147 Shaping Regions

/*
题意：一个10000*10000的矩阵，初始颜色都为1，然后最多2500次涂色，
每次涂色将一个矩形的面积涂成某个特定颜色，问涂完之后每种颜色最终的面积。
 
解法：倒序计算，矩形切割
*/
# include <stdio.h>
# include <algorithm>
# include <iostream>
# include <string.h>
# include <math.h>
using namespace std;
struct node
{
    int x1,x2,y1,y2,c;
};
struct node a[100010];
int num[3000];
int n;
int area(int x3,int y3,int x4,int y4,int k)///k为在他上面的那一块
{
    while(k<n&&(a[k].x1>x4||a[k].x2<x3||a[k].y1>y4||a[k].y2<y3))///直到哪一个有被覆盖
        k++;
    if(k==n)
        return (x4-x3)*(y4-y3);
    int ret=0;
    if(a[k].x1>x3)
    {
        ret+=area(x3,y3,a[k].x1,y4,k+1);
        x3=a[k].x1;
    }
    if(a[k].x2<x4)
    {
        ret+=area(a[k].x2,y3,x4,y4,k+1);
        x4=a[k].x2;
    }
    if(a[k].y1>y3)
    {
        ret+=area(x3,y3,x4,a[k].y1,k+1);
        y3=a[k].y1;
    }
    if(a[k].y2<y4)
    {
        ret+=area(x3,a[k].y2,x4,y4,k+1);
        y4=a[k].y2;
    }
    return ret;
}
int main()
{

    int a1,b,i,sum,s;
    while(~scanf("%d%d%d",&a1,&b,&n))
    {
        for(i=0; i<n; i++)
            scanf("%d %d %d %d %d",&a[i].x1,&a[i].y1,&a[i].x2,&a[i].y2,&a[i].c);
        memset(num,0,sizeof(num));
        sum=0;
        for(i=n-1; i>=0; i--)
        {
             s=area(a[i].x1,a[i].y1,a[i].x2,a[i].y2,i+1);
            num[a[i].c]+=s;
            sum+=s;
        }
        num[1]+=a1*b-sum;
        for(i=1; i<=2500; i++)
            if(num[i])
                printf("%d %d\n",i,num[i]);
    }

    return 0;
}