简单的离散化切割矩形，数据不大，写模拟还快些。
#include <cstdio>#include <string>int N, C, color[10], cs = 1;typedef struct 
...{
int x1, y1, x2, y2, c;
} Rect;Rect r[1001];inline int iabs ( int x )...{ return x < 0 ? -x : x;}int init ()...{ scanf ( "%d%d", &N, &C ); if ( N == 0 ) return 0; int i, t; for ( i = 0; i < N; i ++ )
...{ scanf ( "%d%d%d%d%d", &r[i].c, &r[i].x1, &r[i].y1, &r[i].x2, &r[i].y2 ); if ( r[i].x1 > r[i].x2 ) ...{ t = r[i].x1; r[i].x1 = r[i].x2; r[i].x2 = t;
} if ( r[i].y1 > r[i].y2 ) ...{ t = r[i].y1; r[i].y1 = r[i].y2; r[i].y2 = t; } } return 1;}int paint ( int x1, int y1, int x2, int y2, int lev )...{ if ( lev == N - 1 ) return iabs ( ( x2 - x1 ) * ( y2 - y1 ) ); int rx1 = r[lev + 1].x1, rx2 = r[lev + 1].x2, ry1 = r[lev + 1].y1, ry2 = r[lev + 1].y2; if ( x1 < rx1 && x2 > rx1 ) return paint ( x1, y1, rx1, y2, lev + 1 ) + paint ( rx1, y1, x2, y2, lev ); if ( x2 > rx2 && x1 < rx2 ) return paint ( x1, y1, rx2, y2, lev ) + paint ( rx2, y1, x2, y2, lev + 1 ); if ( y1 < ry1 && y2 > ry1 ) return paint ( x1, y1, x2, ry1, lev + 1 ) + paint ( x1, ry1, x2, y2, lev ); if ( y2 > ry2 && y1 < ry2 ) return paint ( x1, y1, x2, ry2, lev ) + paint ( x1, ry2, x2, y2, lev + 1 ); if ( x1 >= rx1 && y1 >= ry1 && x2 <= rx2 && y2 <= ry2 ) return 0; else return paint ( x1, y1, x2, y2, lev + 1 );}void proc ()...{ memset ( color, 0x00, sizeof ( color ) ); int i; for ( i = N - 1; i >= 0; i -- ) color[r[i].c] += paint ( r[i].x1, r[i].y1, r[i].x2, r[i].y2, i );}void print ()...{ printf ( "The area of color %d in dataset %d is: %d ", C, cs ++, color[C] );}int main ()...{ //freopen ( "in.txt", "r", stdin ); while ( init () ) ...{ proc (); print (); } return 0;}