2018年09月_hahahahhahello

原创 HDU - 5521 Meeting (巧妙建图+最短路)

MeetingTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 5241 Accepted Submission(s): 1647Problem DescriptionBessie and her friend Els...

2018-09-28 20:44:07 215

原创 Gym - 100851F Froggy Ford (Dijkstra)

题目链接：https://cn.vjudge.net/problem/Gym-100851F这道题是POJ-2253的升级版：https://blog.csdn.net/GYH0730/article/details/77510915在POJ2253的基础上要加上一个点，显然这个点要加在两点的中点处，提前预处理出任意一点到S，到T的所有路径上最大边的最小值，然后我们可以枚举所有的边，答案为...

2018-09-27 14:50:35 379

原创 POJ - 3228 Gold Transportation（二分+最大流或最小生成树）

Gold TransportationTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 3661 Accepted: 1305 DescriptionRecently, a number of gold mines have been discovered in Zorromin...

2018-09-25 21:12:03 266

原创 HDU - 5130 Signal Interference（计算几何—圆与多边形的面积交）

Signal InterferenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2500 Accepted Submission(s): 1260Special JudgeProblem DescriptionTw...

2018-09-25 18:46:09 256

原创 HDU - 5441 Travel （Kruskal+离线）

TravelTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4874 Accepted Submission(s): 1574Problem DescriptionJack likes to travel around ...

2018-09-24 22:08:33 157

原创 HDU - 5128 The E-pang Palace(计算几何+暴力）

The E-pang PalaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 4351 Accepted Submission(s): 2345Problem DescriptionE-pang Palace was...

2018-09-24 21:19:23 365

原创 HDU 4085 Peach Blossom Spring(斯坦纳树＋dp)

Peach Blossom SpringTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3081 Accepted Submission(s): 1208Problem DescriptionTao Yuanmin...

2018-09-24 10:57:57 362

原创 HDU - 3311 Dig The Wells （斯坦纳树）

Dig The WellsTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1579 Accepted Submission(s): 706Problem DescriptionYou may all know the fa...

2018-09-24 10:53:37 273

原创 HDU 4081 Qin Shi Huang's National Road System （次小生成树）

Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10189 Accepted Submission(s): 3605Problem Description...

2018-09-24 10:42:45 149

原创 UVA - 11354 Bond （最小生成树+朴素LCA）

题目链接：https://vjudge.net/problem/UVA-11354题意：给出一张图，q个询问，每次询问给出uv，找出一条路径，使这条路径上的最大边权是两点所有路径中最小，输出这个值思路：很显然要先求出最小生成树，任意两点在最小生成树上有唯一路径，并且这条路径上的最大边权就是所输出的值，接下来就是如何求出树上任意两点唯一路径中的最大边权了，先把最小生成树转化为有根树，并用f...

2018-09-24 10:14:23 224

原创 HDU 5952 Counting Cliques（暴搜）

Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4066 Accepted Submission(s): 1439Problem DescriptionA clique is a comple...

2018-09-23 16:41:15 165

原创 HDU - 3986 Harry Potter and the Final Battle(最短路Dij）

Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4268 Accepted Submission(s): 1290Problem DescriptionThe...

2018-09-22 20:28:31 261

原创 STL中有用的函数

去掉string的最后一个字符s.pop_back();s.pop_back();s=s.substr(0,s.length()-1);

2018-09-22 19:42:10 186

原创 ACM-ICPC 2018 北京赛区网络预赛 Tomb Raider（暴力）

时间限制:1000ms单点时限:1000ms内存限制:256MB描述Lara Croft, the fiercely independent daughter of a missing adventurer, must push herself beyond her limits when she discovers the island where her father disa...

2018-09-22 19:39:29 485

原创 HDU 3072 Intelligence System（强联通缩点+树形图）

Intelligence SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3359 Accepted Submission(s): 1475Problem DescriptionAfter a day, ALP...

2018-09-22 09:43:34 153

原创 POJ 3164 最小树形图（朱刘算法）

Command NetworkTime Limit: 1000MS Memory Limit: 131072K Total Submissions: 20151 Accepted: 5792 DescriptionAfter a long lasting war on words, a war on arms finally breaks out b...

2018-09-22 09:33:00 230

原创 HDU - 4810 Wall Painting（组合数学+枚举）

Wall PaintingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3978 Accepted Submission(s): 1317Problem DescriptionMs.Fang loves painting...

2018-09-21 20:16:33 257

原创 HDU - 4404 Worms （计算几何—圆与多边形的面积交）

WormsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 704 Accepted Submission(s): 391Problem DescriptionWorms is a series of turn-based c...

2018-09-21 19:52:20 348

原创 HDU 4408 Minimum Spanning Tree（最小生成树计数）

Minimum Spanning TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2341 Accepted Submission(s): 779Problem DescriptionXXX is very int...

2018-09-20 08:17:58 205

原创 HDU - 5971 Wrestling Match （种类并查集）

Wrestling MatchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3367 Accepted Submission(s): 1210Problem DescriptionNowadays, at least o...

2018-09-18 21:18:24 314

原创 HDU - 4998 Rotate （计算几何—绕点旋转）

RotateTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1467 Accepted Submission(s): 642Special JudgeProblem DescriptionNoting is more in...

2018-09-18 20:58:15 424

原创 DAG最小路径覆盖

参考博客：https://www.cnblogs.com/justPassBy/p/5369930.htmlDAG的最小路径覆盖定义：在一个有向图中，找出最少的路径，使得这些路径经过了所有的点。最小路径覆盖分为最小不相交路径覆盖和最小可相交路径覆盖。最小不相交路径覆盖：每一条路径经过的顶点各不相同。如图，其最小路径覆盖数为3。即1->3>4，2，5。最小可相交路径覆...

2018-09-17 14:40:46 508

原创 UVA - 1416 Warfare And Logistics ( 最短路树）

题目链接:https://cn.vjudge.net/problem/UVA-1416c比较容易求，cc如果一条边一条边枚举的话，每删除一条边，就要再求一遍任意两点的最短路，无论是跑一遍floyd或n-1遍dij时间复杂度都很大，我们可以用最短路树来优化一下，只有删除最短路树上的边，我们再重新求最短路，删除不是最短路树上的边，任意两点的最短路是不变的，这样时间复杂度就降了下来，因为每一个源点的...

2018-09-17 12:25:59 324

原创 ACM-ICPC 2018 焦作赛区网络预赛 H. String and Times （后缀自动机&后缀数组）

Now you have a string consists of uppercase letters, two integers AA and BB. We call a substring wonderful substring when the times it appears in that string is between AA and BB (A \le times \le BA≤t...

2018-09-15 18:49:54 522

原创 HDU - 3836 Equivalent Sets（强连通缩点）

Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 6145 Accepted Submission(s): 2202Problem DescriptionTo prove two sets...

2018-09-14 21:41:17 155

原创 HDU - 4179 Difficult Routes(带有限制的最短路)

Difficult RoutesTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1284 Accepted Submission(s): 280Problem DescriptionIn preparation for t...

2018-09-14 20:56:46 321

原创 Gym - 101128A Promotions （思维+DFS+反向图）

题目链接：https://vjudge.net/problem/Gym-101128A一看到这个题就想到了拓扑排序，暴搜出所有的拓扑序列，求出所有拓扑序列前A个数的交集，前B个数的交集，后n-B个数的交集，我无脑暴搜了一发，T，然后加了个set优化找拓扑序列的过程，又T，才明白所有的拓扑序列太多了，暴搜肯定T，又想我们只需要找出每个数在所有拓扑序列中最早出现的位置和最晚出现的位置，最早出现的位...

2018-09-14 19:52:47 182

原创 HDU 6215 Brute Force Sorting（双向链表+队列）

Brute Force SortingTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2304 Accepted Submission(s): 539Problem DescriptionBeerus needs to s...

2018-09-13 16:06:36 246

原创 HDU 6214 Smallest Minimum Cut (最小割中的最小割边）

Smallest Minimum CutTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2420 Accepted Submission(s): 973Problem DescriptionConsider a netwo...

2018-09-13 14:29:59 166

原创 HDU - 3873 Invade the Mars (带有限制的最短路）

Invade the MarsTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 365768/165536 K (Java/Others)Total Submission(s): 2695 Accepted Submission(s): 775Problem DescriptionIt's now the year 2...

2018-09-12 15:35:06 265

原创 POJ 2186 Popular Cows（强联通分量缩点）

Popular CowsTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 40402 Accepted: 16448 DescriptionEvery cow's dream is to become the most popular cow in the herd. In a he...

2018-09-12 11:11:09 140

原创网络流24题——试题库问题

【问题分析】二分图多重匹配问题，用最大流解决。【建模方法】建立二分图，每个题为X集合中的顶点，每个类别为Y集合中的顶点，增设附加源S和汇T。1、从S向每个Xi连接一条容量为1的有向边。2、从每个Yi向T连接一条容量为该类别所需数量的有向边。3、如果一个题i属于一个类别j，连接一条从Xj到Yi容量为1的有向边。求网络最大流，如果最大流量等于所有类别所需之和，则存在解，否则无解...

2018-09-12 09:48:11 236

原创网络流24题——魔术球问题

题目链接：https://www.luogu.org/problemnew/show/P2765【问题分析】枚举答案转化为判定性问题，然后最小路径覆盖，可以转化成二分图最大匹配，从而用最大流解决。【建模方法】枚举答案A，在图中建立节点1..A。如果对于i<j有i+j为一个完全平方数，连接一条有向边(i,j)。该图是有向无环图，求最小路径覆盖。如果刚好满足最小路径覆盖数等于N，...

2018-09-12 09:41:40 163

原创网络流24题—— 最长不下降子序列问题

题目链接：https://www.luogu.org/problemnew/show/P2766【问题分析】第一问时LIS，动态规划求解，第二问和第三问用网络最大流解决。【建模方法】首先动态规划求出F[i]，表示以第i位为开头的最长上升序列的长度，求出最长上升序列长度K。1、把序列每位i拆成两个点<i.a>和<i.b>，从<i.a>到<...

2018-09-11 21:51:43 177

原创网络流24题——圆桌问题

题目链接：https://www.luogu.org/problemnew/show/P3254【问题分析】二分图多重匹配问题，可以用最大流解决。【建模方法】建立二分图，每个单位为X集合中的顶点，每个餐桌为Y集合中的顶点，增设附加源S和汇T。1、从S向每个Xi顶点连接一条容量为该单位人数的有向边。2、从每个Yi顶点向T连接一条容量为该餐桌容量的有向边。3、X集合中每个顶点向...

2018-09-11 19:55:33 266

原创 ACM-ICPC 2018 徐州赛区网络预赛 J. Maze Designer（最大生成树+LCA）

After the long vacation, the maze designer master has to do his job. A tour company gives him a map which is a rectangle. The map consists of N×MN \times MN×M little squares. That is to say, the heigh...

2018-09-11 19:23:36 265

转载图论500题

mark mark=============================以下是最小生成树+并查集======================================【HDU】*1213 How Many Tables 基础并查集★*1272 小希的迷宫基础并查集★*1325&&po...

2018-09-11 16:50:06 270

原创 HDU3157 Crazy Circuits & BZOJ 2502 清理雪道（有下界最小流）

BZOJ上已经没有这道题了，uva1440和这道题类似，但要输出答案方法:1.新建源汇SS,TT,按有上下界的方法建图.2.做一次SS->TT的最大流.3.原图中的汇点T向原图中的源点S连一条inf的边.4.再做一次SS>TT的最大流就是答案.#include <bits/stdc++.h>using namespace std;const i...

2018-09-11 15:53:52 171

原创 ZOJ 3229 Shoot the Bullet(有源汇上下界网络流)

Shoot the BulletTime Limit: 2 Seconds Memory Limit: 32768 KB Special JudgeGensokyo is a world which exists quietly beside ours, separated by a mystical border. It is a utopia where hum...

2018-09-11 13:39:00 179

原创 ZOJ - 2314 Reactor Cooling （无源汇上下界网络流）

Reactor CoolingTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeThe terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reactor to ...

2018-09-10 16:45:52 154

空空如也

空空如也