[hdu 5952 Counting Cliques]暴搜
来源:互联网 发布:恒指用什么软件看盘 编辑:程序博客网 时间:2024/06/07 05:15
[hdu 5952 Counting Cliques]暴搜
题目链接:[hdu 5952 Counting Cliques]
题意描述:
解题思路:
直接暴搜答案。度数不超过
DFS暴搜,用
值得注意的一点是,这个题目卡比较时间严重【也可能是代码写的搓?】。反正加双向边
#include <bits/stdc++.h>using namespace std;#define FIN freopen("data.txt","r",stdin)typedef __int64 LL;const int MAXN = 100 + 5;const int MAXM = 1000 + 5;int T, N, M, S;struct Edge { int v, nxt;} edge[MAXM << 1];bool G[MAXN][MAXN];int head[MAXN], tot, ans, DU[MAXN], F[MAXN], path[MAXN];void init() { ans = tot = 0; memset(head, -1, sizeof(head)); memset(G, false, sizeof(G)); memset(DU, 0, sizeof(DU)); memset(F, 0, sizeof(F));}void add_edge(int u, int v) { edge[tot] = Edge {v, head[u]}; head[u] = tot ++;}void dfs(int sz) { int u = path[sz], v; if(sz == S) { ans ++; return; } if(sz + F[u + 1] < S) return; for(int i = head[u]; ~i; i = edge[i].nxt) { v = edge[i].v; if(u > v) continue; if(DU[v] < S - 1) continue; bool okay = true; for(int j = 1; j <= sz; j++) { okay &= G[path[j]][v]; if(okay == false) break; } if(okay == false) continue; path[sz + 1] = v; dfs(sz + 1); }}int main() {#ifndef ONLINE_JUDGE FIN;#endif // ONLINE_JUDGE int u, v; scanf("%d", &T); while(T --) { scanf("%d %d %d", &N, &M, &S); init(); for(int i = 1; i <= M; i++) { scanf("%d %d", &u, &v); G[u][v] = G[v][u] = true; DU[u]++, DU[v]++; add_edge(u, v); /// 题目给定了 u < v } F[N + 1] = 0; for(int i = N; i >= 1; i--) { F[i] = F[i + 1] + (DU[i] >= S - 1); } for(int i = 1; i <= N; i++) { if(DU[i] < S - 1) continue; path[1] = i; dfs(1); } printf("%d\n", ans); } return 0;}
1 0
- [hdu 5952 Counting Cliques]暴搜
- hdu 5952Counting Cliques(暴搜)
- HDU 5952 - Counting Cliques
- hdu 5952 Counting Cliques
- hdu 5952 Counting Cliques
- hdu 5952 Counting Cliques
- HDU 5952 Counting Cliques(dfs)
- HDU 5952 Counting Cliques 爆搜
- HDU-5952 Counting Cliques ,爆搜!
- 【HDU 5952 Counting Cliques】& DFS
- HDU 5952 Counting Cliques(dfs)
- HDU 5952 Counting Cliques 暴力搜索
- HDU 5952 Counting Cliques dfs乱搞
- hdu 5952Counting Cliques(dfs优化)
- hdu 5952 Counting Cliques 暴力枚举+优化
- HDU-5952-Counting Cliques(搜索剪枝)
- HDU 5952 Counting Cliques 图DFS
- HDU 5952 Counting Cliques dfs + 思维
- java比较日期大小
- 洛谷2085最小函数值(minval) + 洛谷1631序列合并
- 成长,进一寸有一寸的欢喜
- 数据分组-可视分箱
- VPW_BUS协议
- [hdu 5952 Counting Cliques]暴搜
- 数据结构实验之串一:KMP简单应用
- BP神经网络初识
- 【NOIP 模拟题】[T1](递推+乱搞)
- Codeforces Gym 101061 J Cola (巧妙的思维题)
- 简单的SpringMvc实例
- Linux内核结构
- 2016.10.30
- Java JNI调用dll中的C代码的流程