强盗团伙C++ 代码

#include<iostream>
using namespace std;
const int N = 1e3+10;
int n,m;
int p[N];
int e_num[N];
int enemy[N][N];
int flag[N];

int find(int x)
{
    if(p[x]!=x)p[x] = find(p[x]);
    return p[x];
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)p[i] = i;
    while(m--)
    {
        char op;
        int a,b;
        cin>>op>>a>>b;
        if(op == 'E')
        {
            enemy[a][e_num[a]++] = b;
            enemy[b][e_num[b]++] = a;

            for(int i=0;i<e_num[a];i++)
            {
                int t = enemy[a][i];
                if(t!=b)
                {
                    p[find(t)] = find(b);
                }
            }
            for(int i=0;i<e_num[b];i++)
            {
                int t = enemy[b][i];
                if(t!=a)
                {
                    p[find(t)] = find(a);
                }
            }
        }
        else
        {
            p[find(a)] = find(b);
        }
    }

    for(int i=1;i<=n;i++)
    {
        flag[find(i)] = 1;
    }
    int cnt = 0;
    for(int i=1;i<=n;i++)
    {
        cnt+=flag[i];
    }
    cout<<cnt;
}