——————图论算法——————
等我学会后缀自动机
侠影之谜
展开
-
HDU 3938 Portal(并查集构建MST+离线处理)*
PortalTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2063 Accepted Submission(s): 1008 Problem DescriptionZLGG found a magic theory ...原创 2018-08-30 21:41:47 · 149 阅读 · 0 评论 -
HDU 5876 Sparse Graph (DFS+补图)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5876#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll uns...原创 2019-02-07 21:29:59 · 213 阅读 · 0 评论 -
HDU 4081 Qin Shi Huang's National Road System (最小生成树+DFS)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4081#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll uns...原创 2019-02-08 00:47:56 · 172 阅读 · 0 评论 -
HDU 5438 Ponds (拓扑排序+DFS)
题目链接:acm.hdu.edu.cn/showproblem.php?pid=5438#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll unsigned l...原创 2019-02-08 00:51:56 · 151 阅读 · 0 评论 -
Gym 101128A Promotions (拓扑序性质+DFS标记)
题目链接:http://codeforces.com/gym/101128/attachments#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll unsig...原创 2019-02-09 21:08:09 · 176 阅读 · 0 评论 -
ZOJ 1734 Power Network (EK算法 模板题)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1734题目大意:电力发电与传输问题。若干个发电站与若干个消费点。题目分析: 初学EK算法,模板提。不断的按bfs层次去收集流量。寻找增广路径的方法不确定导致时间复杂度不确定。#include<bits/stdc++.h>...原创 2019-02-22 16:27:51 · 147 阅读 · 0 评论 -
ZOJ 1734 Power Network (ISAP算法)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1734#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x...原创 2019-02-24 00:00:58 · 156 阅读 · 0 评论 -
ZOJ 2404 Going Home (最小费用最大流模板题)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2404模板题:#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<...原创 2019-03-01 07:19:38 · 198 阅读 · 0 评论 -
Codeforces Round #541 (Div. 2) D. Gourmet choice(DFS+并查集缩点)
题目链接:http://codeforces.com/contest/1131/problem/D题目大意题目背景没仔细看,大体意思就是有n*m的矩阵,然后(i,j)的符号代表第一类食物的i个和第二类食物的j个的大小关系。问是否存在满足这个矩阵关系的食物,如果存在则构造出来。题目分析思想:用Dp思想,首先是根据偏序关系来建图,用小的自底向上去更新大的,自顶向下我没...原创 2019-03-05 18:28:59 · 113 阅读 · 0 评论 -
HDU 4560 我是歌手 (网络流+拆点+二分)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4560题目大意有n个歌手,m种歌曲,每一场演唱会中约束描述如下:每一场演唱会中每个歌手都要上台,每个歌手都有其擅长曲目,一个歌曲全程被不擅长的歌手演唱的次数不超过k,问最多可以半多少场演唱会。题目分析不难发现题目中的答案隐含二分性质,演唱会场数越多其出错的可能性会越大。...原创 2019-03-03 11:32:54 · 384 阅读 · 0 评论 -
Codeforces Round #541 (Div. 2)F. Asya And Kittens(启发式合并+并查集+构造)
题目链接:http://codeforces.com/contest/1131/problem/F题目大意给定n个操作,其意义是把两个线段区间合并成一个,现在要构造一种排列使得这些操作合法。题目分析我们可以用并查集来表示一个已经归为一种类型的区间,那么对于下一种操作x,y我们可以用vector数组来模拟合并并更新并查集,出于时间复杂度考虑肯定是把小的并到大的上,启发式...原创 2019-03-06 22:26:21 · 268 阅读 · 0 评论 -
HDU 1272 小希的迷宫 (并查集+连通性)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1272#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2019-02-05 21:59:49 · 807 阅读 · 0 评论 -
ZOJ 1914 Arcitc Network(最小生成树+连通性质)
#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long long#define lrt int l,int r,int rt#define lson l...原创 2019-02-02 22:54:33 · 212 阅读 · 0 评论 -
HDU 6071 Lazy Running (同余最短路)
题目链接:http://acm.hdu.edu.cn/search.php?action=listproblem#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define r...原创 2018-10-10 23:22:17 · 154 阅读 · 0 评论 -
HDU 4661 Message Passing (树形DP+组合数学知识+拓扑排序计数思维)*
Message PassingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1461 Accepted Submission(s): 541 Problem DescriptionThere are n peo...原创 2018-08-29 17:58:31 · 368 阅读 · 0 评论 -
UVA 10798 Be wary of Roses (BFS+几何状态对称)*
题目链接:https://cn.vjudge.net/problem/UVA-10798#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) ...原创 2018-09-08 06:28:51 · 247 阅读 · 0 评论 -
HDU 5521 Meeting (最短路+含有团的差分约束)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5521#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(...原创 2018-09-06 23:44:03 · 91 阅读 · 0 评论 -
UVA 1569 Multiple (最短路+同余性质约束)
题目链接:https://cn.vjudge.net/problem/UVA-1569#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) fo...原创 2018-09-07 11:07:21 · 170 阅读 · 0 评论 -
HDU - 4640 Island and study-sister (状压DP+背包+最短路)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4640#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-11 17:11:33 · 621 阅读 · 0 评论 -
HDU 5418 Victor and World (状压DP+FLoyd)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5418#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-28 07:32:35 · 202 阅读 · 0 评论 -
HDU 5433 Xiao Ming Climbing (DIjksta最短路+细节)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5433#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-07 12:56:57 · 158 阅读 · 0 评论 -
HDU 5441 Travel (生成树+并查集)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5441#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-30 01:35:36 · 100 阅读 · 0 评论 -
UVA 11367 Full Tank? (Dijkstra 变种)
题目链接:https://cn.vjudge.net/problem/UVA-11367#include<bits/stdc++.h>//#include<iostream>//#include<queue>//#include<cstring>//#include<cstdio>using namespace std;...原创 2018-10-09 22:27:17 · 213 阅读 · 0 评论 -
UVA 11280 Flying to Fredericton (Dijkstra变种)
题目链接:https://cn.vjudge.net/problem/UVA-11280#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x,y) sca...原创 2018-10-10 00:38:39 · 135 阅读 · 0 评论 -
POJ 1149 PIGS (网络流建模思维+好题)*
题目链接:http://poj.org/problem?id=1149题目大意题目意思有些鬼畜我感觉,大体意思就是:有个访客序列,每个访客可以打开指定的猪圈序列,然后对于当前已经打开的猪圈其猪的个数可以任意分配,每个访客固定要拿走指定头猪,问最多可以有多少头猪可以被拿走。题目分析网络流建模问题,增加源点指向猪圈,这道题建模的关键在于是选择选取猪圈为点还是访客,如...原创 2019-03-11 20:45:22 · 159 阅读 · 0 评论