POJ
关注
分享
扫一扫
文章平均质量分 84
阿阿阿阿_欢
勿忘初心
展开
-
POJ 2289--Jamie's Contact Groups【二分图多重匹配问题 &&二分查找最大值的最小化 && 最大流求解】
Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 6902 Accepted: 2261DescriptionJamie is a very popular girl and has quite a lot o原创 2015-08-27 10:20:03 · 1696 阅读 · 0 评论 -
HDU 4183--Pahom on Water【最大流dinic】
Pahom on WaterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 658 Accepted Submission(s): 302Problem DescriptionPahom on Water is原创 2015-08-06 20:17:29 · 514 阅读 · 0 评论 -
POJ 3281【拆点 && 最大流经典建图】
DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11097 Accepted: 5096DescriptionCows are such finicky eaters. Each cow has a preference for certa原创 2015-08-04 12:04:39 · 699 阅读 · 0 评论 -
POJ 3620--Avoid The Lakes【DFS】
Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6775 Accepted: 3620DescriptionFarmer John's farm was flooded in the most recent storm,原创 2015-08-04 16:11:43 · 598 阅读 · 0 评论 -
POJ 1458--Common Subsequence【LCS】
Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40871 Accepted: 16525DescriptionA subsequence of a given sequence is the given seque原创 2015-04-15 17:10:27 · 430 阅读 · 0 评论 -
POJ 2457--Part Acquisition 【spfa最短路 + STL路径输出】
Part AcquisitionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3954 Accepted: 1712 Special JudgeDescriptionThe cows have been sent on a mission t原创 2015-07-24 11:41:25 · 804 阅读 · 0 评论 -
POJ 1564--Sum It Up【DFS】
#include #include #include #include using namespace std;int n, m, flag;int a[11000], b[11000];int cmp(int a, int b){ return a > b;}void dfs(int pos , int ans, int sum){ if(sum == n){ fl原创 2015-08-05 09:51:52 · 739 阅读 · 0 评论 -
POJ 2631 -- Roads in the North【树的直径 && 裸题】
Roads in the NorthTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2358 Accepted: 1156DescriptionBuilding and maintaining roads among communities in th原创 2015-08-17 17:51:11 · 1673 阅读 · 0 评论 -
POJ 1985--Cow Marathon【树的直径 && 模板】
Cow MarathonTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 4182 Accepted: 2116Case Time Limit: 1000MSDescriptionAfter hearing about the epidemi原创 2015-08-17 17:36:38 · 889 阅读 · 0 评论 -
POJ 3080--Blue Jeans【KMP && 暴力枚举】
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14316 Accepted: 6374DescriptionThe Genographic Project is a research partnership between IBM原创 2015-08-17 22:02:57 · 715 阅读 · 0 评论 -
POJ 2367 -- Genealogical tree【拓扑排序 && 水题】
Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3656 Accepted: 2431 Special JudgeDescriptionThe system of Martians' blood relatio原创 2015-08-14 17:17:06 · 473 阅读 · 0 评论 -
POJ 1698--Alice's Chance【最大流 && 经典】
Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6384 Accepted: 2607DescriptionAlice, a charming girl, have been dreaming of being a movi原创 2015-08-27 15:11:47 · 827 阅读 · 0 评论 -
POJ 2455--Secret Milking Machine【二分枚举 && 最大流 && 经典】
Secret Milking MachineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10625 Accepted: 3111DescriptionFarmer John is constructing a new milking machine原创 2015-08-27 16:42:43 · 982 阅读 · 0 评论 -
POJ 3189--Steady Cow Assignment【二分图多重匹配 && 最大流求解 && 枚举 && 经典】
Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6023 Accepted: 2078DescriptionFarmer John's N (1 FJ would like to rearrange t原创 2015-08-27 13:10:10 · 987 阅读 · 0 评论 -
POJ 2513--Colored Sticks【字典树编号 && 并查集判连通 && 无向图欧拉路】
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 32351 Accepted: 8536DescriptionYou are given a bunch of wooden sticks. Each endpoint of原创 2015-07-30 21:33:59 · 624 阅读 · 0 评论 -
POJ 1966--Cable TV Network 【求无向图的点连通度 构造最大流模型 && dinic】
Cable TV NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4234 Accepted: 1989DescriptionThe interconnection of the relays in a cable TV network原创 2015-08-12 23:15:41 · 1075 阅读 · 0 评论 -
POJ 1611--The Suspects【并查集水题】
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 26908 Accepted: 13149DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu原创 2015-08-01 17:42:18 · 2201 阅读 · 0 评论 -
POJ 1346--King 【差分约束】
KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10994 Accepted: 4025DescriptionOnce, in one kingdom, there was a queen and that queen was expectin原创 2015-07-27 14:54:01 · 496 阅读 · 0 评论 -
POJ--Kaka's Matrix Travels【最大费用最大流 && 经典建图 && 好题】
Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8741 Accepted: 3504DescriptionOn an N × N chessboard with a non-negative number i原创 2015-08-28 13:04:22 · 970 阅读 · 0 评论 -
POJ 3687--Labeling Balls【拓扑排序 && 逆序拓扑 && 输出在拓扑排序中的位置】
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12251 Accepted: 3509DescriptionWindy has N balls of distinct weights from 1 unit to N un原创 2015-08-14 16:59:17 · 470 阅读 · 0 评论 -
POJ1847--Tram 【最短路spfa】
TramTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11606 Accepted: 4241DescriptionTram network in Zagreb consists of a number of intersections and ra原创 2015-07-24 21:48:42 · 491 阅读 · 0 评论 -
POJ 3177--Redundant Paths【无向图增加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10798 Accepted: 4626DescriptionIn order to get from one of the F (1 <= F <= 5,000) graz原创 2015-08-18 15:13:58 · 1163 阅读 · 0 评论 -
POJ 2762--Going from u to v or from v to u?【scc缩点新建图 && 判断是否是弱连通图】
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15755 Accepted: 4172DescriptionIn order to make their sons brave, Jia原创 2015-08-19 12:35:03 · 786 阅读 · 0 评论 -
POJ 2186 -- Popular Cows【强连通分支 && Tarjan缩点】
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27198 Accepted: 10963DescriptionEvery cow's dream is to become the most popular cow in the原创 2015-08-19 16:41:18 · 720 阅读 · 0 评论 -
POJ 3308--Paratroopers【 最小点权覆盖 && 最小割】
ParatroopersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7847 Accepted: 2365DescriptionIt is year 2500 A.D. and there is a terrible war between the f原创 2015-08-07 16:42:30 · 759 阅读 · 0 评论 -
POJ 1236--Network of Schools【scc缩点构图 && 求scc入度为0的个数 && 求最少加几条边使图变成强联通】
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13325 Accepted: 5328DescriptionA number of schools are connected to a computer netwo原创 2015-08-20 11:10:04 · 1189 阅读 · 0 评论 -
POJ 2553--The Bottom of a Graph【scc缩点构图 && 求出度为0的scc && 输出scc中的点】
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9575 Accepted: 3984DescriptionWe will use the following (standard) definitions fr原创 2015-08-20 09:20:38 · 715 阅读 · 0 评论 -
POJ 3126 --Father Christmas flymouse【scc缩点构图 && SPFA求最长路】
Father Christmas flymouseTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3007 Accepted: 1021DescriptionAfter retirement as contestant from WHU ACM原创 2015-08-20 18:02:34 · 932 阅读 · 1 评论 -
POJ 1125--Stockbroker Grapevine【多源最短路】
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31509 Accepted: 17254DescriptionStockbrokers are known to overreact to rumours. You原创 2015-09-25 12:54:33 · 377 阅读 · 0 评论 -
POJ 3592--Instantaneous Transference【SCC缩点新建图 && SPFA求最长路 && 经典】
Instantaneous TransferenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6177 Accepted: 1383DescriptionIt was long ago when we played the game Red Al原创 2015-08-21 14:10:53 · 1608 阅读 · 0 评论 -
POJ 2516--Minimum Cost【最小费用最大流 && 经典】
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 15041 Accepted: 5169DescriptionDearboy, a goods victualer, now comes to a big problem, and原创 2015-09-08 00:55:12 · 628 阅读 · 0 评论 -
POJ 3450--Corporate Identity【KMP && 枚举】
Corporate IdentityTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5696 Accepted: 2075DescriptionBeside other services, ACM helps companies to clearly原创 2015-08-18 08:26:22 · 1091 阅读 · 6 评论 -
POJ 2117--Electricity【点双联通 && 求删去一个点后，图最多有多少块连通】
ElectricityTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4589 Accepted: 1512DescriptionBlackouts and Dark Nights (also known as ACM++) is a company原创 2015-08-18 10:54:38 · 1283 阅读 · 0 评论 -
POJ 1087--A Plug for UNIX【最大流dinic】
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14711 Accepted: 4959DescriptionYou are in charge of setting up the press room for the i原创 2015-08-06 13:25:33 · 1005 阅读 · 0 评论 -
POJ 1383--Labyrinth【树的直径】
LabyrinthTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 3991 Accepted: 1502DescriptionThe northern part of the Pyramid contains a very large and comp原创 2015-08-17 18:21:25 · 904 阅读 · 1 评论 -
POJ 1149--PIGS 【最大流 && 处理重边 && 经典建模】
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18123 Accepted: 8246DescriptionMirko works on a pig farm that consists of M locked pig-houses and原创 2015-08-05 15:27:22 · 1199 阅读 · 0 评论 -
POJ 2112--Optimal Milking【二分找最大距离的最小值 && 最大流dinic】
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 13897 Accepted: 5018Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K原创 2015-08-05 17:54:53 · 607 阅读 · 0 评论 -
POJ 1144--Network 【无向图中割点总数】
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10764 Accepted: 4978DescriptionA Telephone Line Company (TLC) is establishing a new telephone c原创 2015-08-12 17:56:01 · 658 阅读 · 0 评论 -
POJ 3352--Road Construction【无向图增加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】
Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9986 Accepted: 4952DescriptionIt's almost summer time, and that means that it's almos原创 2015-08-18 16:40:26 · 781 阅读 · 0 评论 -
POJ 2135--Farm Tour【最小费用最大流 && 常规题】
Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13514 Accepted: 5128DescriptionWhen FJ's friends visit him on the farm, he likes to show them原创 2015-09-07 17:27:03 · 499 阅读 · 0 评论