【坐标离散化】AOJ0531- Paint Color

日文题……一开始被题目骗了以为真的要写文件？

题目大意&&解答戳：❀

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<vector>
 #include<queue>
 using namespace std;
 int w,h,n,ans;
 const int MAXN=+;
 int x1[MAXN],x2[MAXN],y1[MAXN],y2[MAXN];
 int hashx[MAXN*],hashy[MAXN*];
 int fld[MAXN*][MAXN*];
 int dx[]={,,,-};
 int dy[]={,-,,};

 void compress()
 {
     int tx=,ty=;
     for (int i=;i<=n;i++)
     {
         hashx[++tx]=x1[i];hashx[++tx]=x2[i];
         hashy[++ty]=y1[i];hashy[++ty]=y2[i];
     }
     hashx[++tx]=;hashx[++tx]=w;
     hashy[++ty]=;hashy[++ty]=h;
     sort(hashx+,hashx+tx+);
     sort(hashy+,hashy+ty+);
     w=unique(hashx+,hashx+tx+)-(hashx+);
     h=unique(hashy+,hashy+ty+)-(hashy+);
     for (int i=;i<=n;i++)
     {
         x1[i]=lower_bound(hashx+,hashx+w+,x1[i])-hashx-;
         x2[i]=lower_bound(hashx+,hashx+w+,x2[i])-hashx-;
         y1[i]=lower_bound(hashy+,hashy+h+,y1[i])-hashy-;
         y2[i]=lower_bound(hashy+,hashy+h+,y2[i])-hashy-;
     }
     w--;h--;
 }

 void init()
 {
     scanf("%d",&n);
     for (int i=;i<=n;i++)
         scanf("%d%d%d%d",&x1[i],&y1[i],&x2[i],&y2[i]);
     compress();
 }

 void imos()    /*imos?*/
 {
     memset(fld,,sizeof(fld));
     for (int i=;i<=n;i++)
     {
         fld[x1[i]][y1[i]]++;
         fld[x2[i]][y2[i]]++;
         fld[x1[i]][y2[i]]--;
         fld[x2[i]][y1[i]]--;
     }

     for (int i=;i<w;i++)
         for (int j=;j<h;j++)
             fld[i][j]+=fld[i][j-];

     for (int j=;j<h;j++)
         for (int i=;i<w;i++)
             fld[i][j]+=fld[i-][j];
 }

 void bfs(int x,int y)
 {
     ans++;
     queue<int> qx,qy;
     qx.push(x);
     qy.push(y);
     fld[x][y]=;
     while (!qx.empty())
     {
         int xx=qx.front();qx.pop();
         int yy=qy.front();qy.pop();
         for (int i=;i<;i++)
         {
              int nx=xx+dx[i],ny=yy+dy[i];
              if (nx< || ny< || nx>w || ny>h || fld[nx][ny]>) continue;
              qx.push(nx);
              qy.push(ny);
              fld[nx][ny]=;
         }
     }
 }

 void solve()
 {
     ans=;
     for (int i=;i<w;i++)
         for (int j=;j<h;j++)
             if (fld[i][j]==) bfs(i,j);
     printf("%d\n",ans);
 }

 int main()
 {
     //freopen("input.txt","r",stdin);
     //freopen("output.txt","w",stdout);
     while (~scanf("%d%d",&w,&h)&&w&&h)
     {
         init();
         imos();
         solve();
     }
     return ;
 }