CodeForces - 31D Chocolate【几何】【连通块】

题目链接：https://codeforces.com/contest/31/problem/D

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define lowbit(x) (x & (-x))
#define CASET int _; scanf("%d", &_); for(int kase=1;kase<=_;kase++)

typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;

static const int INF=0x3f3f3f3f;
static const ll INFL=0x3f3f3f3f3f3f3f3f;
static const db EPS=1e-10;
static const db PI=acos(-1.0);
static const int MOD=1e9+7;

template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
static const int MAXN=100*100+10;
bool d[MAXN][MAXN];
int n,m,t;
bool vis[MAXN];
vector<int> ans;
int main()
{
    read(m); read(n); read(t);
    while(t--)
    {
        int x0,x1,y0,y1;
        read(y0);read(x0);  read(y1);read(x1); 
        if(x0==x1)
        {
            if(y0>y1) swap(y0,y1);
            for(int i=y0;i<y1;i++)
                if(x0) d[(x0-1)*m+i][x0*m+i]=d[x0*m+i][(x0-1)*m+i]=true;
        }
        else
        {
            if(x0>x1) swap(x0,x1);
            for(int i=x0;i<x1;i++)
                if(y0) d[i*m+y0-1][i*m+y0]=d[i*m+y0][i*m+y0-1]=true;
        }
    }
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            if(!vis[i*m+j])
            {
                queue<int> Q;
                Q.push(i*m+j);
                vis[i*m+j]=true;
                int cnt=0;
                while(!Q.empty())
                {
                    int u=Q.front();
                    Q.pop();
                    int x=u/m,y=u%m;
                    cnt++;
                    if(x+1<n && !vis[(x+1)*m+y] && !d[u][(x+1)*m+y])
                    {
                        Q.push((x+1)*m+y);
                        vis[(x+1)*m+y]=true;
                    }
                    if(y+1<m && !vis[x*m+y+1] && !d[u][x*m+y+1])
                    {
                        Q.push(x*m+y+1);
                        vis[x*m+y+1]=true;
                    }
                }
                ans.push_back(cnt);
            }
    sort(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++)
        printf("%d ",ans[i]);
    return 0;
}