poj 1021(求連通圖分量,求子圖hash,dfs)
阿新 • • 發佈:2021-08-03
#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; const int maxn = 105; int a[maxn][maxn][2]; int n,data[maxn][maxn],idx[maxn][maxn]; struct Node{ int k; int a[maxn][2]; long long sum; }nn[2][maxn]; int cmp(Node n1,Node n2){if(n1.k>n2.k)return true; else if(n1.k<n2.k)return false; else return n1.sum>n2.sum; } void dfs(int i,int j,int id,Node*nn){ if(i<0||i>=n||j<0||j>=n)return; if(idx[i][j]!=0||data[i][j]==0)return; nn[id].a[nn[id].k][0] = i; nn[id].a[nn[id].k][1] = j; nn[id].k++; idx[i][j] = id; dfs(i+1,j,id,nn); dfs(i-1,j,id,nn); dfs(i,j+1,id,nn); dfs(i,j-1,id,nn); } int main(){ int t,w,h,i,j,r,p,q,count[2],kase; scanf("%d",&t); while(t--){ scanf("%d%d%d",&w,&h,&n); for(kase=0;kase<2;kase++){ memset(data,0,sizeof(data)); memset(idx,0,sizeof(idx)); for(i=0;i<n;i++){ scanf("%d%d",&p,&q); data[p][q] = 1; } for(i=0;i<n;i++){ nn[kase][i].k = 0; } count[kase] = 0; for(i=0;i<w;i++) for(j=0;j<h;j++) if(idx[i][j]==0&&data[i][j]==1) dfs(i,j,++count[kase],nn[kase]); for(i=1;i<=count[kase];i++){ nn[kase][i].sum = 0; for(j=1;j<nn[kase][i].k;j++) for(r=0;r<j;r++) nn[kase][i].sum += (nn[kase][i].a[j][0]-nn[kase][i].a[r][0])*(nn[kase][i].a[j][0]-nn[kase][i].a[r][0])+ (nn[kase][i].a[j][1]-nn[kase][i].a[r][1])*(nn[kase][i].a[j][1]-nn[kase][i].a[r][1]); } sort(nn[kase]+1,nn[kase]+count[kase]+1,cmp); } bool flag = true; if(count[0]!=count[1])flag = false; else{ for(i=1;i<=count[0];i++){ if(nn[0][i].k!=nn[1][i].k||nn[0][i].sum!=nn[1][i].sum){ flag = false; break; } } } if(flag)printf("YES\n"); else printf("NO\n"); } return 0; }