Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-132E\":[\"Bits of merry old England\",572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/132\\\"\\u003eCodeforces Beta Round 96 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4589\":[\"智力竞赛\",847,\"TJOI2018\"],\"洛谷-P5039\":[\"最小生成树\",646,\"SHOI2010\"],\"CodeForces-1009G\":[\"Allowed Letters\",845,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2604\":[\"网络扩容\",2686,\"ZJOI2010\"],\"UVA-11613\":[\"Acme Corporation\",423,null],\"CodeForces-1198E\":[\"Rectangle Painting 2\",1021,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4194\":[\"矩阵\",446,null],\"洛谷-P6094\":[\"圈地\",142,\"JSOI2015\"],\"CodeForces-863F\":[\"Almost Permutation\",1307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"洛谷-P2172\":[\"部落战争\",1554,\"国家集训队\"],\"洛谷-P2050\":[\"美食节\",2448,\"NOI2012\"],\"洛谷-P2053\":[\"修车\",4647,\"SCOI2007\"],\"洛谷-P2570\":[\"贪吃的老鼠\",359,\"ZJOI2010\"],\"洛谷-P2055\":[\"假期的宿舍\",7817,\"ZJOI2009\"],\"洛谷-P1361\":[\"小M的作物\",4450,null],\"洛谷-P2057\":[\"善意的投票 / [JLOI2010] 冠军调查\",4448,\"SHOI2007\"],\"洛谷-P3386\":[\"二分图最大匹配\",41712,\"模板\"],\"洛谷-P3425\":[\"KOS-Dicing\",571,\"POI2005\"],\"洛谷-P3308\":[\"LIS\",688,\"SDOI2014\"],\"CodeForces-212D\":[\"Cutting a Fence\",467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"CodeForces-103E\":[\"Buying Sets\",950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/103\\\"\\u003eCodeforces Beta Round 80 (Div. 1 Only)\\u003c/a\\u003e\"],\"洛谷-P1646\":[\"happiness\",2491,\"国家集训队\"],\"洛谷-P3705\":[\"新生舞会\",2495,\"SDOI2017\"],\"CodeForces-628D\":[\"Magic Numbers\",6170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-818G\":[\"Four Melodies\",688,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"洛谷-P5331\":[\"通信\",906,\"SNOI2019\"],\"洛谷-P3153\":[\"跳舞\",1871,\"CQOI2009\"],\"洛谷-P5295\":[\"图的难题\",374,\"北京省选集训2019\"],\"洛谷-P4003\":[\"无限之环\",1689,null],\"洛谷-P1251\":[\"餐巾计划问题\",7491,null],\"洛谷-P3033\":[\"Cow Steeplechase G\",1204,\"USACO11NOV\"],\"CodeForces-793G\":[\"Oleg and chess\",370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/793\\\"\\u003eTinkoff Challenge - Elimination Round\\u003c/a\\u003e\"],\"Gym-102268D\":[\"Dates\",178,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102268\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e300iq Contest 1\\u003c/a\\u003e\"],\"洛谷-P4123\":[\"不同的最小割\",1294,\"CQOI2016\"],\"洛谷-P4249\":[\"剪刀石头布\",1646,\"WC2007\"],\"CodeForces-590E\":[\"Birthday\",774,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/590\\\"\\u003eCodeforces Round 327 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5458\":[\"水晶\",407,\"BJOI2016\"],\"洛谷-P3159\":[\"交换棋子\",1317,\"CQOI2012\"],\"洛谷-P2469\":[\"星际竞速\",1852,\"SDOI2010\"],\"洛谷-P1935\":[\"圈地计划\",1014,\"国家集训队\"],\"CodeForces-724E\":[\"Goods transportation\",1328,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"CodeForces-546E\":[\"Soldier and Traveling\",3901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/546\\\"\\u003eCodeforces Round 304 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3163\":[\"危桥\",1672,\"CQOI2014\"],\"洛谷-P4251\":[\"小凸玩矩阵\",1334,\"SCOI2015\"],\"UVA-12092\":[\"Paint the Roads\",156,null],\"洛谷-P2472\":[\"蜥蜴\",4061,\"SCOI2007\"],\"洛谷-P4015\":[\"运输问题\",4015,null],\"洛谷-P4012\":[\"深海机器人问题\",2060,null],\"洛谷-P4013\":[\"数字梯形问题\",2523,null],\"洛谷-P4134\":[\"连连看\",476,\"BJOI2012\"],\"洛谷-P2598\":[\"狼和羊的故事\",3171,\"ZJOI2009\"],\"洛谷-P2754\":[\"家园 / 星际转移问题\",3995,\"CTSC1999\"],\"洛谷-P3324\":[\"星际战争\",1407,\"SDOI2015\"],\"CodeForces-343E\":[\"Pumping Stations\",755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/343\\\"\\u003eCodeforces Round 200 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3329\":[\"最小割\",1149,\"ZJOI2011\"],\"洛谷-P3967\":[\"匹配\",1063,\"TJOI2014\"],\"洛谷-P3965\":[\"循环格\",561,\"TJOI2013\"],\"洛谷-P3729\":[\"曼哈顿计划EX\",172,null],\"洛谷-P2517\":[\"订货\",1370,\"HAOI2010\"],\"CodeForces-708D\":[\"Incorrect Flow\",786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1288F\":[\"Red-Blue Graph\",536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5192\":[\"Zoj3229 Shoot the Bullet|东方文花帖|【模板】有源汇上下界最大流\",2336,null],\"洛谷-P4382\":[\"劈配\",1073,\"八省联考 2018\"],\"洛谷-P1791\":[\"人员雇佣\",913,\"国家集训队\"],\"洛谷-P4542\":[\"营救皮卡丘\",969,\"ZJOI2011\"],\"CodeForces-981F\":[\"Round Marriage\",732,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"洛谷-P2488\":[\"工作安排\",622,\"SDOI2011\"],\"洛谷-P2763\":[\"试题库问题\",6273,null],\"洛谷-P2762\":[\"太空飞行计划问题\",5528,null],\"CodeForces-164C\":[\"Machine Programming\",1001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/164\\\"\\u003eVK Cup 2012 Round 3\\u003c/a\\u003e\"],\"洛谷-P2402\":[\"奶牛隐藏\",653,null],\"洛谷-P3973\":[\"线性代数\",1264,\"TJOI2015\"],\"洛谷-P2766\":[\"最长不下降子序列问题\",5010,null],\"UVA-1104\":[\"Chips Challenge\",214,null],\"洛谷-P4307\":[\"球队收益 / 球队预算\",686,\"JSOI2009\"],\"洛谷-P2805\":[\"植物大战僵尸\",2700,\"NOI2009\"],\"LibreOJ-6062\":[\"Pair\",446,\"2017 山东一轮集训 Day2\"],\"CodeForces-976F\":[\"Minimal k-covering\",586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/976\\\"\\u003eEducational Codeforces Round 43 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-786E\":[\"ALT\",723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P6054\":[\"开门大吉\",565,\"RC-02\"],\"洛谷-P4311\":[\"士兵占领\",1489,null],\"洛谷-P4553\":[\"80人环游世界\",1083,null],\"洛谷-P3980\":[\"志愿者招募\",3861,\"NOI2008\"],\"洛谷-P2774\":[\"方格取数问题\",7339,null],\"洛谷-P3227\":[\"切糕\",2329,\"HNOI2013\"],\"洛谷-P4313\":[\"文理分科\",3688,null],\"洛谷-P5769\":[\"飞机调度\",232,\"JSOI2016\"],\"AtCoder-arc085_c\":[\"MUL\",205,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc085\\\"\\u003eAtCoder Regular Contest 085\\u003c/a\\u003e\"],\"洛谷-P3749\":[\"寿司餐厅\",1717,\"六省联考 2017\"],\"CodeForces-802C\":[\"Heidi and Library (hard)\",590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"洛谷-P6061\":[\"疫情调查\",314,\"加油武汉\"],\"洛谷-P4043\":[\"支线剧情\",2133,\"AHOI2014/JSOI2014\"],\"洛谷-P3355\":[\"骑士共存问题\",6120,null],\"洛谷-P3872\":[\"电影迷\",426,\"TJOI2010\"],\"洛谷-P3358\":[\"最长k可重区间集问题\",2281,null],\"洛谷-P4843\":[\"清理雪道\",1523,null],\"洛谷-P3356\":[\"火星探险问题 \",1348,null],\"洛谷-P2423\":[\"朋友圈\",891,\"HEOI2012\"],\"洛谷-P3357\":[\"最长k可重线段集问题\",1154,null],\"UVA-11594\":[\"All Pairs Maximum Flow\",297,null],\"洛谷-P2304\":[\"小园丁与老司机\",961,\"NOI2015\"],\"洛谷-P3756\":[\"老C的方块\",819,\"CQOI2017\"],\"洛谷-P5934\":[\"最小生成树\",721,\"清华集训2012\"],\"CodeForces-227E\":[\"Anniversary\",9,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/227\\\"\\u003eCodeforces Round #140 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2825\":[\"游戏\",2304,\"HEOI2016/TJOI2016\"],\"AtCoder-arc076_d\":[\"Exhausted?\",105,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc076\\\"\\u003eAtCoder Regular Contest 076\\u003c/a\\u003e\"],\"CodeForces-704D\":[\"Captain America\",887,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/704\\\"\\u003eCodeforces Round 366 (Div. 1)\\u003c/a\\u003e\"],\"UVA-1486\":[\"Transportation\",165,null],\"洛谷-P4055\":[\"游戏\",988,\"JSOI2009\"],\"洛谷-P4174\":[\"最大获利\",3444,\"NOI2006\"],\"洛谷-P5786\":[\"传感器网络\",111,\"CQOI2008\"],\"洛谷-P2153\":[\"晨跑\",3251,\"SDOI2009\"],\"洛谷-P4177\":[\"order\",1122,\"CEOI2008\"],\"洛谷-P4452\":[\"航班安排\",755,\"国家集训队\"],\"洛谷-P3488\":[\"LYZ-Ice Skates\",840,\"POI2009\"],\"洛谷-P5029\":[\"T\\u0027ill It\\u0027s Over\",298,null],\"CodeForces-311E\":[\"Biologist\",1106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"UVA-1411\":[\"Ants\",696,null],\"洛谷-P6517\":[\"alliances\",88,\"CEOI2010 day1\"],\"UVA-1659\":[\"Help Little Laura\",232,null],\"CodeForces-1187G\":[\"Gang Up\",519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1082G\":[\"Petya and Graph\",2147,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-852D\":[\"Exploration plan\",1017,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"洛谷-P4066\":[\"吃豆豆\",597,\"SHOI2003\"],\"洛谷-P5038\":[\"奇怪的游戏\",1567,\"SCOI2012\"],\"洛谷-P3410\":[\"拍照\",1299,null],\"洛谷-P1231\":[\"教辅的组成\",5662,null],\"洛谷-P2045\":[\"方格取数加强版\",3071,null],\"洛谷-P3254\":[\"圆桌问题\",6295,null],\"洛谷-P4068\":[\"数字配对\",1155,\"SDOI2016\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"Vancezyx","updateTime":1711603422000,"title":"Command_Block 网络流应用篇题单","dislikeCnt":0,"content":"### 最大流建模\n[problem:洛谷-P2472]\n[problem:洛谷-P2766]\n[problem:洛谷-P2754]\n[problem:洛谷-P3163]\n[problem:洛谷-P5029]\n### 匹配问题\n[problem:洛谷-P3386]\n[problem:洛谷-P2055]\n[problem:洛谷-P2763]\n[problem:洛谷-P3254]\n[problem:洛谷-P4251]\n[problem:洛谷-P2402]\n[problem:CodeForces-852D]\n[problem:CodeForces-546E]\n[problem:CodeForces-628D]\n[problem:洛谷-P3425]\n[problem:洛谷-P1231]\n[problem:洛谷-P2825]\n[problem:洛谷-P6517]\n[problem:洛谷-P3153]\n[problem:洛谷-P3324]\n[problem:洛谷-P5038]\n[problem:洛谷-P2570]\n[problem:洛谷-P5786]\n[problem:洛谷-P4382]\n[problem:CodeForces-793G]\n[problem:CodeForces-212D]\n### 棋盘染色\n对于一个棋盘,像国际象棋那样染成黑白两色,容易发现这是个二分图。\n由于这类题实在太多,这个套路又比较简单,就不单独归类了。\n### 最小割建模\n[problem:洛谷-P2774]\n[problem:洛谷-P5039]\n[problem:洛谷-P5934]\n[problem:洛谷-P2598]\n[problem:洛谷-P6094]\n[problem:洛谷-P2057]\n[problem:洛谷-P3227]\n[problem:洛谷-P6054]\n[problem:洛谷-P5458]\n[problem:洛谷-P3756]\n[problem:洛谷-P1791]\n[problem:洛谷-P1361]\n[problem:洛谷-P4313]\n[problem:洛谷-P1646]\n[problem:CodeForces-311E]\n[problem:洛谷-P1935]\n[problem:洛谷-P3308]\n[problem:CodeForces-724E]\n### 最大闭合子图建模\n[problem:洛谷-P3410]\n[problem:洛谷-P2762]\n[problem:洛谷-P2805]\n[problem:AtCoder-arc085_c]\n[problem:洛谷-P4174]\n[problem:CodeForces-1082G]\n[problem:洛谷-P3973]\n[problem:洛谷-P3749]\n[problem:洛谷-P3872]\n[problem:洛谷-P4177]\n[problem:CodeForces-103E]\n[problem:洛谷-P5295]\n### DAG(偏序集)建模\n[problem:洛谷-P2172]\n[problem:洛谷-P5769]\n[problem:洛谷-P4589]\n[problem:CodeForces-590E]\n[problem:洛谷-P3355]\n[problem:洛谷-P3033]\n[problem:洛谷-P2423]\n[problem:CodeForces-976F]\n[problem:CodeForces-1198E]\n[problem:CodeForces-786E]\n[problem:洛谷-P4055]\n### Hall 定理\n[problem:洛谷-P3488]\n[problem:CodeForces-981F]\n[problem:LibreOJ-6062]\n[problem:CodeForces-1009G]\n[problem:AtCoder-arc076_D]\n[problem:Gym-102268D]\n### 最小割树\n[problem:洛谷-P3329]\n[problem:UVA-11594]\n[problem:洛谷-P4123]\n[problem:洛谷-P3729]\n[problem:CodeForces-343E]\n### 费用流题目泛做\n##### 类最短(长)路问题\n[problem:洛谷-P2153]\n[problem:洛谷-P2045]\n[problem:洛谷-P4013]\n[problem:洛谷-P3356]\n[problem:洛谷-P4012]\n[problem:CodeForces-818G]\n[problem:UVA-1486]\n[problem:CodeForces-1187G]\n[problem:洛谷-P4066]\n[problem:洛谷-P3159]\n[problem:洛谷-P4452]\n##### 费用匹配\n[problem:洛谷-P3967]\n[problem:洛谷-P4015]\n[problem:洛谷-P3705]\n[problem:洛谷-P4134]\n[problem:洛谷-P2488]\n[problem:UVA-11613]\n[problem:洛谷-P2053]\n[problem:洛谷-P2050]\n[problem:CodeForces-863F]\n[problem:洛谷-P4307]\n[problem:洛谷-P4249]\n[problem:洛谷-P6061]\n[problem:UVA-12092]\n[problem:CodeForces-227E]\n[problem:洛谷-P4068]\n[problem:UVA-1411]\n[problem:洛谷-P5331]\n[problem:洛谷-P3965]\n[problem:洛谷-P4003]\n\n##### 不好归类的题目\n[problem:洛谷-P2604]\n[problem:洛谷-P2517]\n[problem:洛谷-P3358]\n[problem:CodeForces-164C]\n[problem:洛谷-P3357]\n[problem:洛谷-P3980]\n[problem:CodeForces-802C]\n[problem:CodeForces-132E]\n### 上下界网络流题目泛做\n[problem:洛谷-P5192]\n[problem:洛谷-P4843]\n[problem:洛谷-P2304]\n[problem:洛谷-P4043]\n[problem:洛谷-P4553]\n[problem:洛谷-P2469]\n[problem:洛谷-P4542]\n[problem:洛谷-P4311]\n[problem:洛谷-P4194]\n[problem:洛谷-P1251]\n[problem:CodeForces-1288F]\n[problem:CodeForces-708D]\n[problem:CodeForces-704D]\n[problem:UVA-1104]\n[problem:UVA-1659]\n\n","threadId":188186,"likeCnt":1,"createTime":1711600504000,"isWorkbook":true,"viewCnt":112,"openness":2,"fav":false,"id":4765,"trustable":false}