图论
Thinking knife
I am a zufer。
展开
-
lca
#include<bits/stdc++.h>#define INF 0x3f3f3f3f#define ll long long#define endl '\n'#define PB push_back#define lson rt << 1, l, mid#define rson rt << 1 | 1, mid + 1, r#define l...原创 2020-02-16 17:00:16 · 110 阅读 · 0 评论 -
P3384 【模板】树链剖分
题目描述如题,已知一棵包含N个结点的树(连通且无环),每个节点上包含一个数值,需要支持以下操作:操作1: 格式: 1 x y z 表示将树从x到y结点最短路径上所有节点的值都加上z操作2: 格式: 2 x y 表示求树从x到y结点最短路径上所有节点的值之和操作3: 格式: 3 x z 表示将以x为根节点的子树内所有节点值都加上z操作4: 格式: 4 x 表示求以x为根节点的子树内所有节点...原创 2019-12-04 21:19:51 · 102 阅读 · 0 评论 -
km算法带权二分图匹配
#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int MAXN = 305;const int INF = 0x3f3f3f3f;int E_val[MAXN][MAXN]; // 记录每条边的权值int L_val[MAXN]...转载 2019-11-21 21:29:45 · 173 阅读 · 0 评论 -
最小费用最大流模板(ek和dinic)
ek#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include<vec...翻译 2019-08-06 14:22:20 · 543 阅读 · 0 评论 -
2019杭电多校第三场Blow up the city (支配树)
建立支配树, deep[u]+deep[v]-deep[lca(u,v)]即为答案#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack&...原创 2019-08-15 17:02:00 · 178 阅读 · 0 评论 -
洛谷P2597 [ZJOI2012]灾难
#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include<string...原创 2019-08-15 17:03:05 · 122 阅读 · 0 评论 -
2018-2019 ACM-ICPC, 徐州 G. Rikka with Intersections of Paths(树上差分+lca+容斥)
树上差分求出一个点被几条边覆盖(num[i]), 然后容斥算贡献#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#incl...原创 2019-10-04 21:06:20 · 250 阅读 · 0 评论