CUIT2022年暑假——拓扑排序 - Virtual Judge

contest.view.begin : 1656892800000

CUIT2022年暑假——拓扑排序

contest.view.end : 1658102400000

contest.view.elapsed :

(contest.frozen)

contest.view.remaining :

Status

My Status

ID	status.list.username	status.list.prob	status.list.result	status.list.time (ms)	status.list.mem (MB)	status.list.length	status.list.lang	status.list.submit_time

{"id":502874,"title":"CUIT2022年暑假——拓扑排序","type":1,"openness":0,"authStatus":1,"begin":1656892800000,"end":1658102400000,"freezeTime":1658102400000,"unfreezeTime":1658102400000,"enableFreeze":false,"createTime":1656863770000,"version":"64d","started":true,"ended":true,"managerId":476626,"managerName":"Crotes","groupShortName":"cuit20","groupName":"CUIT2020","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":30402,"title":"确定比赛名次","oj":"HDU","probNum":"1285","num":"A","enabledDescKeys":[312230629405664],"descBriefs":[{"key":312230629405664,"updateDate":"2026-03-14","version":1773421518000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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%A8VII%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 杭电ACM集训队训练赛（VII） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003eSmallBeer(CML)\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":19855,"title":"Labeling Balls","oj":"POJ","probNum":"3687","num":"B","enabledDescKeys":[334653628735882],"descBriefs":[{"key":334653628735882,"updateDate":"2021-07-22","version":1626917492000,"author":"2019112446","authorKey":"user:371850","authorUserId":371850,"type":"user","lang":"zh","langDisplay":"中文","official":false,"mainOfficial":false,"publicVisible":true,"avatarUrl":"https://cn.cravatar.com/avatar/2542c8c8dce7fb7ba24b6151f35525b0?d\u003didenticon","remarks":"Initialization."}],"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\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\"\u003ePOJ Founder Monthly Contest – 2008.08.31\u003c/a\u003e, windy7926778\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":387991,"title":"Gym Class","oj":"HDU","probNum":"5695","num":"C","enabledDescKeys":[298519485466186],"descBriefs":[{"key":298519485466186,"updateDate":"2026-02-05","version":1770295202000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"65536 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\u003d2016%26quot%3B%B0%D9%B6%C8%D6%AE%D0%C7%26quot%3B+-+%B3%F5%C8%FC%A3%A8Astar+Round2A%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2016\"百度之星\" - 初赛（Astar Round2A） \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":51973,"title":"逃生","oj":"HDU","probNum":"4857","num":"D","enabledDescKeys":[300204173743460],"descBriefs":[{"key":300204173743460,"updateDate":"2025-08-24","version":1756039939000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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\u003dBestCoder+Round+%231\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #1 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003eCLJ\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":23626,"title":"产生冠军","oj":"HDU","probNum":"2094","num":"E","enabledDescKeys":[309971326532418],"descBriefs":[{"key":309971326532418,"updateDate":"2025-08-25","version":1756100873000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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%D3%AD%BD%D3%D0%C2%D1%A7%C6%DA%A1%AA%A1%AA%B3%AC%BC%B6Easy%B0%E6%C8%C8%C9%ED%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 迎接新学期――超级Easy版热身赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003eqianneng\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":15762,"title":"Sorting It All Out","oj":"POJ","probNum":"1094","num":"F","enabledDescKeys":[316530773711970],"descBriefs":[{"key":316530773711970,"updateDate":"2026-02-03","version":1770122627000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":39369,"title":"Window Pains","oj":"POJ","probNum":"2585","num":"G","enabledDescKeys":[304925285732796],"descBriefs":[{"key":304925285732796,"updateDate":"2025-04-18","version":1744964528000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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\u003dSouth+Central+USA+2003\"\u003eSouth Central USA 2003\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":3561591,"title":"Directing Edges","oj":"CodeForces","probNum":"1385E","num":"H","enabledDescKeys":[337789336813016],"descBriefs":[{"key":337789336813016,"updateDate":"2021-08-19","version":1629378007000,"author":"Boyun","authorKey":"user:370429","authorUserId":370429,"type":"user","lang":"zh","langDisplay":"中文","official":false,"mainOfficial":false,"publicVisible":true,"avatarUrl":"https://cn.cravatar.com/avatar/5902f5f3d5a00e24bd10a2df583f2816?d\u003dwavatar","remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"3000 ms","spoiler":false},{"title":"mem_limit","content":"262144 kB","spoiler":false},{"title":"source","content":"\u003ca href\u003d\"https://codeforces.com/contest/1385\"\u003eCodeforces Round 656 (Div. 3)\u003c/a\u003e","spoiler":true},{"title":"tags","content":"\n    constructive algorithms\n\n\n    dfs and similar\n\n\n    graphs\n\n\n    \n","spoiler":true},{"title":"difficulty","content":"2000","spoiler":true},{"title":"editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/80196\" title\u003d\"Codeforces Round #656 (Div. 3)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/80257\" title\u003d\"Codeforces Round #656 (Div. 3) Editorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","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","91":"GNU G++23 14.2 (64 bit, msys2)","70":"PyPy 3.10 (7.3.15, 64bit)","51":"PascalABC.NET 3.8.3","96":"C# 13, .NET SDK 9","97":"F# 9, .NET SDK 9","31":"Python 3.13.2","75":"Rust 1.89.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","98":"Rust 1.89.0 (2024)","99":"Kotlin 2.2.0","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":[false,true,true]},{"pid":4027014,"title":"最大食物链计数","oj":"洛谷","probNum":"P4017","num":"I","enabledDescKeys":[331488143728998],"descBriefs":[{"key":331488143728998,"updateDate":"2026-07-01","version":1782878461000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"128000 kB","spoiler":false},{"title":"author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/51001\u0027 target\u003d\u0027_blank\u0027\u003eFlokirie\u003c/a\u003e","spoiler":true},{"title":"tags","content":"动态规划 DP; 搜索; 图论; 排序; 深度优先搜索 DFS; 拓扑排序","spoiler":true},{"title":"difficulty","content":"普及","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[false,true,true]},{"pid":4027012,"title":"旅行计划","oj":"洛谷","probNum":"P1137","num":"J","enabledDescKeys":[331488790724640],"descBriefs":[{"key":331488790724640,"updateDate":"2026-07-03","version":1783064612000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"128000 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":"动态规划 DP; 图论; 递推; 记忆化搜索; 拓扑排序","spoiler":true},{"title":"difficulty","content":"普及","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[false,true,true]},{"pid":4041757,"title":"糖果","oj":"洛谷","probNum":"P3275","num":"K","enabledDescKeys":[326273179952472],"descBriefs":[{"key":326273179952472,"updateDate":"2026-07-01","version":1782901095000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"131072 kB","spoiler":false},{"title":"source","content":"SCOI2011","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":"动态规划 DP; 2011; 四川; 各省省选; 拓扑排序; Tarjan; 差分约束","spoiler":true},{"title":"difficulty","content":"提高","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[false,true,true]}],"problemsHash":"64d9b9d99c9d5af86ab2fbba4dcbac41","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"oneShot":false,"customizedWeight":false,"showPeers":false,"participantMode":0,"excludedFromRank":false,"participation":{"enabled":false,"canChange":false,"options":[]},"clonedFromId":0}