UVA225-Golygons(dfs)
Problem UVA225-Golygons
Accept:307 Submit:3646
Time Limit: 3000 mSec
Problem Description
Imagine a country whose cities have all their streets laid out in a regular grid. Now suppose that a tourist with an obsession for geometry is planning expeditions to several such cities.
Starting each expedition from the central cross-roads of a city, the intersection labelled (0,0), our mathematical visitor wants to set off north, south, east or west, travel one block, and view the sights at the intersection (0,1) after going north, (0,-1) after going south, (1,0) after going east or (-1,0) after going west. Feeling ever more enthused by the regularity of the city, our mathematician would like to walk a longer segment before stopping next, going two blocks. What’s more, our visitor doesn’t want to carry on in the same direction as before, nor wishes to double back, so will make a 90o turn either left or right. The next segment should be three blocks, again followed by a right-angle turn, then four, five, and so on with ever-increasing lengths until finally, at the end of the day, our weary traveller returns to the starting point, (0,0).
The possibly self-intersecting figure described by these geometrical travels is called a golygon.
Unfortunately, our traveller will making these visits in the height of summer when road works will disrupt the stark regularity of the cities’ grids. At some intersections there will be impassable obstructions. Luckily, however, the country’s limited budget means there will never be more than 50 road works blocking the streets of any particular city. In an attempt to gain accountability to its citizens, the city publishes the plans of road works in advance. Our mathematician has obtained a copy of these plans and will ensure that no golygonal trips get mired in molten tar.
Write a program that constructs all possible golygons for a city.
Input
Since our tourist wants to visit several cities, the input file will begin with a line containing an integer specifying the number of cities to be visited.
For each city there will follow a line containing a positive integer not greater than 20 indicating the length of the longest edge of the golygon. That will be the length of the last edge which returns the traveler to (0,0). Following this on a new line will be an integer from 0 to 50 inclusive which indicates how many intersections are blocked. Then there will be this many pairs of integers, one pair per line, each pair indicating the x and y coordinates of one blockage.
Output
For each city in the input, construct all possible golygons. Each golygon must be represented by a sequence of characters from the set {n,s,e,w} on a line of its own. Following the list of golygons should be a line indicating how many solutions were found. This line should be formatted as shown in the example output. A blank line should appear following the output for each city.
Note: See on the right the diagram of the 1st City
Sample Input
Sample Ouput
wsenenws
Found 1 golygon(s).
Found 0 golygon(s).
题解:很明显的dfs搜索,剪枝也很粗暴,如果剩下的步数不足以回到原点就返回。由于坐标可能是负的,因此原点坐标要取成一个足够大的正值。
坑点:题目中没有说一个城市只能参观一次,但是实际上只能参观一次,需要vis数组。
#include <bits/stdc++.h> using namespace std; const int o = ,Max = ; int n,ans;
int gra[Max][Max];
int dx[] = {,,,-};
int dy[] = {,,-,};
bool vis[Max][Max];
char Direction[] = {'e','n','s','w'};
int sta[],num[] = {,}; //dir为0代表水平方向,为1代表垂直方向 void dfs(int x,int y,int pos,int dir){
//printf("pos:%d x:%d y:%d\n",pos,x,y);
if(pos == n+){
if(x==o && y==o){
ans++;
printf("%c",Direction[sta[]]);
for(int i = ;i <= n;i++){
printf("%c",Direction[sta[i]]);
}
printf("\n");
}
return;
} int step = ;
for(int i = pos;i <= n;i++) step += i;
if(abs(x-o)+abs(y-o) > step) return; if(dir == -){
for(int i = ;i < ;i++){
int xx = x+pos*dx[i],yy = y+pos*dy[i];
if(vis[xx][yy]) continue;
int k;
if(<=i && i<){
for(k = min(y,yy);k <= max(y,yy);k++){
if(gra[xx][k]) break;
}
if(k == max(y,yy)+){
sta[pos] = i;
vis[xx][yy] = true;
dfs(xx,yy,pos+,);
vis[xx][yy] = false;
}
}
else{
for(k = min(x,xx);k <= max(x,xx);k++){
if(gra[k][yy]) break;
}
if(k == max(x,xx)+){
sta[pos] = i;
vis[xx][yy] = true;
dfs(xx,yy,pos+,);
vis[xx][yy] = false;
}
}
}
}
else{
if(dir==){
for(int i = ;i < ;i++){
int xx = x+pos*dx[i],yy = y+pos*dy[i];
if(vis[xx][yy]) continue;
int k;
for(k = min(y,yy);k <= max(y,yy);k++){
if(gra[xx][k]) break;
}
if(k == max(y,yy)+){
sta[pos] = i;
vis[xx][yy] = true;
dfs(xx,yy,pos+,);
vis[xx][yy] = false;
}
}
}
else if(dir==){
for(int j = ;j < ;j++){
int i = num[j];
int xx = x+pos*dx[i],yy = y+pos*dy[i];
if(vis[xx][yy]) continue;
int k;
for(k = min(x,xx);k <= max(x,xx);k++){
if(gra[k][yy]) break;
}
if(k == max(x,xx)+){
sta[pos] = i;
vis[xx][yy] = true;
dfs(xx,yy,pos+,);
vis[xx][yy] = false;
}
}
}
}
} int main()
{
#ifdef GEH
freopen("helloworld.01.inp","r",stdin);
#endif
int iCase;
scanf("%d",&iCase);
while(iCase--){
ans = ;
memset(vis,false,sizeof(vis));
memset(gra,,sizeof(gra));
//vis[o][o] = true;
int k,x,y;
scanf("%d%d",&n,&k);
for(int i = ;i < k;i++){
scanf("%d%d",&x,&y);
if(abs(x)>o || abs(y)>o) continue;
gra[o+x][o+y] = ;
}
dfs(o,o,,-);
printf("Found %d golygon(s).\n\n",ans);
}
return ;
}
UVA225-Golygons(dfs)的更多相关文章
- UVA225 Golygons 黄金图形(dfs+回溯)
剪枝1:在同一个维度上的点具有相同的奇偶性,如果奇数数量只有奇数个那么一定不能返回原点. 剪枝2:当前位置怎么也走不回去. 3:沿途判断障碍即可. 在oj上提交0.347s,最快的0.012s,应该有 ...
- UVa225,Golygons
刘儒家翻译的走出的图形可以自交,不知道大家是怎么理解的,反正我是认为这句话的意思是告诉我允许一个点访问多次 这样是WA的,n=15和n=16时多输出很多数据,应该是不允许自交,也就是不允许一个点访问多 ...
- 【习题 7-2 UVA-225】Golygons
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 暴力枚举每次走哪里就好. 用一个二维数组来判重.(数据里,要求不能经过一个点两次->但路径可以相交 然后再用一个flag数组, ...
- BZOJ 3083: 遥远的国度 [树链剖分 DFS序 LCA]
3083: 遥远的国度 Time Limit: 10 Sec Memory Limit: 1280 MBSubmit: 3127 Solved: 795[Submit][Status][Discu ...
- BZOJ 1103: [POI2007]大都市meg [DFS序 树状数组]
1103: [POI2007]大都市meg Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 2221 Solved: 1179[Submit][Sta ...
- BZOJ 4196: [Noi2015]软件包管理器 [树链剖分 DFS序]
4196: [Noi2015]软件包管理器 Time Limit: 10 Sec Memory Limit: 512 MBSubmit: 1352 Solved: 780[Submit][Stat ...
- 图的遍历(搜索)算法(深度优先算法DFS和广度优先算法BFS)
图的遍历的定义: 从图的某个顶点出发访问遍图中所有顶点,且每个顶点仅被访问一次.(连通图与非连通图) 深度优先遍历(DFS): 1.访问指定的起始顶点: 2.若当前访问的顶点的邻接顶点有未被访问的,则 ...
- BZOJ 2434: [Noi2011]阿狸的打字机 [AC自动机 Fail树 树状数组 DFS序]
2434: [Noi2011]阿狸的打字机 Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 2545 Solved: 1419[Submit][Sta ...
- POJ_2386 Lake Counting (dfs 错了一个负号找了一上午)
来之不易的2017第一发ac http://poj.org/problem?id=2386 Lake Counting Time Limit: 1000MS Memory Limit: 65536 ...
随机推荐
- 【Java每日一题】20170324
20170323问题解析请点击今日问题下方的“[Java每日一题]20170324”查看(问题解析在公众号首发,公众号ID:weknow619) package Mar2017; public cla ...
- 深入理解SpringCloud与微服务构建
旭日Follow_24 的CSDN 博客 ,全文地址请点击: https://blog.csdn.net/xuri24/article/details/81742534 目录 一.SpringClou ...
- 使用CSS实现无滚动条滚动
我们都知道,撸页面的时候当我们的内容超出了我们的div,往往会出现滚动条,影响美观. 尤其是当我们在做一些导航菜单的时候.滚动条一出现就破坏了UI效果. 我们不希望出现滚动条,也不希望超出去的内容被放 ...
- CSS3 画基本图形,圆形、椭圆形、三角形等
CSS3圆角#css3-circle{ width: 150px; height: 150px; border-radius: 50%; }CSS3 椭圆形css3 radius#css3-elips ...
- javascript中加号(+)操作符的作用
// 16进制转换:+”0xFF”; // -> 255 // 获取当前的时间戳,相当于`new Date().getTime()`:+new Date(); // 比 ...
- Django---ORM中的锁和事务
---恢复内容开始--- 一 锁 行级锁 select_for_update(nowait=False,skip_locked=False) #注意必须用在事务里面,至于如何开启事务,往后看 返回一 ...
- RabbitMQ 消费消息
1, 创建一个 springboot 项目, 导入依赖(和生产者一致) 2, application.properties (基础配置和生产者一致, 消费者需要再额外配置一些) # rabbitmq ...
- Android为TV端助力 VelocityTracker 速度追踪器的使用及创建
VelocityTracker 速度追踪 第一,创建方式: VelocityTracker mVelocityTracker = new VelocityTracker .obtain() 第二, ...
- Implemented Energy-Conserving Hair Scattering Model from Weta Digital
I used to implement the Energy-Conserving Hair Scattering Model as the pre-calculation program, so t ...
- 云ERP真的靠谱吗?
现在几乎每个IT系统或项目都要跟云挂上钩,跟数码产品必与“智能”扯上关系一样,否则在外行甚至同行眼里就是“矮小搓”.ERP领域也悄然刮起了云端化.国内ERP产品也借此机会想弯道超车,通过云化来抢夺被S ...