E - Counting Cliques HDU - 5952 DFS+剪枝
A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is t...
C - Recursive sequence HDU - 5950 矩阵快速幂
Farmer John likes to play mathematics games with his N cows. Recently, they are attracted by recursive sequences. In each turn, the cows would stand ...
JAVA大数在ACM中应用
HDU-1002 大数A+B import java.math.BigDecimal; import java.math.BigInteger; import java.util.*; public class Main { public static v...
[网络流24题]方格取数 最大点权独立集
题目链接大牛思路:【问题分析】二分图点权最大独立集，转化为最小割模型，从而用最大流解决。【建模方法】首先把棋盘黑白染色，使相邻格子颜色不同，所有黑色格子看做二分图X集合中顶点，白色格子看做Y集合顶点，建立附加源S汇T。1、从S向X集合中每个顶点连接一条容量为格子中数值的有向边。 2、从Y集合中每...
[图论紫书/Ch5] Ideal Path UVA - 1599 BFS/正向反向BFS
题目链接先从终点BFS到起点,并记录下其到终点的距离,然后从起点BFS到终点,并优先选取边权值小的.#include using namespace std; typedef long long ll; const int INF = 1e9+10; co...
[紫书/Ch6] Play on Words 欧拉回路判定
Play on Words Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8780 Accepted Submission...
1659: [Usaco2006 Mar]Lights Out 关灯 迭代加深搜索
1659: [Usaco2006 Mar]Lights Out 关灯 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 315 Solved: 81 [Submit][Status][Discuss] Description 奶牛们喜欢在...
[CCPC杭州] Bomb 强连通分量
Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1894 Accepted Submission(s): 631 ...
[2016CCPC合肥] 传递 图论
传递 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1476 Accepted Submission(s): 672 ...