HDU 5305 Friends (DFS)
来源:互联网 发布:amd多核cpu优化补丁 编辑:程序博客网 时间:2024/05/20 06:41
Friends
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 163 Accepted Submission(s): 61
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 thesen people wants to have the same number of online and offline friends (i.e. If one person hasx 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 integerT (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 nextm 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
题目大意:一些朋友关系可离线可在线,要求每个人的离线朋友数等于在线朋友数
题目分析:数据量不大,直接爆搜,记录每个点的度数,奇数的直接不可能,偶数的分成两个数组,c1[i]表示i的在线朋友数,c2[i]表示i的离线朋友数,然后一条边一条边搜就行了,注意一个剪枝,当一条边的两个端点有一个c值为0,则return
题目大意:一些朋友关系可离线可在线,要求每个人的离线朋友数等于在线朋友数
题目分析:数据量不大,直接爆搜,记录每个点的度数,奇数的直接不可能,偶数的分成两个数组,c1[i]表示i的在线朋友数,c2[i]表示i的离线朋友数,然后一条边一条边搜就行了,注意一个剪枝,当一条边的两个端点有一个c值为0,则return
#include <cstdio>#include <cstring>bool mp[10][10];int deg[10], c1[10], c2[10];int n, m, cnt, ans;struct EDGE{ int u, v;}e[100000];void DFS(int cur){ if(cur == m + 1) { ans ++; return; } int v = e[cur].v; int u = e[cur].u; if(c1[u] && c1[v]) { c1[u] --; c1[v] --; DFS(cur + 1); c1[u] ++; c1[v] ++; } if(c2[u] && c2[v]) { c2[u] --; c2[v] --; DFS(cur + 1); c2[u] ++; c2[v] ++; } return;}int main(){ int T; scanf("%d", &T); while(T --) { cnt = 0; ans = 0; memset(deg, 0, sizeof(deg)); memset(e, 0, sizeof(e)); memset(c1, 0, sizeof(c1)); memset(c2, 0, sizeof(c2)); scanf("%d %d", &n, &m); for(int i = 1; i <= m; i++) { scanf("%d %d", &e[i].u, &e[i].v); deg[e[i].u] ++; deg[e[i].v] ++; } bool f = false; for(int i = 1; i <= n; i++) { c1[i] = c2[i] = deg[i] / 2; if(deg[i] & 1) { f = true; break; } } if(f) { printf("0\n"); continue; } DFS(1); printf("%d\n", ans); }}
1 0
- HDU 5305 Friends (DFS)
- HDU 5305 Friends (DFS)
- hdu 5305 Friends (dfs)
- HDU 5305 Friends DFS
- hdu 5305 Friends dfs
- HDU 5305 Friends(DFS)
- HDU 5305 Friends(dfs)
- HDU 5305 Friends(dfs)
- *HDU 5305 - Friends (DFS + 剪枝)
- HDU 5305 Friends(dfs)
- hdu 5305 Friends(dfs)
- HDU 5305 Friends DFS+剪枝
- HDU 5305 Friends(DFS + 剪枝)
- HDU 5305 Friends(简单DFS)
- hdu(5305)——Friends(dfs)
- HDU 5305 Friends(2015多校第二场 dfs + 剪枝)
- 【HDU 5305】Friends 多校第二场(双向DFS)
- HDU 5301 Friends(DFS + 枚举)
- android图片处理之图像模糊
- HttpClient
- Cocos2d-x AnchorPoint锚点
- 初试结构体杭电1862EXCEL排序
- 【机房收费系统】时间控件的使用及显示当前电脑的名称
- HDU 5305 Friends (DFS)
- Thinking in Java 笔记(第二章 一切都是对象)
- mac下idea的常用快捷键
- Xml解析器(java用的)
- 极简 Spark 入门笔记——安装和第一个回归程序
- Android开发遇到的细节问题(一)
- 黑马程序员——第四篇_正则表达式
- 一些mysql语句
- JAVA学习第八天