网络流 - 随笔分类 - Caturra

摘要：数目规模大,尝试转换为判定性问题,那么E就不影响到网络流的复杂度了 SPFA码歪了,WA了好几发气死了 C++ include using namespace std; const int maxn = 3e5+11; const int oo = 0x3f3f3f3f; int to[maxnf) 阅读全文

posted @ 2017-11-29 21:45 Caturra 阅读(200) 评论(0) 推荐(0)

Codeforces 316C2 棋盘模型

摘要：Let’s move from initial matrix to the bipartite graph. The matrix elements (i, j) for which i + j are even should be place to one part, the matrix ele 阅读全文

posted @ 2017-11-29 20:07 Caturra 阅读(184) 评论(0) 推荐(0)

Codeforces 277E

摘要：按边建模，二叉树一条入边两条出边判断就要用到mcmf的好处了阅读全文

posted @ 2017-11-29 17:22 Caturra 阅读(273) 评论(0) 推荐(0)

Codeforces 237E

摘要：没啥好说的 C++ include include include include using namespace std; const int maxn = 1e5+11; const int oo = 0x3f3f3f3f; int to[maxnf&&dis[v] dis[u]+w){ dis 阅读全文

posted @ 2017-11-29 16:44 Caturra 阅读(150) 评论(0) 推荐(0)

3972

摘要：```C++ include using namespace std; const int maxn = 1e6+11; const int oo = 0x7fffffff; const double eps = 1e 8; int to[maxnf){ vis[v]=1; dis[v]=dis[u 阅读全文

posted @ 2017-11-28 20:09 Caturra 阅读(346) 评论(0) 推荐(0)

UVA 10806

摘要：```C++ include include include include using namespace std; const int maxn = 1e5+11; const int oo = 0x3f3f3f3f; int to[maxnf&&dis[v] dis[u]+w){ dis[v] 阅读全文

posted @ 2017-11-28 12:18 Caturra 阅读(157) 评论(0) 推荐(0)

UVALive 3645 时序模型

摘要：按航班拆点注意返边的条件 C++ include using namespace std; const int maxn = 1e6+11; const int oo = 0x7fffffff; int to[maxnf){ vis[v]=1; dis[v]=dis[u]+1; que.push( 阅读全文

posted @ 2017-11-28 12:02 Caturra 阅读(208) 评论(0) 推荐(0)

UVA11082 行列模型

摘要：行列二分图模型，行指向列即表示权重w[i][j] 避免零流的方法就是使下界为1 阅读全文

posted @ 2017-11-28 11:43 Caturra 阅读(195) 评论(0) 推荐(0)

CF653D

摘要：~~~ 阅读全文

posted @ 2017-11-28 00:03 Caturra 阅读(316) 评论(0) 推荐(0)

The Azure Arbitrator

若无法实现，就让一切归零 ——零之轨迹

随笔分类 - 网络流

公告