//2019-04 朋友圈/省份数量
//并查集应用,好丑的代码os
#include <iostream>
using namespace std;
const int N = 10010;
int p[N];
int g[N][N];
int find(int x)
{
if (x != p[x])
p[x] = find(p[x]);
return p[x];
}
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
p[i] = i;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
cin >> g[i][j];
}
}
int cnt = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i; j++)
{
if (g[i][j] == 1)
p[j] = find(i);
if (find(i) != find(j))
cnt++;
}
cout << cnt << endl;
return 0;
}
hdu笔试2019-04朋友圈
最新推荐文章于 2024-07-25 21:43:46 发布