并查集应该是正解 我把占领的城市变成已经访问,求连通块的个数后-1 用了DFS,没想到也过了…
#include<bits/stdc++.h>
using namespace std;
const int INF = 10000;
const int MAXN = 1010;
int G[MAXN][MAXN];
bool vis[MAXN];
int n,m,k;
void DFS(int s)
{
for(int i = 1;i<=n;i++)
{
if(vis[i] == false && G[s][i] == 1)
{
vis[i] = true;
DFS(i);
}
}
}
int main(void)
{
freopen("pat0314/in.txt","r",stdin);
cin>>n>>m>>k;
fill(G[0],G[0] + MAXN * MAXN,INF);
for(int i = 0;i<m;i++)
{
int l,r;
cin>>l>>r;
G[l][r] = 1;
G[r][l] = 1;
}
for(int i = 0;i<k;i++)
{
int s;
cin>>s;
fill(vis,vis + MAXN,false);
vis[s] = true;
int num = 0;
for(int j = 1;j<=n;j++)
{
if(vis[j] == false)
{
num++;
DFS(j);
}
}
printf("%d\n",num - 1);
}
return 0;
}