BZOJ 1648 USACO 2006 Dec Cow Picnic 奶牛野餐 搜索
来源:互联网 发布:java list转map 编辑:程序博客网 时间:2024/05/08 10:22
24ms。。不过排在第1页就好233。
爆搜一下各点并记录访问次数,被访问k次即属于答案。
#include <cstdio>#include <cstring>#define FOR(i,j,k) for(i=j;i<=k;i++)const int K = 101, N = 1001, M = 10001;int a[K], s[N], d[N], h[N], p[M], v[M];void dfs(int x) { d[x] = 1; s[x] ++; for (int i = h[x]; i; i = p[i]) if (!d[v[i]]) dfs(v[i]);}int main() { int k, n, m, x, y, ans = 0, i; scanf("%d%d%d", &k, &n, &m); FOR(i,1,k) scanf("%d", &a[i]); FOR(i,1,m) scanf("%d%d", &x, &y), p[i] = h[x], v[i] = y, h[x] = i; FOR(i,1,k) memset(d, 0, sizeof d), dfs(a[i]); FOR(i,1,n) if (s[i] == k) ans++; printf("%d", ans); return 0;}
1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 538 Solved: 334
[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.
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
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
牧场3,4是这样的牧场.
- BZOJ 1648 USACO 2006 Dec Cow Picnic 奶牛野餐 搜索
- BZOJ 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
- |BZOJ 1648|DFS|[Usaco2006 Dec]Cow Picnic 奶牛野餐
- BZOJ 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐 题解
- 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
- bzoj1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐 (搜索+剪枝)
- bzoj 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐(暴力DFS)
- bzoj1648 [Usaco2006 Dec]Cow Picnic 奶牛野餐
- bzoj1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
- bzoj1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
- bzoj1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
- BZOJ 1690 【USACO 2007 Dec奶牛观光】
- 洛谷 P2853 [USACO06DEC]牛的野餐Cow Picnic
- [洛谷OJ] [USACO06DEC]牛的野餐Cow Picnic
- POJ 3256 Cow Picnic 搜索
- POJ3256 Cow Picnic DFS搜索
- BZOJ 3891 USACO 2014 Dec Piggy Back 搜索 最短路
- BZOJ 2097 USACO 2010 Dec Gold Exercise 奶牛健美操 二分答案 树形DP 贪心
- YTU 2690: 用双重循环实现小九九
- 1.以普通表格型单表为模板定制模块:短信分类维护
- eclipse配置安卓环境(mac系统)
- 程序只运行一个实例,并激活已运行的程序
- YTU 2697: 血型统计
- BZOJ 1648 USACO 2006 Dec Cow Picnic 奶牛野餐 搜索
- POJ 3233 矩阵的幂(求和)
- YTU 2500: 二元表达式计算
- 借助shared_ptr实现copy-on-write以提高多线程并发性能
- YTU 2503: 大斐波那契数列
- YTU 2504: 蚂蚁感冒
- 智慧北京开发第三天(上)
- YTU 2505: 啤酒和饮料
- Java中HashMap遍历的两种方式