ZOJ 3811 / 2014 牡丹江赛区网络赛 C. Untrusted Patrol bfs/dfs/并查集

Untrusted Patrol

Time Limit: 3 Seconds Memory Limit: 65536 KB

Edward is a rich man. He owns a large factory for health drink production. As a matter of course, there is a large warehouse in the factory.

To ensure the safety of drinks, Edward hired a security man to patrol the warehouse. The warehouse has N piles of drinks and M passageways connected them (warehouse is not big enough). When the evening comes, the security man will start to patrol the warehouse following a path to check all piles of drinks.

Unfortunately, Edward is a suspicious man, so he sets sensors on K piles of the drinks. When the security man comes to check the drinks, the sensor will record a message. Because of the memory limit, the sensors can only record for the first time of the security man's visit.

After a peaceful evening, Edward gathered all messages ordered by recording time. He wants to know whether is possible that the security man has checked all piles of drinks. Can you help him?

The security man may start to patrol at any piles of drinks. It is guaranteed that the sensors work properly. However, Edward thinks the security man may not works as expected. For example, he may digs through walls, climb over piles, use some black magic to teleport to anywhere and so on.

Input

There are multiple test cases. The first line of input is an integer T indicates the number of test cases. For each test case:

The first line contains three integers N (1 <= N <= 100000), M (1 <= M <= 200000) and K (1 <= K <= N).

The next line contains K distinct integers indicating the indexes of piles (1-based) that have sensors installed. The following M lines, each line contains two integers A_i and B_i (1 <= A_i, B_i <= N) which indicates a bidirectional passageway connects piles A_i and B_i.

Then, there is an integer L (1 <= L <= K) indicating the number of messages gathered from all sensors. The next line contains L distinct integers. These are the indexes of piles where the messages came from (each is among the K integers above), ordered by recording time.

Output

For each test case, output "Yes" if the security man worked normally and has checked all piles of drinks, or "No" if not.

Sample Input

Sample Output

No

Yes

转自：http://blog.csdn.net/napoleon_acm/article/details/39124615

题目： LINK

给定一个无向图，n个点, m条边，k个特殊点（有传感器），只有当第一次到达特殊点的时候才会发出信号，给出发出信号的序列，问是否存在这样的路径使得每个点至少遍历一次，而且特殊点第一次到达的顺序和和题目输入一样。 (1 <= N <= 100000), M (1 <= M <= 200000) 先特判如果询问时输入的L<k，那么直接No，因为l<k肯定有传感器的点没有到达，不满足每个点都遍历一次。先把第一个特殊点入队，遍历所有的可以到达的点(中途不经过其他特殊点)，标记为可以到达。之后判断第二个点是否可以从第一个点到达(是否被标记),如果不可以则No,否则遍历从第二个特殊点出发的可以到达的点(同样中途不经过剩余特殊点). ....... 依次处理完所有点即可. 如果前面的一个特殊点可以到达某个点,那么他后面的特殊点一定也可以到达这些点,因为他可以回到前面的特殊点再走过去.

本题可用多种思路做，但是拍代码前一定要先分析好再开拍，不然，，，

可用方法：bfs、dfs、并查集。

吐血ac。。。

代码：

bfs：

 #include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #include<map>

 #define N 100005

 #define M 15

 #define mod 6

 #define mod2 100000000

 #define ll long long

 #define maxi(a,b) (a)>(b)? (a) : (b)

 #define mini(a,b) (a)<(b)? (a) : (b)

 using namespace std;

 int T;

 int n,m,k,l;

 int vis[N];

 int vis2[N];

 vector<int>bian[N];

 int re[N];

 int a,b;

 vector<int>::iterator it;

 void ini()

 {

     int i;

     memset(vis,,sizeof(vis));

     memset(vis2,,sizeof(vis2));

     for(i=;i<=;i++){

         bian[i].clear();

     }

     scanf("%d%d%d",&n,&m,&k);

     for(i=;i<=k;i++){

         scanf("%d",&re[i]);

     }

     while(m--){

         scanf("%d%d",&a,&b);

         bian[a].push_back(b);

         bian[b].push_back(a);

     }

     scanf("%d",&l);

     for(i=;i<=l;i++){

         scanf("%d",&re[i]);

         vis2[ re[i] ]=;

     }

 }

 int solve()

 {

     if(l!=k){

         return ;

     }

     queue<int>q;

     int r;

     vis[ re[] ]=;

     for(int i=;i<=l;i++){

        // printf(" i=%d re=%d vis=%d\n",i,re[i],vis[ re[i] ]);

         if(vis[ re[i] ]==) return ;

        // vis2[ re[i] ]=0;

         q.push(re[i]);

         while( q.size()> )

         {

             r=q.front();

             //printf("  r=%d\n",r);

             q.pop();

            // vis[r]=1;

             for(it=bian[r].begin();it!=bian[r].end();it++){

              //   printf("   it=%d\n",*it);

                 if(vis[*it]==) continue;

                 vis[ *it ]=;

                 if( vis2[ *it ]== ){

                     q.push( (*it) );

                 }

             }

 /*

             for(int j=0;j<(int)bian[r].size();j++){

                 int y=bian[r][j];

                 if(vis[y]==1) continue;

                 vis[y]=1;

                 if(vis2[y]==0){

                     q.push(y);                }

             }*/

         }

     }

     for(int i=;i<=n;i++){

         if(vis[i]==) return ;

     }

     return ;

 }

 int main()

 {

     //freopen("data.in","r",stdin);

     scanf("%d",&T);

     for(int cnt=;cnt<=T;cnt++)

    // while(T--)

     //while(scanf("%I64d%I64d%I64d",&a,&b,&c)!=EOF)

     {

         ini();

         if(solve()==){

             printf("No\n");

         }

         else{

             printf("Yes\n");

         }

     }

     return ;

 }

dfs版本：

 #include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #include<map>

 #define N 100005

 #define M 15

 #define mod 6

 #define mod2 100000000

 #define ll long long

 #define maxi(a,b) (a)>(b)? (a) : (b)

 #define mini(a,b) (a)<(b)? (a) : (b)

 using namespace std;

 int T;

 int n,m,k,l;

 int vis[N];

 int vis2[N];

 vector<int>bian[N];

 int re[N];

 int a,b;

 void ini()

 {

     int i;

     memset(vis,,sizeof(vis));

     memset(vis2,,sizeof(vis2));

     for(i=;i<=;i++){

         bian[i].clear();

     }

     scanf("%d%d%d",&n,&m,&k);

     for(i=;i<=k;i++){

         scanf("%d",&re[i]);

     }

     while(m--){

         scanf("%d%d",&a,&b);

         bian[a].push_back(b);

         bian[b].push_back(a);

     }

     scanf("%d",&l);

     for(i=;i<=l;i++){

         scanf("%d",&re[i]);

         vis2[ re[i] ]=;

     }

 }

 void dfs(int s)

 {

     vector<int>::iterator it;

     for(it=bian[s].begin();it!=bian[s].end();it++){

         if(vis[*it]==) continue;

         vis[*it]=;

         if(vis2[*it]==){

             dfs(*it);

         }

     }

 }

 int solve()

 {

     if(l!=k){

         return ;

     }

     vis[ re[] ]=;

     for(int i=;i<=l;i++){

        // printf(" i=%d re=%d vis=%d\n",i,re[i],vis[ re[i] ]);

         if(vis[ re[i] ]==) return ;

         dfs(re[i]);

     }

     for(int i=;i<=n;i++){

         if(vis[i]==) return ;

     }

     return ;

 }

 int main()

 {

     //freopen("data.in","r",stdin);

     scanf("%d",&T);

     for(int cnt=;cnt<=T;cnt++)

    // while(T--)

     //while(scanf("%I64d%I64d%I64d",&a,&b,&c)!=EOF)

     {

         ini();

         if(solve()==){

             printf("No\n");

         }

         else{

             printf("Yes\n");

         }

     }

     return ;

 }

并查集版：http://blog.csdn.net/qq574857122/article/details/39121391

转自：

思路：

先把无触发器的点放到图里。

然后根据触发器的信号顺序把点依次加入图中，加入时只添加（与无触发器点相连的边）

然后判断这个点能否与之前的图连通。bfs+并查集判断。

==其实并查集就够了，写的时候有脑洞，bfs就冒出来了

 #include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #include<map>

 #define N 100005

 #define M 15

 #define mod 6

 #define mod2 100000000

 #define ll long long

 #define maxi(a,b) (a)>(b)? (a) : (b)

 #define mini(a,b) (a)<(b)? (a) : (b)

 using namespace std;

 int T;

 int n,m,k,l;

 int f[N];

 int rank[N];

 int vis2[N];

 vector<int>bian[N];

 int re[N];

 vector<int>::iterator it;

 int find(int v)

 {

     //printf("   v=%d f=%d\n",v,f[v]);

     return f[v]=f[v]==v ? v : find(f[v]);

 }

 void merge(int x,int y)

 {

     int a=find(x),b=find(y);

     if(a==b) return;

     if(rank[a]<rank[b]){

         f[a]=b;

     }

     else{

         f[b]=a;

         if(rank[b]==rank[a]){

             ++rank[a];

         }

     }

 }

 void ini()

 {

     int i;

     int a,b;

     //memset(vis,0,sizeof(vis));

     memset(rank,,sizeof(rank));

     memset(vis2,,sizeof(vis2));

     for(i=;i<=;i++){

         bian[i].clear();

     }

     scanf("%d%d%d",&n,&m,&k);

     for(i=;i<=n;i++){

         f[i]=i;

        // printf("   i=%d f=%d\n",i,f[i]);

     }

     for(i=;i<=k;i++){

         scanf("%d",&re[i]);

     }

     while(m--){

         scanf("%d%d",&a,&b);

         bian[a].push_back(b);

         bian[b].push_back(a);

     }

     scanf("%d",&l);

     for(i=;i<=l;i++){

         scanf("%d",&re[i]);

         vis2[ re[i] ]=;

     }

 }

 int solve()

 {

     int i,x,y;

     if(l!=k){

         return ;

     }

     // for(i=1;i<=n;i++){

     //    printf("  i=%d f=%d\n",i,f[i]);

    // }

    // vis[ re[1] ]=1;

     for(i=;i<=n;i++){

         if(vis2[i]==) continue;

         for(it=bian[i].begin();it!=bian[i].end();it++){

             if(vis2[*it]==) continue;

             merge(i,*it);

         }

     }

     i=;

     for(it=bian[ re[i] ].begin();it!=bian[  re[i] ].end();it++){

         if(vis2[*it]==) continue;

         merge(re[i],*it);

     }

     vis2[ re[] ]=;

     for(i=;i<=l;i++){

        // printf(" i=%d re=%d vis=%d\n",i,re[i],vis[ re[i] ]);

         for(it=bian[ re[i] ].begin();it!=bian[  re[i] ].end();it++){

             if(vis2[*it]==) continue;

             merge(re[i],*it);

         }

         x=find(re[i-]);

         y=find(re[i]);

         //printf("  re[i-1]=%d re[i]=%d x=%d y=%d\n",re[i-1],re[i],x,y);

         if(x!=y) return ;

         vis2[ re[i] ]=;

     }

     x=find();

     for(i=;i<=n;i++){

         if(x!=find(i)) return ;

     }

     return ;

 }

 int main()

 {

     //freopen("data.in","r",stdin);

     scanf("%d",&T);

     for(int cnt=;cnt<=T;cnt++)

    // while(T--)

     //while(scanf("%I64d%I64d%I64d",&a,&b,&c)!=EOF)

     {

         ini();

         if(solve()==){

             printf("No\n");

         }

         else{

             printf("Yes\n");

         }

     }

     return ;

 }