UVALive 7267 Mysterious Antiques in Sackler Museum(dfs)
来源:互联网 发布:淘宝网店上货教程 编辑:程序博客网 时间:2024/05/17 00:04
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5279
题目大意:
给出四个矩形的长和宽,要你判断任意选取其中的三个能不能组成一个新的矩形。
简单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;}
阅读全文
0 0
- UVALive 7267 Mysterious Antiques in Sackler Museum(dfs)
- UVALive 7267Mysterious Antiques in Sackler Museum (判断长方形)
- UVALive 7267 Mysterious Antiques in Sackler Museum 思维题 拼接矩形
- hihoCoder 1255 Mysterious Antiques in Sackler Museum(水)
- UVA7267 Mysterious Antiques in Sackler Museum (强行模拟)
- hihocoder 1255 Mysterious Antiques in Sackler Museum
- 2015北京邀请赛 UVALive7267 Mysterious Antiques in Sackler Museum
- ACM-ICPC北京赛区2015 G Mysterious Antiques in Sackler Museum hihoCoder 1255
- 【hihocoder1255 2015北京赛区G】【简单模拟 简化写法超棒哦】 Mysterious Antiques in Sackler Museum 四个矩形选三个 恰好拼成大矩形
- Codeforces 598D Igor In the Museum (DFS)
- CodeForces 598 D. Igor In the Museum(dfs)
- D. Igor In the Museum(简单DFS)
- codeforces_598D. Igor In the Museum(dfs)
- UVALive - 4123 Glenbow Museum
- UVALive 4123Glenbow 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)
- Codeforces 879C Short Program【思维】
- 647. Palindromic Substrings (DP)
- @Transactional(rollbackFor=Exception.class)的使用
- Error parsing HTTP request header
- 杨晖菱形
- UVALive 7267 Mysterious Antiques in Sackler Museum(dfs)
- java操作BerkeleyDB数据库判断元素是否存在(过滤器)
- CodeForces
- Android 软键盘遮挡Dialog
- 讲讲排序(C++描述 )
- C++中的动态类型与动态绑定、虚函数、运行时多态的实现
- 2018希望杯报名考试时间、分数、考试详情等信息大全
- 【数论】最小公倍数的二进制优化
- 没想到的错误之linux安装问题