Friends(DFS+剪枝)
来源:互联网 发布:serpentza黑中国知乎 编辑:程序博客网 时间:2024/05/21 08:03
Link:http://acm.hdu.edu.cn/showproblem.php?pid=5305
Friends
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 713 Accepted Submission(s): 335
Problem Description
There are n people and m pairs of friends. For every pair of friends, they can choose to become online friends (communicating using online applications) or offline friends (mostly using face-to-face communication). However, everyone in these n people wants to have the same number of online and offline friends (i.e. If one person has x onine friends, he or she must have x offline friends too, but different people can have different number of online or offline friends). Please determine how many ways there are to satisfy their requirements.
Input
The first line of the input is a single integer T (T=100) , indicating the number of testcases.
For each testcase, the first line contains two integersn (1≤n≤8) and m (0≤m≤n(n−1)2) , indicating the number of people and the number of pairs of friends, respectively. Each of the next m lines contains two numbers x and y , which mean x and y are friends. It is guaranteed that x≠y and every friend relationship will appear at most once.
For each testcase, the first line contains two integers
Output
For each testcase, print one number indicating the answer.
Sample Input
23 31 22 33 14 41 22 33 44 1
Sample Output
02
Source
2015 Multi-University Training Contest 2
AC code:
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<vector>#include<cmath>#define LL long long#define MAXN 222using namespace std;int n,m,l,r,i,j,x,y;int a[MAXN],F[11][2];int size[MAXN];int cnt;const int MOD=1e9+7;vector<int>vec[MAXN];void dfs(int idx){ if(idx==m+1) { for(i=1;i<=n;i++) { if(F[i][0]!=F[i][1]) break; } if(i==n+1) cnt++; return; } for(int c=0;c<=1;c++) { F[vec[idx][0]][c]++; F[vec[idx][1]][c]++; if(F[vec[idx][0]][c]>(size[vec[idx][0]]/2)||F[vec[idx][1]][c]>(size[vec[idx][1]]/2)) { F[vec[idx][0]][c]--; F[vec[idx][1]][c]--; continue; } dfs(idx+1); F[vec[idx][0]][c]--; F[vec[idx][1]][c]--; } return; } int main(){ int T; bool flag; while(scanf("%d",&T)!=EOF) { while(T--) { flag = false; memset(size,0,sizeof(size)); scanf("%d%d",&n,&m); for(i=1;i<=m;i++) vec[i].clear(); for(i=1;i<=m;i++) { scanf("%d%d",&x,&y); vec[i].push_back(x); vec[i].push_back(y); size[x]++; size[y]++; } cnt=0; for(i=1;i<=n;i++) { F[i][0]=0; F[i][1]=0; } for(i=1;i<=n;i++) { if(size[i] % 2 != 0) { flag = true; break; } } if(flag == true) { printf("0\n"); } else{ dfs(1); printf("%d\n",cnt); } } } return 0; }
0 0
- Friends(DFS+剪枝)
- *HDU 5305 - Friends (DFS + 剪枝)
- HDU 5305 Friends DFS+剪枝
- HDU 5305 Friends(DFS + 剪枝)
- HDU 5305 Friends(2015多校第二场 dfs + 剪枝)
- hdu 5305 Friends(搜索+剪枝)
- DFS(剪枝)_hdu_1010
- hdu5113(dfs+剪枝)
- hdu1010(dfs+剪枝)
- dfs+剪枝(hdu1010)
- 等边三角形(dfs剪枝)
- HDU5937(DFS+剪枝)
- Cubes(DFS+剪枝)
- hdu1010(dfs+剪枝)
- HDU 5305 Friends(dfs)
- HDU 5305 Friends(dfs)
- hdu 5305 Friends(dfs)
- POJ2248Addition Chains(dfs+剪枝)
- JAVA流操作(3)对象流
- 文章标题
- redis集群部署
- 九度 oj 1019
- android - EventBus
- Friends(DFS+剪枝)
- MySql分页和Oracle分页
- socket lib初始化样例代码
- Wildfly8 POST请求中文乱码分析与解决
- 全局与局部变量及递归
- 安全令牌
- 矩阵理解(转)
- redis主从配置
- SkipList 跳表 简单易懂表述