【USACO5-1-2】夜空繁星Starry Night 模拟

题目

判断是否相似的方法是将每两点的距离加起来

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
using namespace std;
char res[505][505];char c[505];char ch;
struct node{int x,y;}p[505][505];
int a[505][505];
double dis[505];
int n,m,cnt1,cnt2;
bool judge(int x,int y){return (x>0&&x<=n&&y>0&&y<=m);}
void dfs(int x,int y){
    for (int d1=-1;d1<=1;d1++)
        for (int d2=-1;d2<=1;d2++){
            int i=x+d1,j=y+d2;
            if (judge(i,j)&&a[i][j]==1&&res[i][j]=='0'){
                res[i][j]=ch;p[cnt1][++cnt2].x=i;p[cnt1][cnt2].y=j;
                dfs(i,j);
            }
        }
}
double solve_dis(){
    double ret=0;
    for (int i=1;i<=cnt2;i++)
        for (int j=1;j<=cnt2;j++){
            int x1=p[cnt1][i].x,y1=p[cnt1][i].y,x2=p[cnt1][j].x,y2=p[cnt1][j].y;
            ret+=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
        }
    return ret;
}
bool similar(int p,int q){return (fabs(dis[p]-dis[q])<=0.00001);}
int main(){
    scanf("%d%d",&m,&n);
    for (int i=1;i<=n;i++){
        for(;ch!='0'&&ch!='1';ch=getchar());
        for (int j=1;j<=m;j++) {a[i][j]=ch-'0';ch=getchar();}
    }
    ch='a'-1;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++) res[i][j]='0';
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            if(a[i][j]==1&&res[i][j]=='0'){
                p[++cnt1][cnt2=1].x=i;p[cnt1][cnt2].y=j;
                ch++;c[cnt1]=ch;
                res[i][j]=ch;dfs(i,j);dis[cnt1]=solve_dis();
                for (int k=1;k<cnt1;k++)
                    if (similar(k,cnt1)){
                        ch--;c[cnt1]=c[k];
                        for (int ii=1;ii<=cnt2;ii++) res[p[cnt1][ii].x][p[cnt1][ii].y]=c[k];
                        break;
                    }
            }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++) printf("%c",res[i][j]);
        printf("\n");
    }
    return 0;
}