ZOJ Problem Set - 3811
#include
#include
#include
#include
#include
#include
#include
using namespace std; const int maxv = 110000; vector
edge[maxv]; int rec[maxv]; int a[maxv]; bool no[maxv]; int bfs( int n , int light ) { int front = 0 , rear = 1 ; int count = 0 ; int count_ = 0 ; int stack[maxv] = {0} ; stack[front] = a[count] ; //printf("a[count] %d \n" ,a[count]); count_++ ; rec[a[count]] = 1 ; count++ ; while( front < rear ) { int k = stack[front] ; for( int i = 0 ; i < edge[k].size(); i++ ) { int m = edge[k][i] ; if( rec[m] == 1 ) continue; if( !no[m] ) { stack[rear++] = m ; rec[m] = 1 ; count_++; } else if( no[m] ) { if( m == a[count] ) { stack[rear++] = m ; rec[m] = 1 ; count++;count_++; while( rec[a[count]] ==2 ) { rec[ a[count] ] = 1 ; stack[rear++] = a[count] ; count++;count_++; } } else { rec[ m ] = 2 ; } } } front ++ ; /× for( int i = 1 ; i <= n ; i++ ) { printf("rec[%d] = %d\n" , i , rec[i]); } printf("count = %d count_ = %d\n",count , count_);×/ } return( count == light && count_ == n ); } int main() { int T; //freopen("in.txt","r",stdin); //freopen("out.txt","w+",stdout); scanf("%d", &T); while (T--) { int n,m,k; scanf("%d%d%d", &n, &m, &k); memset(no, 0, sizeof(no)); memset( rec , 0 , sizeof(rec) ) ; for (int i = 0; i < k; i++) {/*to record the scanners*/ int pp; scanf("%d", &pp); no[pp] = true; } for (int i = 1 ; i <= n; i ++) {/*clear it*/ edge[i].clear(); } for (int i = 0; i < m; i++) { int u,v; scanf("%d%d", &u, &v); edge[u].push_back(v); edge[v].push_back(u); } int L; scanf("%d", &L); for (int i = 0 ; i < L; i++) scanf("%d",&a[i]); if (L < k || m < n-1) printf("No\n");/*special cases*/ else { int flag = bfs( n , L ); printf("%s\n", flag ? "Yes":"No"); } } return 0; }