图论
文章平均质量分 89
Steaunk
Remember to look up at the stars and not down at your feet. Be curious and however difficult life may seem, there is always something you can do and succeed at. - SH
展开
-
ZKW费用流模板
以 LOJ 102 为例#include <cstdio>#include <cstring>#define Min(_A, _B) (_A < _B ? _A : _B)#define R registerint F(){ R int x; R char ch; while(ch = getchar(), ch < '0' |...原创 2018-04-02 09:18:20 · 220 阅读 · 0 评论 -
「BZOJ 3511」土地划分
这题好简单好简单呀!不难发现,这是一个最小割模型。首先记一个 sumsumsum = ∑N−1i=2Ai+Bi∑i=2N−1Ai+Bi\sum_{i=2}^{N-1}A_i+B_i,所以 ans=sum−minCutans=sum−minCutans = sum -minCut,我们需要做的就是最小化 minCutminCutminCut(最小割),来最大化 ansansans(答案)。...原创 2018-04-18 20:03:21 · 377 阅读 · 3 评论 -
「BZOJ 1975」[SDOI2010]魔法猪学院
Description求 kkk 短路,最短路+可持久化可并堆,O(mlogm+klogk+nlogm)O(mlogm+klogk+nlogm)O(m\log m + k \log k + n\log m)。 又是一道论文题。#include &lt;cstdio&gt;#include &lt;cstring&gt;#include &lt;algorithm&gt;...原创 2018-04-26 15:45:29 · 317 阅读 · 0 评论 -
「Codeforces 632F」Magic Matrix
称一个矩阵为魔法矩阵,当且仅当满足一下三点: 1. ∀1≤i,j≤n,ai,j=aj,i∀1≤i,j≤n,ai,j=aj,i\forall 1 \le i,j \le n, a_{i,j}=a_{j,i} 2. ∀1≤i≤n,ai,i=0∀1≤i≤n,ai,i=0\forall 1 \le i \le n, a_{i,i} = 0 3. ∀1≤i,j,k≤n,ai,j≥ma...原创 2018-09-14 21:50:58 · 589 阅读 · 0 评论