pat:1013. Battle over Cities AC

#include<stdio.h>#include<string.h>#include<vector>Usingnamespace Std;Constint max=1010;int n,m,k;Number of cities, highways, number of queriesint DELETE;The point to delete vector<Int> Adj[max];adjacency tableBOOL Vis[max];void DFS (int s) {if (delete==s)ReturnIndicates that the point is not up to vis[s]=TrueForint i=0; I<adj[s].size (); ++i)if (vis[adj[s][i]]==False) DFS (Adj[s][i]);}int main () {scanf ("%d%d%d", &n,&m,&k);Forint i=0; I<m; ++i) {int u,v; scanf"%d%d", &u,&v); Adj[u].push_back (v); Adj[v].push_back (U); }Forint q=0; q<k; ++q) {int cnt=< Span class= "integer" >0; //number of disconnected graphs scanf ( "%d< Span class= "delimiter", &delete); memset (Vis,false,sizeof (VIS)); for (int i=1; i<=n; ++i) {if (vis[i]==false && i!=delete) {DFS (i); ++cnt;}} printf ( "%d\n1); } return 0;}          

pat:1013. Battle over Cities (+) AC