L2-013 红色警报

传送门

#include <bits/stdc++.h>
using namespace std;

const int maxn = 510;
int n,m,k,v[maxn],fa[maxn];
struct node{
	int x,y;
}e[10 * maxn];

void init(){
	for(int i = 0; i < maxn; i++)
	fa[i] = i;
}

int find(int x){
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}

void merge(int x,int y){
	fa[find(x)] = find(y);
}

int main(){
	ios::sync_with_stdio(0);
    cin >> n >> m;
	init();	
	for(int i = 0; i < m; i++){
		cin >> e[i].x >> e[i].y;
		merge(e[i].x,e[i].y);
	}
	
	int cnt = 0;
	for(int i = 0; i < n; i++) {
		if(fa[i]==i) cnt++;
	}
	
	cin >> k;
	
	for(int z = 0; z < k; z++){
		int u;cin >> u;
		v[u] = 1;
		init();
		for(int i = 0; i < m; i++){
			if(!v[e[i].x] && !v[e[i].y]){
				merge(e[i].x,e[i].y);
			}
		}
		int c = 0;
		for(int i = 0; i < n; i++){
			if(fa[i] == i && !v[i]) c++;
		}
		if(cnt == c || cnt == c + 1)
		cout << "City " << u <<" is lost." << endl;
	    else
	    cout << "Red Alert: City "<< u << " is lost!" << endl;
	    cnt = c;
	}
	if(k==n) cout << "Game Over."<<endl;
	return 0;
}