USACO6.4-Wisconsin Squares:搜索
Wisconsin Squares
It's spring in Wisconsin and time to move the yearling calves to the
yearling pasture and last year's yearlings to the greener pastures of the
north 40.
Farmer John has five kinds of cows on his farm (abbreviations are shown
in parentheses): Guernseys (A), Jerseys (B), Herefords (C), Black Angus
(D), and Longhorns (E). These herds are arranged on the 16 acre pasture,
one acre for each small herd, on a 4 x 4 grid (labeled with rows and
columns) like this:
1 2 3 4
+-------
1|A B A C
2|D C D E
3|B E B C
4|C A D E
In the initial pasture layout, the herds total 3 A's, 3 B's, 4 C's, 3 D's, and 3 E's. This year's calves have one more D herd and one fewer C herd, for a total of 3 A's, 3 B's, 3 C's, 4 D's, and 3 E's.
FJ is extremely careful in his placement of herds onto his pasture grid. This is because when herds of the same types of cows are too close together, they misbehave: they gather near the fence and smoke cigarettes and drink milk. Herds are too close together when they are on the same square or in any of the eight adjacent squares.
Farmer John must move his old herd out of the field and his new herd into the field using his old brown Ford pickup truck, which holds one small herd at a time. He picks up a new herd, drives to a square in the yearling pasture, unloads the new herd, loads up the old herd, and drives the old herd to the north 40 where he unloads it. He repeats this operation 16 times and then drives to Zack's for low-fat yogurt treats and familiar wall decor.
Help Farmer John. He must choose just exactly the correct order to replace the herds so that he never puts a new herd in a square currently occupied by the same type of herd or adjacent to a square occupied by the same type of herd. Of course, once the old cows are gone and the new cows are in place, he must be careful in the future to separate herds based on the new arrangement.
Very important hint: Farmer John knows from past experience that he must move a herd of D cows first.
Find a way for Farmer John to move the yearlings to their new pasture. Print the 16 sequential herd-type/row/column movements that lead to a safe moving experience for the cows.
Calculate the total number of possible final arrangements for the 4x4 pasture and calculate the total number of ways those arrangements can be created.
PROGRAM NAME: wissqu
TIME LIMIT: 5 seconds
INPUT FORMAT
Four lines, each with four letters that denote herds.
SAMPLE INPUT (file wissqu.in)
ABAC
DCDE
BEBC
CADE
OUTPUT FORMAT
16 lines, each with a herd-type, row and column. If there are multiple solutions (and there are), you should output the solution for which the concatenated string ("D41C42A31 ... D34") of the answers is first in lexicographic order.
One more line with the total number of ways these arrangements can be created.
SAMPLE OUTPUT (file wissqu.out)
D 4 1
C 4 2
A 3 1
A 3 3
B 2 4
B 3 2
B 4 4
E 2 1
E 2 3
D 1 4
D 2 2
C 1 1
C 1 3
A 1 2
E 4 3
D 3 4
14925
这题估计是第6章里面最水的题了,可是我还是调了好久,因为没有注意到移进来的字母不能和原来的相同,一直TLE。。。T.T
然后直接暴搜,什么剪枝都不用加,测试数据竟然就是样例,而且只有一组。。。
Executing...
Test 1: TEST OK [0.921 secs, 3372 KB] All tests OK. YOUR PROGRAM ('wissqu') WORKED FIRST TIME! That's fantastic -- and a rare thing. Please accept these special automated congratulations. Here are the test data inputs: ------- test 1 [length 20 bytes] ----
ABAC
DCDE
BEBC
CADE
/*
LANG:C++
TASK:wissqu
*/
#include <iostream>
#include <memory.h>
#include <stdio.h>
using namespace std; class CC
{
public:
int c; // 要移进来的字母
int x,y;
}; int G[][]= {}; // 'A'用1表示
int sum=;
int Left[]= {-,,,,,};
bool vis[][]= {}; CC goal[],load[]; const int dx[]= {-,-,-, , , , , , };
const int dy[]= {-, , ,-, , ,-, , };
// 判断(x,y)是否符合
bool check(int x,int y,int c)
{
for(int i=; i<; i++)
{
int newx=x+dx[i];
int newy=y+dy[i];
if(G[newx][newy]==c)
return false;
}
return true;
} void dfs(int cnt=,int c=)
{
if(cnt>=)
{
sum++;
// 记录方案
if(sum==)
{
memcpy(goal,load,sizeof load);
}
return ;
} for(int x=; x<=; x++)
for(int y=; y<=; y++)
{
if(!vis[x][y] && check(x,y,c))
{
int tmp=G[x][y];
G[x][y]=c;
vis[x][y]=true;
Left[c]--;
load[cnt].x=x;
load[cnt].y=y;
load[cnt].c=c; if(cnt==)
dfs(cnt+,);
else
for(int i=; i<=; i++)
{
if(Left[i])
{
dfs(cnt+,i);
}
} G[x][y]=tmp;
vis[x][y]=false;
Left[c]++;
}
}
} int main()
{
freopen("wissqu.in","r",stdin);
freopen("wissqu.out","w",stdout); for(int i=; i<=; i++)
{
for(int j=; j<=; j++)
{
int x=getchar()-'A'+;
G[i][j]=x;
}
getchar();
} dfs(); for(int i=; i<; i++)
printf("%c %d %d\n",goal[i].c-+'A',goal[i].x,goal[i].y); printf("%d\n",sum); return ;
}
USACO6.4-Wisconsin Squares:搜索的更多相关文章
- USACO 6.4 Wisconsin Squares
Wisconsin Squares It's spring in Wisconsin and time to move the yearling calves to the yearling past ...
- P2730 魔板 Magic Squares (搜索)
题目链接 Solution 这道题,我是用 \(map\) 做的. 具体实现,我们用一个 \(string\) 类型表示任意一种情况. 可以知道,排列最多只有 \(8!\) 个. 然后就是直接的广搜了 ...
- USACO 6.4 章节
The Primes 题目大意 5*5矩阵,给定左上角 要所有行,列,从左向右看对角线为质数,没有前导零,且这些质数数位和相等(题目给和) 按字典序输出所有方案... 题解 看上去就是个 无脑暴搜 题 ...
- USACO 完结的一些感想
其实日期没有那么近啦……只是我偶尔还点进去造成的,导致我没有每一章刷完的纪念日了 但是全刷完是今天啦 讲真,题很锻炼思维能力,USACO保持着一贯猎奇的题目描述,以及尽量不用高级算法就完成的题解……例 ...
- Leetcode之广度优先搜索(BFS)专题-279. 完全平方数(Perfect Squares)
Leetcode之广度优先搜索(BFS)专题-279. 完全平方数(Perfect Squares) BFS入门详解:Leetcode之广度优先搜索(BFS)专题-429. N叉树的层序遍历(N-ar ...
- Instantaneous Transference--POJ3592Tarjan缩点+搜索
Instantaneous Transference Time Limit: 5000MS Memory Limit: 65536K Description It was long ago when ...
- A Knight's Journey 分类: POJ 搜索 2015-08-08 07:32 2人阅读 评论(0) 收藏
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 35564 Accepted: 12119 ...
- CodeForces 173C Spiral Maximum 记忆化搜索 滚动数组优化
Spiral Maximum 题目连接: http://codeforces.com/problemset/problem/173/C Description Let's consider a k × ...
- Educational Codeforces Round 1 E. Chocolate Bar 记忆化搜索
E. Chocolate Bar Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/598/prob ...
随机推荐
- 使用jcrop进行头像剪切
http://www.cnblogs.com/chenssy/archive/2013/05/18/3084985.html http://code.ciaoca.com/jquery/jcrop/ ...
- Sql排名和分组排名
在很多时候,都有排名这个功能,比如排行榜,并且还需要分页的功能,一般可以再select的时候按照某一字段 oorder by XX desc,这样limit 查找就可以得到排名信息,但是有时候是需要多 ...
- Asp.Net MVC 页面代码压缩筛选器-自定义删除无效内容
Asp.Net MVC 页面代码压缩筛选器 首先定义以下筛选器,用于代码压缩. /*页面压缩 筛选器*/ public class WhiteSpaceFilter : Stream { privat ...
- linux命令之partprobe
使用fdisk工具只是将分区信息写入到磁盘,如果需要使用mkfs格式化并使用分区,则需要重新启动系统.partprobe 是一个可以修改kernel中分区表的工具,可以使kernel重新读取分区表而不 ...
- 应用框架 ViewPager Tab Fragment SlidingMenu
介绍 常见的应用框架 框架一:多个tab+Fragment,点击不同的tab加载不同的Fragment,不能滑动切换只能点击切换: 框架二:多个tab+ViewPager+FragmentPagerA ...
- HTTP调试 抓包 工具 Fiddle 简介 示例
简介 1.常用抓包工具对比: Firebug虽然可以抓包,但是对于分析http请求的详细信息,不够强大.模拟http请求的功能也不够,且firebug常常是需要"无刷新修改",如果 ...
- JavaScript代码性能优化总结
JavaScript 代码性能优化总结 尽量使用源生方法 javaScript是解释性语言,相比编译性语言执行速度要慢.浏览器已经实现的方法,就不要再去实现一遍了.另外,浏览器已经实现的方法在算法方面 ...
- html:标签原本属性
<!doctype html>无标题文档 a标签,默认有text-decoration属性 span标签不需要清零 b标签不需要清零 em标签不需要清零 strong 相邻内嵌元素代码里面 ...
- json数组传递到后台controller
现前台有如下格式的数据需要传递到后台的controller, public class UpdatePara { public int RoleID { get; set; } public List ...
- 你确定你是一个合格的.Net开发人员吗?
做.net开发已有近5年时间,自认掌握的知识比较全面.最近部门需要招人,今天抽空在网上看了一下,发现我了解的还是不够多啊.下面是我大致的罗列了一下作为一名.Net开发人员所需要掌握的只是.看看你是不是 ...