[JSOI2008] Star Wars Starwar

1015: [JSOI2008] Star Wars Starwar time limit:3 Sec Memory limit:162 MB submit:6516 solved:3024 [submit][s Tatus][discuss] Description

Long ago, in a distant galaxy, a dark empire was leaning against its super-weapons rulers throughout the galaxy. One day, with an occasional chance, a rebel army destroyed the empire's super weapons and attacked almost all the planets in the galaxy. These planets are connected to each other directly or indirectly through special etheric tunnels. But it was not long, and soon the Empire re-created his super weapon. With the power of this super weapon, the Empire began to plan to destroy the rebel-occupied planet. As the planet continues to be destroyed, communication channels between the two planets are beginning to be unreliable. Now, the rebel leader gives you a mission: to give the connection of the etheric tunnels between the original two planets and the order of the planets in the Empire's attack, to find out the number of connected fast planets that the rebels occupy after each strike as quickly as possible. (If two planets can be connected directly or indirectly through existing etheric channels, the two planets are in the same connected block).

Input

The first line of the input file contains two integers, n (1 < = n < = 2M) and m (1 < = m < = 200,000), respectively, representing the number of planets and the number of etheric tunnels. The planet is numbered with an integer of 0 ~ N-1. The next M-line, each line consists of two integers x, y, where (0 < = x <> y means there is an "ether" tunnel between Planet X and Planet Y, which can be communicated directly. The next behavior is an integer k, which represents the number of planets that will be hit. The next K-line, each line has an integer, in order to list the attack target of the imperial army. The k numbers are different and are within the range of 0 to n-1.

Output

The first line is the number of connected blocks at the beginning of the planet. The next K-line, an integer per line, indicates the number of connected blocks of the existing planet after the strike.

Sample Input8 13
0 1
1 6
6 5
5 0
0 6
1 2
2 3
3 4
4 5
7 1
9 |
7 6
3 6
5
1
6
3
5
7Sample Output1
1
1
2
3
3time to turn back, with and check the number of maintenance Unicom block can be

#include <cstdio>Const intMAXN =400000+Ten, MAXM =200000+Ten;intN, M, K;structedge{intto, next; Edge () {} Edge (int_t,int_n): to (_t), Next (_n) {}}E[MAXM<<1];intFIR[MAXN] = {0}, cnt =0; inlinevoidInsintUintv) {e[++CNT] = Edge (V, Fir[u]); Fir[u] =CNT; e[++CNT] = Edge (U, Fir[v]); FIR[V] =CNT;}intFUCK[MAXN], FFF[MAXN];BOOLSTATE[MAXN] = {false};intFA[MAXN];intFind (intx) {    returnx = = Fa[x]? X:FA[X] =Find (fa[x]);}intMain () {scanf ("%d%d", &n, &m);  for(intU, V, i =1; I <= m; i++) {scanf ("%d%d", &u, &v);    INS (U, v); }    intK; scanf ("%d", &k);  for(inti =1; I <= K; i++) {scanf ("%d", Fuck +i); State[fuck[i]]=true; }     for(inti =0; I < n; i++) Fa[i] =i;  for(intU =0; U < n; u++){        if(State[u])Continue;  for(intV, i = fir[u]; I i =E[i].next) {v=e[i].to; if(State[v])Continue; Fa[find (u)]=Find (v); }    }    intAns =0;  for(inti =0; I < n; i++)        if(!state[i] && Find (i) = = i) ans++;  for(inti = k; I i--) {Fff[i]=ans; State[fuck[i]]=false; Ans++;  for(intV, j = fir[fuck[i]]; J j =E[j].next) {v=e[j].to; if(State[v])Continue; if(Find (v)! =Find (Fuck[i])) {ans--; Fa[find (v)]=Find (Fuck[i]); }}} printf ("%d\n", ans);  for(inti =1; I <= K; i++) printf ("%d\n", Fff[i]); return 0;}

[JSOI2008] Star Wars Starwar