图论
文章平均质量分 80
图论区~
PushyTao
这个作者很懒,什么都没留下…
展开
-
ECNA 2013 部分题解 | 训练记录
0706 ECNA 2013 训练记录原创 2022-07-08 00:43:46 · 876 阅读 · 1 评论 -
APAC 2013 部分题解 | 训练记录
0704 APAC2013 训练记录原创 2022-07-08 00:27:19 · 440 阅读 · 0 评论 -
ECNA 2014 部分题解 | 训练记录0703
20220703 ECNA2013 训练记录原创 2022-07-08 00:12:40 · 439 阅读 · 0 评论 -
[CF Gym101196-I] Waif Until Dark 网络最大流
网络最大流原创 2022-07-02 00:26:59 · 200 阅读 · 0 评论 -
[洛谷 P3376] 网络最大流 | 模板 (Dinic算法) 入门
题目链接题目描述如题,给出一个网络图,以及其源点和汇点,求出其网络最大流。输入格式第一行包含四个正整数 nnn,mmm,sss,ttt,分别表示点的个数、有向边的个数、源点序号、汇点序号。接下来M行每行包含三个正整数 ui ,vi,wi ,表示第 i 条有向边从 ui 出发,到达 vi,边权为 wi即该边最大流量为 wi)。输出格式一行,包含一个正整数,即为该网络的最大流。输入输出样例4 5 4 34 2 304 3 202 3 202 1 301 3 4050样例输入输原创 2021-09-03 16:37:47 · 161 阅读 · 0 评论 -
[洛谷 P3376] 网络最大流 | 模板 Edmonds Karp(EK算法) 入门
题目链接题目描述如题,给出一个网络图,以及其源点和汇点,求出其网络最大流。输入格式第一行包含四个正整数 nnn,mmm,sss,ttt,分别表示点的个数、有向边的个数、源点序号、汇点序号。接下来M行每行包含三个正整数 ui ,vi,wi ,表示第 i 条有向边从 ui 出发,到达 vi,边权为 wi即该边最大流量为 wi)。输出格式一行,包含一个正整数,即为该网络的最大流。输入输出样例4 5 4 34 2 304 3 202 3 202 1 301 3 4050样例输入输原创 2021-08-31 17:16:31 · 193 阅读 · 5 评论 -
[洛谷 P3376] 网络最大流 | 模板 (ISAP 算法) 入门
题目链接题目描述如题,给出一个网络图,以及其源点和汇点,求出其网络最大流。输入格式第一行包含四个正整数 nnn,mmm,sss,ttt,分别表示点的个数、有向边的个数、源点序号、汇点序号。接下来M行每行包含三个正整数 ui ,vi,wi ,表示第 i 条有向边从 ui 出发,到达 vi,边权为 wi即该边最大流量为 wi)。输出格式一行,包含一个正整数,即为该网络的最大流。输入输出样例4 5 4 34 2 304 3 202 3 202 1 301 3 4050样例输入输原创 2021-09-04 11:40:03 · 128 阅读 · 2 评论 -
PTA 森森旅游 (30 分) | 堆优化迪杰斯特拉
6 11 31 2 3 51 3 8 42 4 4 63 1 8 61 3 10 82 3 2 83 4 5 33 5 10 73 3 2 34 6 10 125 6 10 63 4 5 2 5 1001 22 11 17881Code:typedef pair<long long, int> PII;int n, m, q;int head1[maxn], head2[maxn];ll dis1[maxn], dis2[maxn];s.原创 2022-04-15 23:09:47 · 523 阅读 · 0 评论 -
[ICPC 46th Shanghai] Life is a Game 克鲁斯卡尔重构树
题目链接题目大意:给定n个点,m条边,有q个询问每个点有一个(能量值)点权,每条边有一个边权m条边描述为u v w表示有一条u与v相连的边权为w的通路在每一次询问中,给定一个点x和现有的能量值k,每次只能是在当前能量值大于边权的时候到达另一个点,并获取这个点的能量值(路可以重复走),问最终能够获得多大的能量值思路:克鲁斯卡尔重构树在建立克鲁斯卡尔重构树的时候,会将边权化为点权来处理并建立成一个堆,而且原先的节点一定是重构树中的叶子节点,除了叶子节点之外的其他点都是原先的边权在克鲁斯卡尔重构原创 2022-04-10 17:54:12 · 489 阅读 · 0 评论 -
[leetcode] 2039. 网络空闲的时刻 | BFS
题目链接题意:给定一张n个点不含重边的无向图,点的编号从0开始到n-1,两点之间如果有连边,可以认为耗时为1秒1->n-1的点都需要向0号点发送消息(从第0秒开始)在0号收到消息之后,会回复消息;从第一秒开始,如果1->n-1号服务器经过patiennce[]时间都还没有收到回复的消息,那么就会重新发送请求的消息问最早的网络中没有消息传输的时间是什么时候思路:最早的没有消息传输的时间为所有点空闲的时间中最晚的那个时间节点bfs设一个点u到0号点的距离为dis,并且经过t秒后原创 2022-03-20 22:56:53 · 586 阅读 · 0 评论 -
[leetcode] 连接所有点的最小费用 -MST
题目链接最小生成树板子题可以用并查集实现,贪心排序边权代码有点套娃(class Solution {private: int fa[1007]; int cnt = 0; typedef pair<int, pair<int, int> > pir; void init() { for (int i = 0; i < 1007; i++) fa[i] = i; } int _find(int u)原创 2022-03-05 21:10:03 · 7998 阅读 · 0 评论 -
[2019 EC Final] Flow | 贪心 + 思维
One of Pang\textit{Pang}Pang research interests is the maximum flow problem.A directed graph G{G}G with n{n}n vertices is universe\textit{universe}universe if the following condition is satisfied:G{G}G is the union of k{k}k vertex-independent simple path原创 2021-11-16 15:37:42 · 186 阅读 · 0 评论 -
[POJ 3683] Priest John‘s Busiest Day | 2-SAT +Tarjan缩点跑拓扑排序
DescriptionJohn is the only priest in his town. September 1st is the John’s busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forever blessed by the God of Love. This year N couples plan t原创 2021-11-08 20:31:09 · 153 阅读 · 0 评论 -
[POJ3678] Katu Puzzle | 2-SAT 入门
DescriptionKatu Puzzle is presented as a directed graph G(V,E)G(V, E)G(V,E) with each edge e(a,b)e(a, b)e(a,b) labeled by a boolean operator op (oneofAND,OR,XOR)(one of AND, OR, XOR)(oneofAND,OR,XOR) and an integer c(0≤c≤1)c (0 ≤ c ≤ 1)c(0≤c≤1). One Katu原创 2021-11-07 12:46:17 · 163 阅读 · 0 评论 -
[SDUT 2414] | 山东省第三届省赛 An interesting game | 最小费用最大流
评测地址题目描述Xiao Ming recently designs a little game, in front of player there are N small hillsides put in order, now Xiao Ming wants to increase some hillsides to block the player, so he prepared another M hillsides, but he does not hope it will be too dif原创 2021-10-30 21:52:56 · 134 阅读 · 0 评论 -
[POJ 1236] Network of Schools | Tarjan缩点
DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “receiving schools”). Note that if B is in the distributi原创 2021-10-30 21:39:29 · 156 阅读 · 1 评论 -
[UVA1364 | POJ | NC]Knights of the Round Table | Tarjan 求点双 | 二分图 | 综合图论
评测地址:网址1网址2题目描述:题意:给出n位骑士,然后有m个关系,每个关系以格式:a ba\ ba b给出,表达骑士aaa不能和bbb相邻,问要想使得最多的奇数个骑士在一起围成一圈,要剔除多少人solution:一. part1 : 首先解决这道题要用到的知识点:1. 建立补图2. Tarjan求解点双连通分量(V-DCC)并记录3. 奇环4. 二分图的判定(二分图染色)二. part2 概念解析:所谓补图,就是将原图中连着的边去掉,而将原来没有连的边原创 2021-10-26 00:15:04 · 178 阅读 · 0 评论 -
[POJ] John‘s trip | 欧拉回路 | 边序列字典序最小 + 建图
DescriptionLittle Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wanted to visit all his friends, but there was many of them. In each street he had one friend. He started thinking how to make his trip as short a原创 2021-10-25 15:43:01 · 164 阅读 · 0 评论 -
[POJ | Nowcoder] Watchcow | 欧拉回路 点路径输出
DescriptionBessie’s been appointed the new watch-cow for the farm. Every night, it’s her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes her patrol, and then returns to the barn when she’s done原创 2021-10-24 20:14:54 · 136 阅读 · 0 评论 -
[UPC | 山东省赛] The Largest SCC | Tarjan强连通分量瞎搞 + 状态还原
题目描述Consider a directed graph with N (1 <= N <= 1000) vertices and M (0 <=M <= 20000) edges. The edges are numbered from 1 to M and the vertices are numbered from 1 to N. Now I will make ONE edge bidirectional, and you are to tell me the numbe原创 2021-10-23 16:08:37 · 130 阅读 · 0 评论 -
[Nowcoder] network | Tarjan 边双连通分量 | 缩点 | LCA倍增优化 | 并查集
题目链接链接:https://ac.nowcoder.com/acm/contest/1060/B?&headNav=acm来源:牛客网题目描述A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or ind原创 2021-10-21 00:47:16 · 213 阅读 · 0 评论 -
[Luogu] 炸铁路 | Tarjan 割边
题目描述A 国派出将军uim,对 B 国进行战略性措施,以解救涂炭的生灵。B 国有 nn 个城市,这些城市以铁路相连。任意两个城市都可以通过铁路直接或者间接到达。uim 发现有些铁路被毁坏之后,某两个城市无法互相通过铁路到达。这样的铁路就被称为 key road。uim 为了尽快使该国的物流系统瘫痪,希望炸毁铁路,以达到存在某两个城市无法互相通过铁路到达的效果。然而,只有一发炮弹(A 国国会不给钱了)。所以,他能轰炸哪一条铁路呢?输入格式第一行 (1≤n≤1501 \leq n\leq 150原创 2021-10-19 20:14:34 · 119 阅读 · 0 评论 -
[HDU 4738] Caocao‘s Bridges | Tarjan 求割边
Problem DescriptionCaocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea. He built many islands in the Changjiang river, and based原创 2021-10-18 21:15:01 · 188 阅读 · 0 评论 -
[UVA 1599] Ideal Path | 细节最短路
DescriptionNew labyrinth attraction is open in New Lostland amusement park. The labyrinth consists of n rooms connected by m passages. Each passage is colored into some color ci . Visitors of the labyrinth are dropped from the helicopter to the room numbe原创 2021-10-13 09:14:03 · 164 阅读 · 0 评论 -
[HDU 7136] Jumping Monkey | 并查集 | 逆向思维
Jumping MonkeyTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 747 Accepted Submission(s): 360Problem DescriptionThere is a tree with n nodes and n−1 edges that make all nodes connected. Each原创 2021-10-11 20:55:35 · 247 阅读 · 0 评论 -
[Atcoder ABC222] F - Expensive Expense | 妙用树的直径 | Dijkstra
Time Limit: 4 sec / Memory Limit: 1024 MBScore : 500 pointsProblem StatementThe Kingdom of AtCoder is composed of NNN towns and N−1N−1N−1 roads.The towns are labeled as Town 1, Town 2, …, Town N. Similarly, the roads are labeled as Road 1, Road 2, …, R原创 2021-10-10 23:28:07 · 309 阅读 · 0 评论 -
[计蒜客] ACM-ICPC 2018 南京赛区网络预赛 | 部分题解 | 线段树 + 线性筛 + 最短路
该场比赛链接本文目录E. AC Challenge题目描述输入样例输入样例输出提示题意:A. An Olympian Math ProblemG. Lpl and Energy-saving Lamps题目描述输入输出样例输入样例输出提示J. Nanjing Sum题目描述输入输出样例输入提示L. Magical Girl Haze题目描述输入输出样例输入样例输出题意:E. AC Challenge题目描述Dlsj is competing in a contest with n (0 < n原创 2021-10-06 19:32:49 · 647 阅读 · 2 评论 -
[P3074 | USACO13FEB] Milk Scheduling | SPFA最长路 | 超级源点 + 超级汇点
题目描述Farmer John’s N cows (1 <= N <= 10,000) are conveniently numbered 1…N.Each cow i takes T(i) units of time to milk. Unfortunately, some cows must be milked before others, owing to the layout of FJ’s barn. If cow A must be milked before cow B,原创 2021-10-06 11:40:54 · 188 阅读 · 0 评论 -
[UPC] 2021秋组队17
目录A Quality-Adjusted Life-YearB Gwen’s GiftC Forest for the TreesD H-IndexE Driving LanesF Treasure SpottingG Neighborhood WatchH Small ScheduleI Mr. Plow KingJ Rainbow Road RaceA Quality-Adjusted Life-Year签到B Gwen’s GiftC Forest for the Treesgcdcons原创 2021-10-03 20:43:18 · 236 阅读 · 0 评论 -
[Nowcoder] 有向无环图 | 拓扑排序简单应用
链接题目描述Bobo 有一个 n 个点,m 条边的有向无环图(即对于任意点 v,不存在从点 v 开始、点 v 结束的路径)。为了方便,点用 1,2,…,n1, 2, \dots, n1,2,…,n编号。设 count(x,y)\mathrm{count}(x, y)count(x,y) 表示点 x 到点 y 不同的路径数量(规定 count(x,x)=0\mathrm{count}(x, x) = 0count(x,x)=0,Bobo 想知道∑i=1n∑j=1ncount(i,j)⋅ai⋅bj\s原创 2021-09-30 13:00:56 · 156 阅读 · 0 评论 -
[Nowcoder / POJ2728] 最优比率生成树 | 二分 + prim
Nowcoder链接题目描述David the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his country to bring water to every village. Villages which are connected to his capital village will be w原创 2021-09-28 21:08:54 · 111 阅读 · 0 评论 -
[Nowcoder | UPC] 2021年度训练联盟热身训练赛第六场 Hopscotch | 最短路 bfs
题目描述There’s a new art installation in town, and it inspires you… to play a childish game. The art installation consists of a floor with an n×n matrix of square tiles. Each tile holds a single number from 1 to k. You want to play hopscotch on it. You want t原创 2021-09-14 15:58:03 · 219 阅读 · 0 评论 -
[CCPC] 2017秦皇岛H Prime Set | 二分图最大匹配 [据说是个金牌题]
题目链接 or 题目链接题目描述Given an array of n integers a1,a2,…,an, we say a set {i,j} is a prime set of the given array, if i≠j and ai+aj is prime.BaoBao has just found an array of n integers a1,a2,…,an in his pocket. He would like to select at most k prime set原创 2021-09-12 22:14:29 · 244 阅读 · 4 评论 -
[洛谷 P3381] 最小费用最大流 | 模板 Bellman-Ford寻找增广路 入门
题目链接题目描述给出一个包含 nnn 个点和 mmm 条边的有向图(下面称其为网络) G=(V,E)G=(V,E)G=(V,E),该网络上所有点分别编号为 1∼n1 \sim n1∼n,所有边分别编号为 1∼m1\sim m1∼m,其中该网络的源点为 sss,汇点为ttt,网络上的每条边 (u,v)(u,v)(u,v) 都有一个流量限制 w(u,v)w(u,v)w(u,v)和单位流量的费用 c(u,v)c(u,v)c(u,v)。你需要给每条边 (u,v)(u,v)(u,v) 确定一个流量 f(u,v)原创 2021-08-31 23:11:06 · 249 阅读 · 0 评论 -
[Nowcoder] Agamemnon‘s Odyssey | 树的直径
链接Agamemnon, the great king of Mycenae, was assembling his troops in Aulis to sail to the shores of Troy, when he had a vision of goddess Artemis. In this vision, Agamemnon found out that he had accidentally slain a deer that was sacred to Artemis, and no原创 2021-08-30 21:24:15 · 153 阅读 · 2 评论 -
[洛谷] [NOIP2018 提高组] 旅行 加强版 - 基环树 | DFS / Tarjan / topoSort
题目链接:https://www.luogu.com.cn/problem/P5049题目描述小 Y 是一个爱好旅行的 OIer。她来到 X 国,打算将各个城市都玩一遍。小Y了解到, X国的 n 个城市之间有 m 条双向道路。每条双向道路连接两个城市。 不存在两条连接同一对城市的道路,也不存在一条连接一个城市和它本身的道路。并且, 从任意一个城市出发,通过这些道路都可以到达任意一个其他城市。小 Y 只能通过这些 道路从一个城市前往另一个城市。小 Y 的旅行方案是这样的:任意选定一个城市作为起点,然后原创 2021-08-29 00:19:05 · 193 阅读 · 0 评论 -
Funny Car Racing - 最短路小技巧
DescriptionThere is a funny car racing in a city with njunctions and m directed roads.The funny part is: each road is open and closed periodically. Each road is associate with two integers (a,b), that means the road will be open for a seconds, then clos原创 2021-08-25 20:32:47 · 161 阅读 · 1 评论 -
2021杭电多校第三场-Road Discount-wqs二分+最小生成树
DescriptionThere are n cities in Byteland, labeled by 1 to n. The Transport Construction Authority of Byteland is planning to construct n−1 bidirectional roads among these cities such that every pair of different cities are connected by these roads direct原创 2021-08-04 23:44:24 · 3775 阅读 · 0 评论 -
2021年暑假康复性训练(Codeforces Round #731 (Div. 3))全题解
2021暑假康复性训练Codeforces Round #731 (Div. 3)A Shortest Path with ObstacleB. Alphabetical StringsC. Pair ProgrammingD. Co-growing SequenceE. Air ConditionersF. Array Stabilization (GCD version)G. How Many Paths?Codeforces Round #731 (Div. 3)A Shortest Path w原创 2021-07-14 14:51:18 · 324 阅读 · 1 评论 -
UPC-2021个人训练赛第20场-部分题解
目录RGB Triplets题目描述输入输出样例输入 Copy样例输出 Copy提示Select Half题目描述输入输出样例输入 Copy样例输出 Copy提示心灵的抚慰题目描述输入输出样例输入 Copy样例输出 Copy提示RGB Triplets题目描述We have a string S of length N consisting of R, G, and B.Find the number of triples (i, j, k) (1≤i<j<k≤N) that satis原创 2021-06-13 12:48:19 · 686 阅读 · 0 评论