网络流
junior19
abcde
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDU3549:Flow Problem(最大流 & Ek算法 + Dinic算法)
Flow Problem Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 15720 Accepted Submission(s): 7443 Problem Description Network flow原创 2017-05-09 15:55:37 · 355 阅读 · 0 评论 -
CF510E: Fox And Dinner(最大流)
E. Fox And Dinnertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is participating in a party in Prime Kingdom. There are n foxes there (i...原创 2018-03-07 23:01:56 · 464 阅读 · 0 评论 -
BZOJ1066:蜥蜴(最大流)
1066: [SCOI2007]蜥蜴 Time Limit: 1 Sec Memory Limit: 162 MB Submit: 4384 Solved: 2232 [Submit][Status][Discuss] Description 在一个r行c列的网格地图中有一些高度不同的石柱,一些石柱上站着一些蜥蜴,你的任务是让尽量多的蜥蜴逃 到边界外。 每行每列中相邻石柱的原创 2017-12-07 01:22:12 · 249 阅读 · 0 评论 -
Lightoj1071:Baker Vai(最小费用最大流)
1071 - Baker Vai PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB All of you must have heard the name of Baker Vai. Yes, he rides原创 2017-11-16 20:31:10 · 279 阅读 · 0 评论 -
EOJ月赛:唐纳德和他的数学老师(二分图匹配 & 最大流)
Time limit per test: 1.0 seconds Memory limit: 256 megabytes 唐纳德是一个数学天才。有一天,他的数学老师决定为难一下他。他跟唐纳德说:「现在我们来玩一个游戏。这个游戏总共 n 轮,每一轮我都会给你一个数(第 i 轮给出的数是 ai)。你每次要回答一个数,是我给出的这个数的质因数,并且你说出的数不能重复。」 因为数学老原创 2017-12-08 21:57:54 · 749 阅读 · 0 评论 -
HDU:1569:方格取数(2)(最小割)
方格取数(2) Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6708 Accepted Submission(s): 2155 Problem Description 给你一个m*n的格子的棋盘,每个格原创 2017-09-18 23:42:55 · 452 阅读 · 0 评论 -
HDU3987:Harry Potter and the Forbidden Forest(最小割边数)
Harry Potter and the Forbidden Forest Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2272 Accepted Submission(s): 779 Problem Desc原创 2017-09-18 21:46:27 · 450 阅读 · 0 评论 -
HDU3376:Matrix Again(最大费用最大流)
Matrix Again Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 4425 Accepted Submission(s): 1288 Problem Description Starvae ver原创 2017-09-25 20:40:38 · 397 阅读 · 0 评论 -
HDU4289:Tricks Device(最小割 & 拆点)
Tricks Device Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3864 Accepted Submission(s): 1090 Problem Description Innocent Wu原创 2017-07-31 22:05:12 · 280 阅读 · 0 评论 -
HDU1533:Going Home(最小费用流)
Going Home Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5474 Accepted Submission(s): 2871 Problem Description On a grid map原创 2017-07-09 22:18:07 · 274 阅读 · 0 评论 -
POJ1087:A Plug for UNIX(最大流)
A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17169 Accepted: 5925 Description You are in charge of setting up the press room for the i原创 2017-07-09 19:30:32 · 259 阅读 · 0 评论 -
POJ1149:PIGS(最大流)
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21219 Accepted: 9688 Description Mirko works on a pig farm that consists of M locked pig-houses and原创 2017-06-08 23:55:21 · 259 阅读 · 0 评论 -
POJ3281:Dining(最大流)
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17845 Accepted: 7960 Description Cows are such finicky eaters. Each cow has a preference for certa原创 2017-06-06 15:58:40 · 267 阅读 · 0 评论 -
HDU3572:Task Schedule(最大流)
Task Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8673 Accepted Submission(s): 2664 Problem Description Our geometry原创 2017-06-05 19:41:29 · 323 阅读 · 0 评论 -
HDU6437:Problem L.Videos(最大费用最大流)
C-bacteria takes charge of two kinds of videos: ’The Collection of Silly Games’ and ’The Collection of Horrible Games’. For simplicity’s sake, they will be called as videoA and videoB. There are some ...原创 2018-08-22 17:45:40 · 755 阅读 · 0 评论
分享