L2-013 红色警报

每摧毁一座城市就重新建立并查集！ 

 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int u[maxn],v[maxn];
int p[maxn];
int Find(int x)
{
    return x==p[x]?x:p[x]=Find(p[x]);
}
void join(int x,int y)
{
    int jx=Find(x);
    int jy=Find(y);
    p[jx]=jy;
}
bool vis[maxn];
int main()
{
    //freopen("input.txt", "r", stdin);
    //FASTIO;
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) p[i]=i;
    for(int i=0;i<m;i++)
    {
        cin>>u[i]>>v[i];
        join(u[i],v[i]);
    }
    int num=0;
    for(int i=0;i<n;i++)
    {
        if(p[i]==i) num++;
    }
    int k;
    cin>>k;
    while(k--)
    {
        int x;
        cin>>x;
        for(int i=0;i<n;i++) p[i]=i;
        vis[x]=1;
        for(int i=0;i<m;i++)
        {
            if(!vis[u[i]]&&!vis[v[i]])
            {
                join(u[i],v[i]);
            }
        }
        int t=0;
        for(int i=0;i<n;i++)
        {
            if(p[i]==i&&!vis[i]) t++;
        }
        if(t>num)
        {
            printf("Red Alert: City %d is lost!\n",x);
        }
        else
        {
            printf("City %d is lost.\n",x);
        }
        num=t;
    }
    num=0;
    for(int i=0;i<n;i++)
    {
        if(vis[i]) num++;
    }
    if(num==n)
    {
        cout<<"Game Over.\n";
    }
    return 0;
}