L2-013. 红色警报

L2-013. 红色警报

图的连通性， 深搜标记一下。。。。

代码：

#include<bits/stdc++.h>

using namespace std;
#define ll long long

const int maxn = 507;


int v[maxn][maxn], n, m, k = 0;
bool vis[maxn];

void dfs(int x) {
    if(!vis[x]) {
        vis[x] = true;
        for(int i = 0; i < n; i++) {
            if(!vis[i] && v[x][i]) {
                dfs(i);
            }
        }
    } else return;
}


int main()
{
    scanf("%d%d", &n, &m);
    memset(v, 0, sizeof(v));
    memset(vis, 0, sizeof(vis));
    for(int i = 0; i < m; i++) {
        int a, b;
        scanf("%d%d", &a, &b);
        v[a][b] = v[b][a] = 1;
    }
    for(int i = 0; i < n; i++) {
        if(!vis[i]) {
            k++;
            dfs(i);
        }
    }
    int cas;
    scanf("%d", &cas);
    for(int i = 0; i < cas; i++) {
        memset(vis, 0, sizeof(vis));
        int c;
        scanf("%d", &c);
        for(int i = 0; i < n; i++) {
            v[i][c] = v[c][i] = 0;
        }
        int temp = 0;
        for(int i = 0; i < n; i++) {
            if(!vis[i]) {
                temp++;
                dfs(i);
            }
        }
        if(temp > k + 1) cout<<"Red Alert: City "<<c<<" is lost!"<<endl;
        else cout<<"City "<<c<<" is lost."<<endl;
        k = temp;
    }
    if(cas == n) cout << "Game Over." << endl;
    return 0;
}