SCUACM2022集训前训练-图论 - Virtual Judge

Begin: 1651829400000

SCUACM2022集训前训练-图论

End: 1657013400000

Elapsed:

Remaining:

	Stat	#	Origin	Title
		A	洛谷 P4779	单源最短路径（标准版）
		B	洛谷 P1119	灾后重建
		C	洛谷 P3387	缩点
		D	洛谷 P3388	割点（割顶）
		E	洛谷 P2341	受欢迎的牛 G
		F	洛谷 P3366	最小生成树
		G	洛谷 P1967	货车运输
		H	洛谷 P1195	口袋的天空
		I	洛谷 P3398	仓鼠找 sugar
		J	POJ 3259	Wormholes
		K	POJ 3660	Cow Contest
		L	POJ 3159	Candies
		M	POJ 1062	昂贵的聘礼
		N	POJ 3311	Hie with the Pie
		O	POJ 3312	Mahershalalhashbaz, Nebuchadnezzar, and Billy Bob Benjamin Go to the Regionals
		P	洛谷 P4768	归程
		Q	CodeForces 888G	Xor-MST
		R	洛谷 P1196	银河英雄传说
		S	POJ 1679	The Unique MST
		T	HDU 1217	Arbitrage
		U	洛谷 P2024	食物链
		V	HDU 3873	Invade the Mars
		W	HDU 3191	How Many Paths Are There
		X	POJ 2472	106 miles to Chicago
		Y	HDU 1281	棋盘游戏
		Z	POJ 3041	Asteroids
		AA	POJ 1129	Channel Allocation
		AB	POJ 2513	Colored Sticks
		AC	POJ 1094	Sorting It All Out
		AD	洛谷 P4174	最大获利
		AE	洛谷 P3376	网络最大流
		AF	洛谷 P3381	最小费用最大流
		AG	洛谷 P1038	神经网络
		AH	洛谷 P4408	逃学的小孩
		AI	洛谷 P2149	Elaxia的路线

Status

My Status

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":492306,"title":"SCUACM2022集训前训练-图论","type":0,"openness":0,"authStatus":1,"begin":1651829400000,"end":1657013400000,"createTime":1651829178000,"started":true,"ended":true,"managerId":630953,"managerName":"scuacm2022","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":4027150,"title":"单源最短路径（标准版）","oj":"洛谷","probNum":"P4779","num":"A","publicDescId":3026967865922886,"publicDescVersion":1716127707000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"模板","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/12621\u0027 target\u003d\u0027_blank\u0027\u003efstqwq\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; 优先队列; 最短路","spoiler":true},{"title":"Difficulty","content":"普及/提高−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4030099,"title":"灾后重建","oj":"洛谷","probNum":"P1119","num":"B","publicDescId":3054137291739100,"publicDescVersion":1715761821000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/3\u0027 target\u003d\u0027_blank\u0027\u003e洛谷\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; 枚举; 最短路","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4042305,"title":"缩点","oj":"洛谷","probNum":"P3387","num":"C","publicDescId":2597703339336562,"publicDescVersion":1716201716000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"模板","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/9567\u0027 target\u003d\u0027_blank\u0027\u003eHOOCCOOH\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; Tarjan","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4027410,"title":"割点（割顶）","oj":"洛谷","probNum":"P3388","num":"D","publicDescId":3026306724083078,"publicDescVersion":1715995943000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"模板","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/9567\u0027 target\u003d\u0027_blank\u0027\u003eHOOCCOOH\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"Tarjan; 双连通分量","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4035176,"title":"受欢迎的牛 G","oj":"洛谷","probNum":"P2341","num":"E","publicDescId":3050313199539503,"publicDescVersion":1716217930000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"USACO03FALL / HAOI2006","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/1456\u0027 target\u003d\u0027_blank\u0027\u003ewwqk4444\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; 2003; 2006; 河南; USACO; 各省省选; 强连通分量; Tarjan; 栈","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4026746,"title":"最小生成树","oj":"洛谷","probNum":"P3366","num":"F","publicDescId":3043447334538562,"publicDescVersion":1716155859000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"模板","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/1492\u0027 target\u003d\u0027_blank\u0027\u003eHansBug\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"生成树","spoiler":true},{"title":"Difficulty","content":"普及/提高−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4027269,"title":"货车运输","oj":"洛谷","probNum":"P1967","num":"G","publicDescId":3027952831262358,"publicDescVersion":1715675405000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"NOIP2013 提高组","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/19\u0027 target\u003d\u0027_blank\u0027\u003eCCF_NOI\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; 贪心; 2013; 倍增; 并查集; NOIp 提高组; 生成树; 最近公共祖先,LCA","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4027009,"title":"口袋的天空","oj":"洛谷","probNum":"P1195","num":"H","publicDescId":3042281262442209,"publicDescVersion":1716064418000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/3\u0027 target\u003d\u0027_blank\u0027\u003e洛谷\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; 并查集; 生成树","spoiler":true},{"title":"Difficulty","content":"普及/提高−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4042344,"title":"仓鼠找 sugar","oj":"洛谷","probNum":"P3398","num":"I","publicDescId":2597851970849071,"publicDescVersion":1715760771000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/4134\u0027 target\u003d\u0027_blank\u0027\u003efjzzq2002\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"倍增; Tarjan; 最近公共祖先,LCA; 洛谷月赛","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":10533,"title":"Wormholes","oj":"POJ","probNum":"3259","num":"J","publicDescId":3158125970389206,"publicDescVersion":1715782130000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2006+December+Gold\"\u003eUSACO 2006 December Gold\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":12425,"title":"Cow Contest","oj":"POJ","probNum":"3660","num":"K","publicDescId":3160967441628031,"publicDescVersion":1715817784000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2008+January+Silver\"\u003eUSACO 2008 January Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":17126,"title":"Candies","oj":"POJ","probNum":"3159","num":"L","publicDescId":3152923657356366,"publicDescVersion":1716156025000,"properties":[{"title":"Time limit","content":"1500 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPOJ+Monthly--2006.12.31\"\u003ePOJ Monthly--2006.12.31\u003c/a\u003e, Sempr\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":10777,"title":"昂贵的聘礼","oj":"POJ","probNum":"1062","num":"M","publicDescId":3158635549248872,"publicDescVersion":1715824165000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003d%E6%B5%99%E6%B1%9F\"\u003e浙江\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":15293,"title":"Hie with the Pie","oj":"POJ","probNum":"3311","num":"N","publicDescId":3164717672999864,"publicDescVersion":1715727094000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dEast+Central+North+America+2006\"\u003eEast Central North America 2006\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":20852,"title":"Mahershalalhashbaz, Nebuchadnezzar, and Billy Bob\r\nBenjamin Go to the Regionals","oj":"POJ","probNum":"3312","num":"O","publicDescId":3110784264032960,"publicDescVersion":1715772423000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dEast+Central+North+America+2006\"\u003eEast Central North America 2006\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4053017,"title":"归程","oj":"洛谷","probNum":"P4768","num":"P","publicDescId":2563186362440042,"publicDescVersion":1715947110000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"536576 kB","spoiler":false},{"title":"Source","content":"NOI2018","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/8457\u0027 target\u003d\u0027_blank\u0027\u003echen_zhe\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"2018; 并查集; Kruskal 重构树; NOI; O2优化; 最短路; 可持久化","spoiler":true},{"title":"Difficulty","content":"省选/NOI−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":1193547,"title":"Xor-MST","oj":"CodeForces","probNum":"888G","num":"Q","publicDescId":2866398573251912,"publicDescVersion":1716009666000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/888\"\u003eEducational Codeforces Round 32\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    bitmasks\r\n\n\r\n    constructive algorithms\r\n\n\r\n    data structures\r\n\n\r\n    *2300\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/55665\" title\u003d\"Educational Codeforces Round 32\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/55701\" title\u003d\"Educational Codeforces Round 32 - Editorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":4027010,"title":"银河英雄传说","oj":"洛谷","probNum":"P1196","num":"R","publicDescId":3042310173794092,"publicDescVersion":1715836084000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"NOI2002","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/3\u0027 target\u003d\u0027_blank\u0027\u003e洛谷\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"2002; 并查集; NOI","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":17124,"title":"The Unique MST","oj":"POJ","probNum":"1679","num":"S","publicDescId":3152934219002356,"publicDescVersion":1715590738000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPOJ+Monthly--2004.06.27+srbga%40POJ\"\u003ePOJ Monthly--2004.06.27 srbga@POJ\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":22312,"title":"Arbitrage","oj":"HDU","probNum":"1217","num":"T","publicDescId":3097781287886569,"publicDescVersion":1715617649000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dUniversity+of+Ulm+Local+Contest+1996\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 1996 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4027037,"title":"食物链","oj":"洛谷","probNum":"P2024","num":"U","publicDescId":3041834906146444,"publicDescVersion":1716204083000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"NOI2001","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/3\u0027 target\u003d\u0027_blank\u0027\u003e洛谷\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"2001; 并查集; NOI","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":22728,"title":"Invade the Mars","oj":"HDU","probNum":"3873","num":"V","publicDescId":3096618159983874,"publicDescVersion":1715859605000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"165536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2011+Multi-University+Training+Contest+4+-+Host+by+SDU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 4 - Host by SDU \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":25754,"title":"How Many Paths Are There","oj":"HDU","probNum":"3191","num":"W","publicDescId":3124485785765212,"publicDescVersion":1715914450000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDU+2009-12+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2009-12 Programming Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eZSTU\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":16604,"title":"106 miles to Chicago","oj":"POJ","probNum":"2472","num":"X","publicDescId":3149027276308797,"publicDescVersion":1715731195000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUlm+Local+2005\"\u003eUlm Local 2005\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":37882,"title":"棋盘游戏","oj":"HDU","probNum":"1281","num":"Y","publicDescId":3234281957553602,"publicDescVersion":1715691257000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VI%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 杭电ACM集训队训练赛（VI） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eGardon\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":10535,"title":"Asteroids","oj":"POJ","probNum":"3041","num":"Z","publicDescId":3158149768417200,"publicDescVersion":1716109373000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2005+November+Gold\"\u003eUSACO 2005 November Gold\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":15212,"title":"Channel Allocation","oj":"POJ","probNum":"1129","num":"AA","publicDescId":3166269177755791,"publicDescVersion":1715602623000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dSouthern+African+2001\"\u003eSouthern African 2001\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":11158,"title":"Colored Sticks","oj":"POJ","probNum":"2513","num":"AB","publicDescId":3158619931173450,"publicDescVersion":1715945945000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"128000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dThe+UofA+Local+2000.10.14\"\u003eThe UofA Local 2000.10.14\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":15762,"title":"Sorting It All Out","oj":"POJ","probNum":"1094","num":"AC","publicDescId":3165307722101932,"publicDescVersion":1716159641000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dEast+Central+North+America+2001\"\u003eEast Central North America 2001\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4050033,"title":"最大获利","oj":"洛谷","probNum":"P4174","num":"AD","publicDescId":2534046679543778,"publicDescVersion":1716109527000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"NOI2006","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/8457\u0027 target\u003d\u0027_blank\u0027\u003echen_zhe\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"2006; NOI; 网络流; 广度优先搜索,BFS; 深度优先搜索,DFS; 最大流","spoiler":true},{"title":"Difficulty","content":"省选/NOI−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4026924,"title":"网络最大流","oj":"洛谷","probNum":"P3376","num":"AE","publicDescId":3041373428060247,"publicDescVersion":1716064419000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"模板","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/1492\u0027 target\u003d\u0027_blank\u0027\u003eHansBug\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"O2优化; 最大流","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4042293,"title":"最小费用最大流","oj":"洛谷","probNum":"P3381","num":"AF","publicDescId":2597665912172438,"publicDescVersion":1715942816000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"模板","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/1492\u0027 target\u003d\u0027_blank\u0027\u003eHansBug\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"O2优化; 费用流","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4026495,"title":"神经网络","oj":"洛谷","probNum":"P1038","num":"AG","publicDescId":3039797484916694,"publicDescVersion":1715782475000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"NOIP2003 提高组","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/19\u0027 target\u003d\u0027_blank\u0027\u003eCCF_NOI\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"图论; 2003; NOIp 提高组; 拓扑排序","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4051427,"title":"逃学的小孩","oj":"洛谷","probNum":"P4408","num":"AH","publicDescId":2538425853656876,"publicDescVersion":1716262026000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"NOI2003","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/38472\u0027 target\u003d\u0027_blank\u0027\u003eAntiLeaf\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"2003; NOI; 枚举; 树的直径","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4034489,"title":"Elaxia的路线","oj":"洛谷","probNum":"P2149","num":"AI","publicDescId":3048696355504714,"publicDescVersion":1715921253000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"SDOI2009","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/14\u0027 target\u003d\u0027_blank\u0027\u003exmyzwls\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"2009; 各省省选; 山东; 拓扑排序; 最短路","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]}],"problemsHash":"ce38fc410139e79b5c5c2402a0fbea01","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}