2017 ACM Jordanian Collegiate Programming Contest I(Counting Votes-特徵值)

在一個n*m的白板上有若干8聯通聯通塊，每塊必須是字母(H,M,Y) 中的一個，統計白板上各字母出現次數。注意各字母字體相同.

記錄特徵值。

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
int ans[10],n,m;
char s[1010][1010];
bool vis[1010][1010];
queue<pi > q;
vector< pi > v;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
inline bool inavi(int x,int y) {
    return 1<=x &&x<=n && 1<=y &&y<=m && s[x][y]=='#' && !vis[x][y];
}
int bfs(int x,int y) {
    v.erase(ALL(v));
    q.push(mp(x,y)); vis[x][y]=1;
    while(!q.empty()) {
        pi now=q.front();q.pop();
        v.pb(now); 
        int x=now.fi,y=now.se;
        Rep(d,8) {
            int nx=dx[d]+x,ny=dy[d]+y;
            if (inavi(nx,ny)) {
                q.push(mp(nx,ny));
                vis[nx][ny]=1;
            }
        }
    }
    double zx=0,zy=0;
    Rep(i,SI(v)) {
        zx+=v[i].fi, zy+=v[i].se;
    }
    zx/=(double) SI(v);
    zy/=(double) SI(v);
    double mid=1e18,mad=-1;
    for(auto p:v) {
        double d=hypot(zx-p.fi,zy-p.se);
        gmin(mid,d);
        gmax(mad,d);
    }
    double scale=mid/mad;// ÌØÕ÷Öµ H 0.02 M 0.23 Y 0.10 
    if (scale<0.08) return 0;
    if (scale<0.165) return 2;
    return 1;
}
int main()
{
    freopen("votes.in","r",stdin);
    int T=read();
    while(T--) {
        MEM(ans)
        cin>>n>>m;
        For(i,n) scanf("%s",s[i]+1);
        MEM(vis)
        For(i,n) For(j,m) if (!vis[i][j] && s[i][j]=='#') {
            ans[bfs(i,j)]++;
        }
        printf("%d %d %d\n",ans[0],ans[1],ans[2]);
    }
    return 0;
}