zoukankan      html  css  js  c++  java
  • Bzoj 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐 深搜,bitset

    1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐

    Time Limit: 5 Sec  Memory Limit: 64 MB
    Submit: 554  Solved: 346
    [Submit][Status][Discuss]

    Description

    The cows are having a picnic! Each of Farmer John's K (1 <= K <= 100) cows is grazing in one of N (1 <= N <= 1,000) pastures, conveniently numbered 1...N. The pastures are connected by M (1 <= M <= 10,000) one-way paths (no path connects a pasture to itself). The cows want to gather in the same pasture for their picnic, but (because of the one-way paths) some cows may only be able to get to some pastures. Help the cows out by figuring out how many pastures are reachable by all cows, and hence are possible picnic locations. 

      K(1≤K≤100)只奶牛分散在N(1≤N≤1000)个牧场.现在她们要集中起来进餐.牧场之间有M(1≤M≤10000)条有向路连接,而且不存在起点和终点相同的有向路.她们进餐的地点必须是所有奶牛都可到达的地方.那么,有多少这样的牧场呢?

    Input

    * Line 1: Three space-separated integers, respectively: K, N, and M * Lines 2..K+1: Line i+1 contains a single integer (1..N) which is the number of the pasture in which cow i is grazing. * Lines K+2..M+K+1: Each line contains two space-separated integers, respectively A and B (both 1..N and A != B), representing a one-way path from pasture A to pasture B. 

     第1行输入K,N,M.接下来K行,每行一个整数表示一只奶牛所在的牧场编号.接下来M行,每行两个整数,表示一条有向路的起点和终点

    Output

    * Line 1: The single integer that is the number of pastures that are reachable by all cows via the one-way paths. 

        所有奶牛都可到达的牧场个数

    Sample Input

    2 4 4
    2
    3
    1 2
    1 4
    2 3
    3 4


    INPUT DETAILS:

    4<--3
    ^ ^
    | |
    | |
    1-->2

    The pastures are laid out as shown above, with cows in pastures 2 and 3.

    Sample Output

    2

    牧场3,4是这样的牧场.

    HINT

     

    Source

    Silver

    题解:

    深搜

    从每个奶牛开始遍历即可。。。我还用了个bitset来加速。。。但数据范围小。。。没有用。。。233

    注意有环!!!

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define MAXN 1010
     4 struct node
     5 {
     6     int begin,end,next;
     7 }edge[10010];
     8 int cnt,Head[MAXN],vis[MAXN],a[110];
     9 bitset<MAXN>vv;
    10 void addedge(int bb,int ee)
    11 {
    12     edge[++cnt].begin=bb;edge[cnt].end=ee;edge[cnt].next=Head[bb];Head[bb]=cnt;
    13 }
    14 int read()
    15 {
    16     int s=0,fh=1;char ch=getchar();
    17     while(ch<'0'||ch>'9'){if(ch=='-')fh=-1;ch=getchar();}
    18     while(ch>='0'&&ch<='9'){s=s*10+(ch-'0');ch=getchar();}
    19     return s*fh;
    20 }
    21 void dfs(int u)
    22 {
    23     int i,v;
    24     vis[u]++;vv[u]=1;
    25     for(i=Head[u];i!=-1;i=edge[i].next)if(vv[edge[i].end]==0)dfs(edge[i].end);
    26 }
    27 int main()
    28 {
    29     int k,n,m,i,bb,ee,ans;
    30     k=read();n=read();m=read();
    31     for(i=1;i<=k;i++)a[i]=read();
    32     memset(Head,-1,sizeof(Head));cnt=1;
    33     for(i=1;i<=m;i++)
    34     {
    35         bb=read();ee=read();
    36         addedge(bb,ee);
    37     }
    38     memset(vis,0,sizeof(vis));
    39     for(i=1;i<=k;i++){vv.reset();dfs(a[i]);}
    40     ans=0;
    41     for(i=1;i<=n;i++)if(vis[i]==k)ans++;
    42     printf("%d",ans);
    43     return 0;
    44 }
  • 相关阅读:
    刷题的 vscodeleetcode
    一个简单的小程序演示Unity的三种依赖注入方式
    WCF服务端运行时架构体系详解[上篇]
    通过WCF扩展实现消息压缩
    通过“四大行为”对WCF的扩展[原理篇]
    [WCF权限控制]利用WCF自定义授权模式提供当前Principal[原理篇]
    [WCF权限控制]ASP.NET Roles授权[下篇]
    [WCF权限控制]通过扩展自行实现服务授权[提供源码下载]
    通过自定义ServiceHost实现对WCF的扩展[实例篇]
    [WCF权限控制]WCF自定义授权体系详解[实例篇]
  • 原文地址:https://www.cnblogs.com/Var123/p/5326938.html
Copyright © 2011-2022 走看看