第九个点为什么RE

这数组都开这么多了怎么还RE

#include <cstdio>
#include <queue>
#include <queue>
#include <stack>
#define M 200110
using namespace std;
int n,m,fa[401010];
bool in_st[401010];
vector<int>e[201010];
stack<int>st;
stack<int>ans;
int getFa(int x){
    if (x==fa[x]) return x;
    return fa[x] = getFa(fa[x]);
}
int main(){
    int i,j,k,x,y;
    scanf("%d%d",&n,&m);
    for (i=0; i<m; i++){
        scanf("%d%d",&x,&y);
        e[x].push_back(y);
        e[y].push_back(x);
    } 
    for (i=0; i<n; i++) in_st[i]=false,fa[i]=i;
    scanf("%d",&k);
    for (i=0; i<k; i++){
        scanf("%d",&x);
        in_st[x] = true;
        st.push(x);
    }
    int cnt=n-k;
    for (i=0; i<n; i++){
        if (in_st[i]) continue;
        x = i;
        for (j=0; j<e[x].size(); j++){
            y = e[x][j];
            if (in_st[y]) continue;
            if (getFa(x)!=getFa(y)){
                fa[fa[x]] = fa[y];
                cnt--;
            }
        }
    }
    while(!st.empty()){
        ans.push(cnt);
        cnt++;
        x = st.top();st.pop();
        in_st[x] = false;
        for (j=0; j<e[x].size(); j++){
            y = e[x][j];
            if (in_st[y]) continue;
            if (getFa(x)!=getFa(y)){
                fa[fa[x]] = fa[y];
                cnt--;
            }
        }
    }
    ans.push(cnt);
    while(!ans.empty()){
        printf("%d\n",ans.top());
        ans.pop();
    }
    return 0;
}