【PAT】1013. Battle Over Cities

考查点：DFS遍历图，计算连通分量

思路：本质上就是计算连通分量，DFS遇到删除节点时要退出

提交情况：注意这里是1到n下标要对应好

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <  y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 1010
#define oo 0x3f3f3f3f
using namespace std;

int vis[MAXN];
vector<int> Adj[MAXN];
int n,m,k;
int cur;
void DFS(int u)
{
    if(u==cur) return;
    vis[u]=1;
    FOR(i,0,Adj[u].size())
    {
        int v=Adj[u][i];
        if(!vis[v]){
            DFS(v);
        }
    }
}

int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL
    scanf("%d%d%d",&n,&m,&k);
    FOR(i,0,m)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        Adj[u].push_back(v);
        Adj[v].push_back(u);

    }
    FOR(i,0,k)
    {
        scanf("%d",&cur);
        int cnt=0;
        memset(vis,0,sizeof(vis));
        FOR(i,1,n+1)
        {
            if(i!=cur&&vis[i]==0){
                DFS(i);
                cnt++;
            }

        }
        printf("%d\n",cnt-1);
    }
    return 0;
}

还可以用并查集：

提交情况：每个测试用例前都有初始化，fa数组和vis数组，因为这个调了半天。。

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <  y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 1010
#define oo 0x3f3f3f3f
using namespace std;

int vis[MAXN];
vector<int> Adj[MAXN];
int n,m,k;
int cur;
int fa[MAXN];
int findFather(int a)
{
    int x=a;
    while(a!=fa[a]){
        a=fa[a];
    }
    while(x!=fa[x]){
        int z=x;
        x=fa[x];
        fa[z]=a;
    }
    return a;
}
void Union(int a,int b)
{
    int aa=findFather(a),bb=findFather(b);
    if(aa!=bb){
        fa[aa]=bb;
    }
}
void init()
{
    FOR(i,0,MAXN){
        fa[i]=i;
        vis[i]=0;
    }
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL
    scanf("%d%d%d",&n,&m,&k);

    FOR(i,0,m)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        Adj[u].push_back(v);
        Adj[v].push_back(u);

    }
    FOR(b,0,k)
    {
        init();
        scanf("%d",&cur);
        int cnt=0;
        FOR(i,0,n)
        FOR(j,0,Adj[i+1].size())
        {
            int v=Adj[i+1][j];
            if(i+1==cur||v==cur)continue;
            Union(i+1,v);
        }
        FOR(i,0,n){
            if(i+1==cur)continue;
            int ff=findFather(i+1);
            if(vis[ff]==0){
                cnt++;
                vis[ff]=1;
            }
        }
        printf("%d\n",cnt-1);
    }
    return 0;
}