图论
eva_can(not)survive
这个作者很懒,什么都没留下…
展开
-
P7368 [USACO05NOV]Asteroids G(k o¨ nig)
[USACO05NOV]Asteroids G - 洛谷https://www.luogu.com.cn/problem/P7368题目让我们求最小代价,我们可以考虑那些点在同一行和同一列得,所以我们可以将这些点行列连边,然后求最小点覆盖,走一遍匈牙利就好。...原创 2022-07-13 17:21:06 · 255 阅读 · 0 评论 -
P1407 [国家集训队]稳定婚姻
[国家集训队]稳定婚姻 - 洛谷https://www.luogu.com.cn/problem/P1407典型的二分图匹配问题,但这道题要先把正式夫妻先配对起来,先女后男,所以把男的都匹配上他们的老婆,然后再在有暧昧关系的两者之间建边,每次用匈牙利匹配的时候我们就可以把正房拆开,让他老婆去找有没有小三能跟她,如果有一个女的能找到被她抛弃的老公说明就可以起到连锁反应让他们都偷上情,当然匹配完后要把那一对夫妻重新绑定起来。...原创 2022-07-13 16:31:57 · 282 阅读 · 0 评论 -
Passable Paths (hard version)(LCA)
Problem - G2 - CodeforcesCodeforces. Programming competitions and contests, programming communityhttps://codeforces.com/contest/1702/problem/G2题意为给出一个树,再给出q个查询,每个查询给出树上点的子集,问这一串点能否构成树上的一个简单通路很明显这一题可以用LCA求解,首先我们要确定链的两端点,我们可以先求出最深的那个点,然后求另一个子树的最深节点,如果求不出另一个端原创 2022-07-11 14:26:51 · 267 阅读 · 0 评论 -
Codeforces Round #669 (Div. 2) E(dp+反向建边最短路)
Problem - E - CodeforcesCodeforces. Programming competitions and contests, programming communityhttps://codeforces.com/contest/1407/problem/E一道很有趣的最短路题,题意说明我们需要求没有最短路或如果必须有则求最长最短路。我们先考虑正向建边,如果求最短路的话我们需要有两种可能以0去求和以1去求,到最后我们无法确定该城市用的是白天还是黑夜,所以我们需要反向建边,这样我们就能原创 2022-07-07 22:34:41 · 108 阅读 · 0 评论 -
CF1609D Social Network(并查集)
Problem - 1609D - Codeforceshttps://codeforces.com/problemset/problem/1609/Dint pre[MAXN];int n, k;bool vis[MAXN];int sum[MAXN];inline void init() { for (int i = 1; i <= n; i++) { pre[i] = i; sum[i] = 1; }}int find(int x) { if (x == pr原创 2022-05-19 22:00:30 · 161 阅读 · 0 评论 -
P1613 跑路(倍增+最短路)
跑路 - 洛谷https://www.luogu.com.cn/problem/P1613#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include <原创 2022-05-05 17:48:14 · 191 阅读 · 0 评论 -
P4047 [JSOI2010]部落划分(kruskal)
P4047[JSOI2010]部落划分https://www.luogu.com.cn/problem/P4047#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>.原创 2022-04-30 15:43:55 · 345 阅读 · 0 评论 -
P3938 斐波那契(lca)
P3938斐波那契https://www.luogu.com.cn/problem/P3938#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include .原创 2022-04-30 13:52:22 · 197 阅读 · 0 评论 -
P2420 让我们异或吧(dfs)
让我们异或吧 - 洛谷https://www.luogu.com.cn/problem/P2420#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include原创 2022-04-30 10:44:37 · 142 阅读 · 0 评论 -
P1462 通往奥格瑞玛的道路(二分+dijkstra)
P1462通往奥格瑞玛的道路https://www.luogu.com.cn/problem/P1462一道很不错的题,考察了二分和最短路#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include ..原创 2022-04-29 21:57:58 · 375 阅读 · 0 评论 -
P3379 【模板】最近公共祖先(LCA)
【模板】最近公共祖先(LCA) - 洛谷https://www.luogu.com.cn/problem/P3379#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>原创 2022-04-29 20:38:45 · 149 阅读 · 0 评论 -
P2212 [USACO14MAR]Watering the Fields S(Prim)
[USACO14MAR]Watering the Fields S - 洛谷https://www.luogu.com.cn/problem/P2212#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#inclu原创 2022-04-26 23:28:37 · 82 阅读 · 0 评论 -
P1265 公路修建(Prim)
#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include <set>#include <unordered_map>#incl...原创 2022-04-26 21:51:29 · 167 阅读 · 0 评论 -
P2820 局域网(kruskal)
#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include <set>#include <unordered_map>#incl...原创 2022-04-26 21:06:56 · 187 阅读 · 0 评论 -
P2872 [USACO07DEC]Building Roads S(Kruskal)
[USACO07DEC]Building Roads S - 洛谷https://www.luogu.com.cn/problem/P2872#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include &l原创 2022-04-26 20:08:59 · 80 阅读 · 0 评论 -
P1546 [USACO3.1]最短网络 Agri-Net(Prim)
P1546[USACO3.1]最短网络 Agri-Nethttps://www.luogu.com.cn/problem/P1546#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <c..原创 2022-04-26 19:27:13 · 411 阅读 · 0 评论 -
P2330 [SCOI2005]繁忙的都市(Prim)
P2330[SCOI2005]繁忙的都市https://www.luogu.com.cn/problem/P2330#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>.原创 2022-04-26 18:53:18 · 185 阅读 · 0 评论 -
P3366 【模板】最小生成树(Prim or Kruskal)
【模板】最小生成树 - 洛谷https://www.luogu.com.cn/problem/P3366#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#incl原创 2022-04-26 13:47:00 · 147 阅读 · 1 评论 -
P5018 [NOIP2018 普及组] 对称二叉树
P5018[NOIP2018 普及组] 对称二叉树https://www.luogu.com.cn/problem/P5018#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstri.原创 2022-04-25 19:30:55 · 743 阅读 · 0 评论 -
P1364 医院设置(floyd or 重心转移)
P1364医院设置https://www.luogu.com.cn/problem/P1364#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include .原创 2022-04-24 21:56:58 · 239 阅读 · 0 评论 -
P3884 [JLOI2009]二叉树问题
[JLOI2009]二叉树问题 - 洛谷https://www.luogu.com.cn/problem/P3884#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>原创 2022-04-24 21:17:43 · 412 阅读 · 0 评论 -
P1229 遍历问题(二叉树先序后序)
P1229遍历问题https://www.luogu.com.cn/problem/P1229#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include .原创 2022-04-24 20:24:11 · 479 阅读 · 0 评论 -
P4913 【深基16.例3】二叉树深度
P4913【深基16.例3】二叉树深度https://www.luogu.com.cn/problem/P4913#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>.原创 2022-04-24 14:58:57 · 1298 阅读 · 0 评论 -
P4715 【深基16.例1】淘汰赛(完全二叉树)
#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include <set>#include <cmath>#include <...原创 2022-04-24 14:20:12 · 856 阅读 · 0 评论 -
ABC243 E-Edge Deletion (Floyd)
E - Edge Deletionhttps://atcoder.jp/contests/abc243/tasks/abc243_e#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cst原创 2022-04-18 21:50:56 · 149 阅读 · 0 评论 -
P5837 [USACO19DEC]Milk Pumping G(枚举+dijkstra)
P5837[USACO19DEC]Milk Pumping Ghttps://www.luogu.com.cn/problem/P5837#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <.原创 2022-04-18 20:55:01 · 184 阅读 · 0 评论 -
P6175 无向图的最小环问题(Floyd求最小环)
P6175无向图的最小环问题https://www.luogu.com.cn/problem/P6175#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#inc.原创 2022-04-18 20:52:27 · 153 阅读 · 0 评论 -
P6154 游走(拓扑排序+逆元+期望)
P6154游走https://www.luogu.com.cn/problem/P6154#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include &l.原创 2022-04-18 20:50:39 · 89 阅读 · 0 评论 -
P2888 [USACO07NOV]Cow Hurdles S(Floyd变形)
P2888[USACO07NOV]Cow Hurdles Shttps://www.luogu.com.cn/problem/P2888#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <.原创 2022-04-16 23:06:57 · 302 阅读 · 0 评论 -
CF173B Chamber of Secrets(bfs求最短路)
Chamber of Secrets - 洛谷https://www.luogu.com.cn/problem/CF173B#pragma warning(disable:4996) #include <iostream>#include <cstdio>#include <algorithm>#include <unordered_map>#include <queue>#include <string>#incl原创 2022-04-16 16:33:31 · 275 阅读 · 0 评论 -
P2136 拉近距离(spfa求最短路判负环)
拉近距离 - 洛谷https://www.luogu.com.cn/problem/P2136#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include &原创 2022-04-15 21:55:30 · 267 阅读 · 0 评论 -
P1744 采购特价商品(dijkstra单源最短路)
P1744采购特价商品https://www.luogu.com.cn/problem/P1744#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#includ.原创 2022-04-15 21:26:11 · 239 阅读 · 0 评论 -
P2648 赚钱(spfa||Floyd求最长路判断负环)
P2648赚钱https://www.luogu.com.cn/problem/P2648#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include &l.原创 2022-04-15 00:03:43 · 240 阅读 · 0 评论 -
P1144 最短路计数(bfs or spfa)
最短路计数 - 洛谷https://www.luogu.com.cn/problem/P1144#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#inclu.原创 2022-04-14 21:14:13 · 148 阅读 · 0 评论 -
P3385 【模板】负环
【模板】负环 - 洛谷https://www.luogu.com.cn/problem/P3385#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include原创 2022-04-14 18:20:36 · 166 阅读 · 0 评论 -
P1807 最长路(spfa||拓扑排序||广搜)
最长路 - 洛谷https://www.luogu.com.cn/problem/P1807#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include &l原创 2022-04-13 14:27:58 · 88 阅读 · 0 评论 -
P2419 [USACO08JAN]Cow Contest S(Floyd)
P2419[USACO08JAN]Cow Contest Shttps://www.luogu.com.cn/problem/P2419#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <.原创 2022-04-13 19:51:03 · 191 阅读 · 0 评论 -
P1960 郁闷的记者(拓扑排序)
P1960郁闷的记者https://www.luogu.com.cn/problem/P1960#include <iostream>#include <cstdio>#include <queue>#include <algorithm>using namespace std;const int MAXN=1e6+10;int n,m;int cnt;int in[MAXN];int ver[MAXN];int head[MAX.原创 2022-04-13 16:46:34 · 193 阅读 · 0 评论 -
P2712 摄像头(拓扑排序)
出错了 - 洛谷https://www.luogu.com.cn/problem/P2712#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#include &l原创 2022-04-12 21:17:58 · 355 阅读 · 0 评论 -
P4017 最大食物链计数(拓扑排序)
P4017最大食物链计数https://www.luogu.com.cn/problem/P4017#include <iostream>#include <cstdio>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <cstring>#inclu.原创 2022-04-12 23:52:19 · 151 阅读 · 0 评论