洛谷 P2853 [USACO06DEC]牛的野餐Cow Picnic
题目描述
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)条有向路连接,而且不存在起点和终点相同的有向路.她们进餐的地点必须是所有奶牛都可到达的地方.那么,有多少这样的牧场呢?
输入输出格式
输入格式:
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.
输出格式:
Line 1: The single integer that is the number of pastures that are reachable by all cows via the one-way paths.
输入输出样例
说明
The cows can meet in pastures 3 or 4.
思路:搜索即可,但是不明白深搜为什么会TLE。
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 1010
using namespace std;
int k,n,m,tot,ans;
int vis[MAXN],num[],bns[MAXN];
int to[*],net[*],head[MAXN];
void add(int u,int v){
to[++tot]=v;net[tot]=head[u];head[u]=tot;
}
void bfs(int x){
queue<int>que;
que.push(x);
while(!que.empty()){
int now=que.front();
que.pop();
for(int i=head[now];i;i=net[i])
if(!vis[to[i]]){
bns[to[i]]++;
vis[to[i]]=;
que.push(to[i]);
}
}
}
int main(){
scanf("%d%d%d",&k,&n,&m);
for(int i=;i<=k;i++)
scanf("%d",&num[i]);
for(int i=;i<=m;i++){
int x,y;
scanf("%d%d",&x,&y);
add(x,y);
}
for(int i=;i<=k;i++){
bns[num[i]]++;vis[num[i]]=;
bfs(num[i]);memset(vis,,sizeof(vis));
}
for(int i=;i<=n;i++)
if(bns[i]==k) ans++;
cout<<ans;
}
最新文章
- vagrant学习笔记
- gdb调试方法
- ASP.Net的导出Excel的快速方法,DataTable导出Excel(亲测,非原创)
- DragLayout: QQ5.0侧拉菜单的新特效
- Jquery easyui datagrid 删除多行问题
- Java之--Java语言基础组成—函数
- 【C语言】-一维数组
- EXTJS 4.2 资料 控件之checkboxgroup的用法(静态数据)
- 3.2. Grid Search: Searching for estimator parameters
- Light OJ 1104 第六周F题
- poj 3753 Training little cats_矩阵快速幂
- Linux shell-tail
- Vue常用经典开源项目汇总参考-海量
- JArray数组转换为DataTable
- 常用的一些cmd命令
- Sql语句中IN和exists的区别及应用
- g++编译多个文件
- Java03-Java语法基础(二)运算符
- 等到花儿也谢了的await
- C++ template —— 智能指针(十二)