UVALive 7267 Mysterious Antiques in Sackler Museum(dfs)
2017-10-27 13:07
393 查看
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5279
题目大意:
给出四个矩形的长和宽,要你判断任意选取其中的三个能不能组成一个新的矩形。
简单dfs搜一下就行了,注意要判断两种情况(如果是两个一起判断就是四种)。
题目大意:
给出四个矩形的长和宽,要你判断任意选取其中的三个能不能组成一个新的矩形。
简单dfs搜一下就行了,注意要判断两种情况(如果是两个一起判断就是四种)。
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int blag,vis[4]; struct node{ int x,y; }s[5]; void dfs(int a,int b,int cur) { if(cur==3) { blag=1; return ; } for(int i=0;i<4;i++) { if(!vis[i]) { vis[i]=1; if(s[i].x==a) dfs(b+s[i].y,a,cur+1); if(s[i].x==b) dfs(a+s[i].x,b,cur+1); if(s[i].y==a) dfs(b+s[i].x,a,cur+1); if(s[i].y==b) dfs(a+s[i].x,b,cur+1); vis[i]=0; } } } int main() { int t; cin>>t; while(t--) { for(int i=0;i<4;i++) cin>>s[i].x>>s[i].y; blag=0; memset(vis,0,sizeof(vis)); for(int i=0;i<4;i++) { vis[i]=1; dfs(s[i].x,s[i].y,1); vis[i]=0; } printf("%s\n",blag?"Yes":"No"); } return 0; }
相关文章推荐
- UVaLive 7267 Mysterious Antiques in Sackler Museum (if-else,枚举)
- UVALive 7267 Mysterious Antiques in Sackler Museum (判断长方形)
- UVALive 7267 Mysterious Antiques in Sackler Museum (判断长方形)
- UVALive - 7267 Mysterious Antiques in Sackler Museum
- UVALive 7267 Mysterious Antiques in Sackler Museum 思维题 拼接矩形
- 2015北京邀请赛 UVALive7267 Mysterious Antiques in Sackler Museum
- UVA7267 Mysterious Antiques in Sackler Museum (强行模拟)
- 【hihocoder1255 2015北京赛区G】【简单模拟 简化写法超棒哦】 Mysterious Antiques in Sackler Museum 四个矩形选三个 恰好拼成大矩形
- 【hihocoder1255 Mysterious Antiques in Sackler Museum】构造 枚举
- hihoCoder 1255 Mysterious Antiques in Sackler Museum(水)
- codeforces_598D. Igor In the Museum(dfs)
- Educational Codeforces Round 1 D.Igor In the Museum(DFS)
- CodeForces 598D-Igor In the Museum【DFS】
- D. Igor In the Museum(简单DFS)
- 【Educational Codeforces Round 1D】【DFS 联通块打标记法】Igor In the Museum 联通块内墙的面数
- CodeForces 598 D. Igor In the Museum(dfs)
- CF 598D. Igor In the Museum【DFS】
- 329. Longest Increasing Path in a Matrix(DFS & DP)
- 105. Construct Binary Tree from Preorder and Inorder Traversal (Tree; DFS)
- Hadoop Datanode节点无法启动(All directories in dfs.data.dir are invalid)