图论
文章平均质量分 88
___fouzhe
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #400 (Div. 1 + Div. 2, combined) D. The Door Problem(二分染色?/2-sat,好题)
题目链接D. The Door Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoriarty has trapped n people i原创 2017-02-24 20:57:46 · 527 阅读 · 0 评论 -
hdu 5952Counting Cliques(暴搜)
题目链接Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1371 Accepted Submission(s): 527Problem Description原创 2016-12-18 22:15:38 · 283 阅读 · 0 评论 -
交通规划(spfa,路径记录,有个坑)
问题描述试题编号:201612-4试题名称:交通规划时间限制:1.0s内存限制:256.0MB问题描述:问题描述 G国国王来中国参观后,被中国的高速铁路深深的震撼,决定为自己的国家也建设一个高速铁路系统。 建设高速铁路投入非常大,为了节约建设成本,G国国王决定原创 2016-12-14 00:00:40 · 480 阅读 · 0 评论 -
Codeforces Round #372 (Div. 1) D. Complete The Graph(最短路,想法题,好题)
D. Complete The Graphtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder has drawn an undirected原创 2016-10-31 00:12:46 · 311 阅读 · 0 评论 -
poj 2230 Watchcow(欧拉回路)
题目链接WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 7537 Accepted: 3305 Special JudgeDescriptionBessie's been appointed the new watc原创 2016-10-05 17:38:31 · 248 阅读 · 0 评论 -
Codeforces Round #375 (Div. 2) E One-Way Reform(欧拉路径,好题)
题目链接E. One-Way Reformtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n cities and m two-way原创 2016-10-05 16:35:04 · 747 阅读 · 0 评论 -
hihocoder 1181欧拉路·二(求欧拉路Fleury(佛罗莱)算法)
题目链接#1181 : 欧拉路·二时间限制:10000ms单点时限:1000ms内存限制:256MB描述在上一回中小Hi和小Ho控制着主角收集了分散在各个木桥上的道具,这些道具其实是一块一块骨牌。主角继续往前走,面前出现了一座石桥,石桥的尽头有一道火焰墙,似乎无法通过。小Hi注意到在桥头有一张小原创 2016-10-05 15:55:50 · 818 阅读 · 0 评论 -
hihocoder 118周 网络流四·最小路径覆盖(二分匹配,好题)
题目链接时间限制:10000ms单点时限:1000ms内存限制:256MB描述国庆期间正是旅游和游玩的高峰期。小Hi和小Ho的学习小组为了研究课题,决定趁此机会派出若干个调查团去沿途查看一下H市内各个景点的游客情况。H市一共有N个旅游景点(编号1..N),由M条单向游览路线连接。在一个景点游览完后,可以顺着游览线路前往下一个景点。为了避免原创 2016-10-03 11:31:30 · 755 阅读 · 0 评论 -
SPOJ HIGH Highways(生成树计数,Matrix-Tree定理)
题目链接HighwaysTime Limit: 7000MS Memory Limit: 1572864KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionIn some countries building highways takes a l原创 2016-10-16 10:38:43 · 393 阅读 · 0 评论 -
bzoj1497: [NOI2006]最大获利(最大权闭合子图,最小割)
题目链接1497: [NOI2006]最大获利Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 4307 Solved: 2108[Submit][Status][Discuss]Description新的技术正冲击着手机通讯市场,对于各大运营商来说,这既是机遇,更是挑战。THU集团旗下的CS&T通讯公司在新一代通讯技术血原创 2016-09-22 11:18:54 · 1012 阅读 · 0 评论 -
UVA - 11613 Acme Corporation(任意流最小费用)
题目链接Problem IAcme CorporationInput: Standard InputOutput: Standard Output Wile E. Coyote is back. He is back in the business. The business of capturing the road runner. Being the most lo原创 2016-09-25 13:19:10 · 610 阅读 · 0 评论 -
uva 10779 Collectors Problem(最大流,好题)
题目链接训练指南上的一道题,P370,很好的一个建图。#include #include#include#includeusing namespace std;const int MAXN=45;const int MAXM=MAXN*MAXN;const int INF=0x3f3f3f3f;struct Node{ int from,to,next;原创 2016-09-20 20:06:32 · 358 阅读 · 0 评论 -
hdu 4635 Strongly connected(强联通分量+缩
题目链接Strongly connectedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2510 Accepted Submission(s): 1048Problem Description原创 2016-09-23 11:02:08 · 308 阅读 · 0 评论 -
gym100812G(想法题,最短路变形,好题)
题目链接G. Short Pathtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn my opinion, people are divided int原创 2017-02-18 09:09:45 · 640 阅读 · 0 评论 -
uvalive 7220(最短路)
题目链接Wijaya is a (self-proclaimed) hardcore gamer and also a talented programmer. His new game, DungeonTrap (DT), is scheduled to be published by next month. DT is a puzzle-like game and is built原创 2017-02-09 10:17:40 · 331 阅读 · 0 评论 -
uvalive 6528(DAG,递推,想法/bitset, 好题)
题目链接Nlogonia is a queendom that consists of several cities located on a big mountain. The capital cityis Logville, located on the mountain peak. Logville has a huge lake with a perfectly r原创 2017-02-09 19:55:57 · 303 阅读 · 0 评论 -
CROC 2016 - Final Round [Private, For Onsite Finalists Only] B(二分染色? 好题)
题目链接B. Graph Coloringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected graph原创 2017-02-24 19:28:06 · 652 阅读 · 0 评论 -
poj3522Slim Span(最小生成树性质)
题目链接Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7870 Accepted: 4191DescriptionGiven an undirected weighted graph G, you sho原创 2017-02-04 09:54:17 · 1278 阅读 · 1 评论 -
poj 3281 Dining(最大流)
题目链接DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15022 Accepted: 6812DescriptionCows are such finicky eaters. Each cow has a preference原创 2016-08-21 11:36:58 · 280 阅读 · 0 评论 -
Codeforces Round #379 (Div. 2)E. Anton and Tree(dfs缩点,想法题)
E. Anton and Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is growing a tree in his garden. In原创 2016-12-04 23:16:44 · 317 阅读 · 0 评论 -
Codeforces Alpha Round #21 D. Traveling Graph(欧拉路,floyed,dp,好题)
题目链接D. Traveling Graphtime limit per test0.5 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputYou are given undirected weighte原创 2017-02-22 11:59:47 · 313 阅读 · 0 评论 -
bzoj 1003: [ZJOI2006]物流运输(spfa+dp)
题目链接1003: [ZJOI2006]物流运输Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 7114 Solved: 2956[Submit][Status][Discuss]Description 物流公司要把一批货物从码头A运到码头B。由于货物量比较大,需要n天才能运完。货物运输过程中一般要转停好几个码原创 2017-01-23 12:25:57 · 336 阅读 · 0 评论 -
bzoj 1002: [FJOI2007]轮状病毒(生成树计数,高精度)
题目链接1002: [FJOI2007]轮状病毒Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 4816 Solved: 2628[Submit][Status][Discuss]Description 轮状病毒有很多变种,所有轮状病毒的变种都是从一个轮状基产生的。一个N轮状基由圆环上N个不同的基原子和圆心处一个原创 2017-01-22 17:22:26 · 713 阅读 · 0 评论 -
bzoj 1001: [BeiJing2006]狼抓兔子(s-t平面图求最大流)
题目链接1001: [BeiJing2006]狼抓兔子Time Limit: 15 Sec Memory Limit: 162 MBSubmit: 20242 Solved: 5037[Submit][Status][Discuss]Description现在小朋友们最喜欢的"喜羊羊与灰太狼",话说灰太狼抓羊不到,但抓兔子还是比较在行的,而且现在的兔子还比较原创 2017-01-22 10:50:10 · 546 阅读 · 0 评论 -
poj 3041 Asteroids(二分匹配,最小点覆盖)
题目链接AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20536 Accepted: 11145DescriptionBessie wants to navigate her spaceship through a da原创 2016-08-25 19:15:30 · 266 阅读 · 0 评论 -
poj 2253 Frogger(dijkstra变形,好题)
题目链接FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37972 Accepted: 12216DescriptionFreddy Frog is sitting on a stone in the middle of a原创 2016-08-25 18:54:37 · 328 阅读 · 0 评论 -
Codeforces Round #383 (Div. 2) E(贪心,二分图染色,好题)
题目链接E. Arpa’s overnight party and Mehrdad’s silent enteringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2017-02-20 11:55:18 · 534 阅读 · 0 评论 -
codeforces 717 G. Underfail(费用流,好题)
题目链接G. Underfailtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have recently fallen through a hole原创 2017-02-28 23:34:49 · 830 阅读 · 0 评论 -
uvalive 4080 Warfare And Logistics(最短路树)
题目链接Warfare And LogisticsTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVALive. Original ID: 408064-bit integer IO format: %lld Java class name: M原创 2016-09-19 23:40:13 · 348 阅读 · 0 评论 -
codevs 1021 玛丽卡(spfa路径记录,思维题)
题目链接1021 玛丽卡 时间限制: 2 s 空间限制: 128000 KB 题目等级 : 大师 Master题解题目描述 Description麦克找了个新女朋友,玛丽卡对他非常恼火并伺机报复。 因为她和他们不住在同一个城市,因原创 2016-09-06 20:40:27 · 1067 阅读 · 0 评论 -
poj3686 The Windy's(拆点,费用流,好题)
题目链接The Windy'sTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5031 Accepted: 2112DescriptionThe Windy's is a world famous toy factory that owns原创 2016-09-17 20:11:35 · 392 阅读 · 0 评论 -
poj 3169 Layout(差分约束)
题目链接LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10121 Accepted: 4870DescriptionLike everyone else, cows like to stand close to their f原创 2016-08-10 20:40:34 · 219 阅读 · 0 评论 -
poj 1679 The Unique MST(次小生成树模版)
题目链接The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27600 Accepted: 9881DescriptionGiven a connected undirected graph, tell if its原创 2016-08-22 21:40:32 · 253 阅读 · 0 评论 -
hdu 4370 0 or 1(将数学问题转化为最短路)
题目链接0 or 1Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1912 Accepted Submission(s): 575Problem DescriptionGiven a n*原创 2016-08-10 17:38:17 · 692 阅读 · 0 评论 -
poj 3026 Borg Maze(最小生成树)
题目链接Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13003 Accepted: 4250DescriptionThe Borg is an immensely powerful race of enhanced h原创 2016-08-10 15:57:50 · 278 阅读 · 0 评论 -
求割点模版
int dfs(int u,int fa) //u在dfs树中的父节点是fa { int lowu=pre[u]=++dfs_clock; int child=0; //子结点数目 for(int i=0;i<G[u].size();i++) { int v=G[u][i]; if(!pre[v])原创 2016-09-12 19:48:47 · 246 阅读 · 0 评论 -
poj 3680 Intervals(费用流)
题目链接IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7633 Accepted: 3201DescriptionYou are given N weighted open intervals. The ith inte原创 2016-08-21 09:21:11 · 539 阅读 · 0 评论 -
poj 3436 ACM Computer Factory(最大流)
题目链接ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7067 Accepted: 2497 Special JudgeDescriptionAs you know, all the com原创 2016-08-20 16:37:10 · 364 阅读 · 0 评论 -
hdu5876 Sparse Graph(补图最短路)
题目链接Sparse GraphTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 228 Accepted Submission(s): 81Problem DescriptionIn g原创 2016-09-10 21:16:04 · 838 阅读 · 0 评论 -
最小费用最大流(板子)
写最小费用最大流的时候比较容易忘的是添加一条边的费用时忘记将反向边的费用置为原来边的相反数。这一点要特别注意。邻接矩阵版本//************************************************************//最小费用最大流算法//SPFA求最短路//邻接矩阵形式//初始化:cap:容量,没有边为0//cost:耗费,对称形式,原创 2016-08-17 17:16:19 · 694 阅读 · 0 评论