BZOJ

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
#define rep(i,a,b) for(int i = a;i <= b;++ i)
#define per(i,a,b) for(int i = a;i >= b;-- i)
#define mem(a,b) memset((a),(b),sizeof((a)))
#define FIN freopen("in.txt","r",stdin)
#define FOUT freopen("out.txt","w",stdout)
#define IO ios_base::sync_with_stdio(0),cin.tie(0)
#define mid ((l+r)>>1)
#define ls (id<<1)
#define rs ((id<<1)|1)
#define N 400010
#define INF 0x3f3f3f3f
#define INFF ((1LL<<62)-1)
using namespace std;
typedef long long LL;
typedef pair<int, int> PIR;
const double eps = 1e-8;
 
int n, m, u, v, t, k[N], f[N], ans[N];
vector <int> G[N];
bool vis[N];
int getfa(int x){
    return f[x] == x ? x : f[x] = getfa(f[x]);
}
int main()
{
    //FIN;
    scanf("%d %d", &n, &m);
    rep(i, 1, m){ 
        scanf("%d %d", &u, &v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    scanf("%d", &t);
    rep(i, 1, t)    { scanf("%d", &k[i]); vis[k[i]] = true; }
    rep(i, 0, n)    f[i] = i;
 
    int res = n-t;
    rep(i, 0, n-1){
        if(vis[i])  continue;
        int x = getfa(i);
        rep(j, 0, (int)G[i].size()-1){
            if(vis[G[i][j]])    continue;
            int y = getfa(G[i][j]);
            if(x != y)  { f[y] = x; res--; }
        }
    }
    /*int res = 0;
    rep(i, 0, n-1)  { if(!vis[i] && getfa(i) == i)  res++; }*/
    per(i, t, 0){
        ans[i] = res++;
        vis[k[i]] = false;
        int x = getfa(k[i]);
        rep(j, 0, (int)G[k[i]].size()-1){
            if(vis[G[k[i]][j]]) continue;
            int y = getfa(G[k[i]][j]);
            if(x != y){ 
                f[y] = x;
                res--;
            }
        }
    }
    rep(i, 0, t)    printf("%d
", ans[i]);
    return 0;
}