ZJNU 1710 dfs
来源:互联网 发布:洞箫f调制作数据图 编辑:程序博客网 时间:2024/05/25 21:36
Description
Everyone’s favorite character and puppet-maker Geppetto has opened a new pizza place, the best in town. Geppetto is trying to make the best pizza possible, but at the same time he doesn’t want to have a small selection of pizzas. He makes his pizzas out of N ingredients marked with numbers from 1 to N. All that would be simple if he could mix any ingredient with every ingredient on the pizza, but unfortunately, that is not the case. Sometimes some ingredients cannot mix and that creates additional complications for our pizza master. There are M pairs of ingredients that cannot be on the same pizza at the same time. Given these restrictions, Geppetto wants to know how many different pizzas he can make. Help him answer this question. Two pizzas are considered different if there is an ingredient of index i that is on one pizza, but not on the other.
Input
The first line of input contains two integers N and M (1 <= N <= 20, 1 <= M <= 400). Each of the following M lines contains two different numbers a i b, they represent the prohibition of mixing ingredients marked with a and b on the pizza. (1 <= a, b <= N). All pairs of ingredients are not necessarily distinct, some pair could occur multiple times.
Output
The first and only line of output must contain the number of different pizzas given the restrictions in the task
Sample Input
1 2
2 3
3 0
3 3
1 2
1 3
2 3
Sample Output
8
4
题意就是给你n种调料,m种限制,就是a调料和b调料不能放一起,现在问你有几种加调料的方法,当然也可以不加。纠结了很久的一道题 ,通过不断地问学长才理解了,搜索真心强大!
#include<iostream>using namespace std;int i,n,m,a,b,cannot[20];//调料编号为0-19int dfs(int x,int sum){ //用2进制的0与1代表当前位的放调料与不放调料if(x==n)return 1; // 如果搜索到了第n+1种调料,返回1。if(!(cannot[x]&sum))return dfs(x+1,sum|(1<<x))+dfs(x+1,sum);//如果当前的配料与已知不冲突的话,则搜索放这种调料与不放这种调料的两种情况。else return dfs(x+1,sum);//否则只能搜索不放这种调料的情况。}int main(){cin>>n>>m;for(i=0;i<m;i++){cin>>a>>b;a--;b--;cannot[a]|=(1<<b);数组a的二进制或上b,直接判断cannot[b]|=(1<<a);同理}cout<<dfs(0,0)<<endl;从不放调料开始搜,直到所有情况都搜索完return 0;}
- ZJNU 1710 dfs
- ZJNU 1888
- ZJNU 1903
- ZJNU 1614
- Zjnu Stadium
- Zjnu Stadium
- Zjnu Stadium
- zjnu AllButOneDivisor
- ZJNU 1889 太空行走
- ZJNU 1006 骑士游历
- HDU 3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- HDU 3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- O - Zjnu Stadium
- hdu 3047:Zjnu Stadium
- HDU Zjnu Stadium
- CSS3 Media Queries 与Responsive 设计
- java---多线程的并发控制
- Ubuntu 16.04 vim 报错: required vim compiled with +python
- 课程练习二-总结
- 【浅谈git常用命令】
- ZJNU 1710 dfs
- http请求和消息
- Java设计模式透析之 —— 策略(Strategy)
- Android内部File文件缓存
- HDU 2222 Keywords Search(AC自动机)
- Leetcode Add Digits 258
- P2P 网络 ZeroNet 初体验
- SVM学习前的数学预热
- 1005 Turn the corner