【HDOJ6665】Calabash and Landlord（dfs）

题意：二维平面上有两个框，问平面被分成了几个部分

x，y<=1e9

思路：分类讨论可以

但数据范围实在太小了，离散化以后随便dfs一下

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef pair<ll,ll> Pll;
 typedef vector<int> VI;
 typedef vector<PII> VII;
 #define N  110000
 #define M  4100000
 #define fi first
 #define se second
 #define MP make_pair
 #define pi acos(-1)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)
 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)
 #define lowbit(x) x&(-x)
 #define Rand (rand()*(1<<16)+rand())
 #define id(x) ((x)<=B?(x):m-n/(x)+1)
 #define ls p<<1
 #define rs p<<1|1

 const ll MOD=1e9+,inv2=(MOD+)/;
       double eps=1e-;
       int INF=1e9;
       int dx[]={-,,,};
       int dy[]={,,-,};

 int read()
 {
    int v=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();
    return v*f;
 }

 struct arr
 {
     int x,id;
 }x[],y[];
 int b[][],c[],d[];

 bool cmp(arr a,arr b)
 {
     return a.x<b.x;
 }

 void dfs(int x,int y)
 {
     //printf("x=%d y=%d\n",x,y);
     b[x][y]=;
     rep(i,,)
     {
         int ux=x+dx[i],uy=y+dy[i];
         if(ux>&&ux<&&uy>&&uy<&&b[ux][uy]==) dfs(ux,uy);
     }
 }

 int main()
 {
     //freopen("1.in","r",stdin);
     int cas;
     scanf("%d",&cas);
     while(cas--)
     {
         x[].x=read(),y[].x=read(),x[].x=read(),y[].x=read();
         x[].x=read(),y[].x=read(),x[].x=read(),y[].x=read();
         rep(i,,)
         {
             x[i].id=y[i].id=i;
         }
         sort(x+,x++,cmp);
         sort(y+,y++,cmp);
         int m1=,m2=;
         c[x[].id]=;
         d[y[].id]=;
         rep(i,,)
         {
             if(x[i].x==x[i-].x) c[x[i].id]=m1;
              else
              {
                  m1+=;
                  c[x[i].id]=++m1;
              }
             if(y[i].x==y[i-].x) d[y[i].id]=m2;
              else
              {
                  m2+=;
                  d[y[i].id]=++m2;
              }
         }
         rep(i,,)
          rep(j,,) b[i][j]=;
         rep(i,d[],d[]) b[c[]][i]=b[c[]][i]=;
         rep(i,d[],d[]) b[c[]][i]=b[c[]][i]=;
         rep(i,c[],c[]) b[i][d[]]=b[i][d[]]=;
         rep(i,c[],c[]) b[i][d[]]=b[i][d[]]=;
         int ans=;
         rep(i,,)
          rep(j,,)
           if(b[i][j]==)
           {
               ans++;
               dfs(i,j);
           }

         printf("%d\n",ans);

     }

     return ;
 }