QDU_ACM集训队_暑假训练_单调栈，最小生成树，并查集训练1

Begin: 1531670400000

QDU_ACM集训队_暑假训练_单调栈，最小生成树，并查集训练1

End: 1531886400000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1213	How Many Tables
B	CodeForces 853A	Planning
C	HDU 2473	Junk-Mail Filter
D	CodeForces 566D	Restructuring Company
E	POJ 2492	A Bug's Life
F	HDU 1506	Largest Rectangle in a Histogram
G	POJ 2823	Sliding Window
H	POJ 3250	Bad Hair Day
I	HDU 1863	畅通工程
J	POJ 1251	Jungle Roads
K	POJ 1287	Networking

Status

My Status

Translate

PDF

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

{"id":238509,"title":"QDU_ACM集训队_暑假训练_单调栈，最小生成树，并查集 训练1","type":0,"openness":0,"authStatus":1,"begin":1531670400000,"end":1531886400000,"createTime":1531651900000,"started":true,"ended":true,"managerId":148947,"managerName":"16admin","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":19354,"title":"How Many Tables","oj":"HDU","probNum":"1213","num":"A","enabledDescKeys":[3107206738359983],"descBriefs":[{"key":3107206738359983,"updateDate":"2024-06-20","version":1718890453000,"author":"0","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%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 杭电ACM省赛集训队选拔赛之热身赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":1059469,"title":"Planning","oj":"CodeForces","probNum":"853A","num":"B","enabledDescKeys":[2860398628448712],"descBriefs":[{"key":2860398628448712,"updateDate":"2024-06-23","version":1719136705000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/853\"\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    greedy\r\n\n\r\n    *1500\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/54350\" title\u003d\"Codeforces Round #433 (based on Olympiad of Metropolises)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/54368\" title\u003d\"Codeforces Round #433 Editorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","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":11782,"title":"Junk-Mail Filter","oj":"HDU","probNum":"2473","num":"C","enabledDescKeys":[3161705986792965],"descBriefs":[{"key":3161705986792965,"updateDate":"2024-06-22","version":1719062212000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"8000 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\u003d2008+Asia+Regional+Hangzhou\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008 Asia Regional Hangzhou \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":209552,"title":"Restructuring Company","oj":"CodeForces","probNum":"566D","num":"D","enabledDescKeys":[3291395368783321],"descBriefs":[{"key":3291395368783321,"updateDate":"2024-06-24","version":1719220354000,"author":"0","remarks":"Initialization."}],"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/566\"\u003eVK Cup 2015 - Finals, online mirror\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    dsu\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/19478\" title\u003d\"VK Cup 2015: online mirror and final thanks\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/19518\" title\u003d\"Editorial for VK Cup 2015 — Finals\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","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":13387,"title":"A Bug\u0027s Life","oj":"POJ","probNum":"2492","num":"E","enabledDescKeys":[3163902526592875],"descBriefs":[{"key":3163902526592875,"updateDate":"2024-06-20","version":1718856083000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"10000 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\u003dTUD+Programming+Contest+2005\"\u003eTUD Programming Contest 2005\u003c/a\u003e, Darmstadt, Germany\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":24533,"title":"Largest Rectangle in a Histogram","oj":"HDU","probNum":"1506","num":"F","enabledDescKeys":[3101491605041836],"descBriefs":[{"key":3101491605041836,"updateDate":"2024-06-21","version":1718952795000,"author":"0","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\u003dUniversity+of+Ulm+Local+Contest+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 2003 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":16694,"title":"Sliding Window","oj":"POJ","probNum":"2823","num":"G","enabledDescKeys":[3149832335839297],"descBriefs":[{"key":3149832335839297,"updateDate":"2024-06-26","version":1719346656000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"12000 ms","spoiler":false},{"title":"Case time limit","content":"5000 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+Monthly--2006.04.28\"\u003ePOJ Monthly--2006.04.28\u003c/a\u003e, Ikki\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":16693,"title":"Bad Hair Day","oj":"POJ","probNum":"3250","num":"H","enabledDescKeys":[3149837582973490],"descBriefs":[{"key":3149837582973490,"updateDate":"2024-06-22","version":1719044415000,"author":"0","remarks":"Initialization."}],"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+November+Silver\"\u003eUSACO 2006 November Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":23261,"title":"畅通工程","oj":"HDU","probNum":"1863","num":"I","enabledDescKeys":[3099720575961542],"descBriefs":[{"key":3099720575961542,"updateDate":"2024-06-22","version":1719019604000,"author":"0","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%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2007%C4%EA\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙大计算机研究生复试上机考试-2007年 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":14339,"title":"Jungle Roads","oj":"POJ","probNum":"1251","num":"J","enabledDescKeys":[3165851960714115],"descBriefs":[{"key":3165851960714115,"updateDate":"2024-06-24","version":1719178220000,"author":"0","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\u003dMid-Central+USA+2002\"\u003eMid-Central USA 2002\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":27372,"title":"Networking","oj":"POJ","probNum":"1287","num":"K","enabledDescKeys":[3127997051267300],"descBriefs":[{"key":3127997051267300,"updateDate":"2024-06-21","version":1718956242000,"author":"0","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\u003dSoutheastern+Europe+2002\"\u003eSoutheastern Europe 2002\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"2e47ba7aaa47c1b87874c98a6e1ddd36","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

QDU_ACM集训队_暑假训练_单调栈，最小生成树，并查集 训练1

QDU_ACM集训队_暑假训练_单调栈，最小生成树，并查集训练1