图论
brambles-sea
起风了
展开
-
欧拉回路
欧拉回路:图G,若存在一条路,经过G中每条边有且仅有一次,称这条路为欧拉路,如果存在一条回路经过G每条边有且仅有一次,称这条回路为欧拉回路。具有欧拉回路的图成为欧拉图。判断欧拉路是否存在的方法有向图:有一个顶点出度大入度1,有一个顶点入度大出度1,其余都是出度=入度。无向图:只有两个顶点是奇数度,其余都是偶数度的;或者全为偶数判断欧拉回路是否存在的方法有向图:所有的顶点出度原创 2017-04-30 00:40:42 · 479 阅读 · 0 评论 -
tarjan算法
#2421. 「NOIP2015」信息传递内存限制:128 MiB时间限制:1000 ms标准输入输出题目类型:传统评测方式:文本比较上传者: 匿名提交提交记录统计讨论测试数据题目描述有 n nn 个同学(编号为 1 11 到 n nn)正在玩一个信息传递的游戏。在游戏里每人都有一个固定的信息传递对象,其中,编号为 i ii 的同学的信息传递对象是编号为 Ti T_iTi 的同学。游戏开始时...原创 2018-07-04 22:27:12 · 161 阅读 · 0 评论 -
hdu 3572 Task Schedule网络流_最大流判满流
Task ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10994 Accepted Submission(s): 3343Problem DescriptionOur geometry princess XMM h...原创 2018-04-13 01:08:31 · 197 阅读 · 0 评论 -
hdu 2732Leapin' Lizards
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3488 Accepted Submission(s): 1439Problem DescriptionYour platoon of wandering ...原创 2018-04-15 22:30:55 · 186 阅读 · 0 评论 -
Hdu 5512 Meeting (建图技巧 + 最短路)
MeetingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3813 Accepted Submission(s): 1226Problem DescriptionBessie and her原创 2017-10-14 19:19:41 · 276 阅读 · 0 评论 -
HDU 1598 find the most comfortable road
find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8072 Accepted Submission(s): 3394Problem Description原创 2017-10-11 01:06:23 · 137 阅读 · 0 评论 -
HDU 3938
PortalTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1796 Accepted Submission(s): 884Problem DescriptionZLGG found a magic theor原创 2017-10-11 00:44:02 · 242 阅读 · 0 评论 -
hdu 1245 Saving James Bond
Saving James BondTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3601 Accepted Submission(s): 769Problem DescriptionThis time let原创 2017-10-07 23:41:36 · 225 阅读 · 0 评论 -
HDU 1217 Arbitrage(最短路判断负环)
ArbitrageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8753 Accepted Submission(s): 4039Problem DescriptionArbitrage is the use原创 2017-10-07 18:16:17 · 239 阅读 · 0 评论 -
HDU 2066 一个人的旅行【最短路,多起点多终点,Dijkstra算法+spfa算法】
一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31420 Accepted Submission(s): 10804Problem Description 虽然草儿是个路痴(就是在杭电待了一年多,居然转载 2017-07-23 09:49:19 · 742 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛 Magical Girl Haze (分层图最短路)
题意:n个点,m条单向边,可以让k条边距离为0,求1到n的最短路。分层图最短路的裸题,拆成k+1层,表示已经消耗j次使边距离为0(0<=j<=k), 即每个点拆成k个点#include <bits/stdc++.h>using namespace std;#define MP(X, Y) make_pair(X, Y)#define PII pair<...原创 2018-09-05 20:37:34 · 165 阅读 · 0 评论