CQUPT 集训队专题训练（并查集/生成树）

Begin: 1485964800000

CQUPT 集训队专题训练（并查集/生成树）

End: 1486137600000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1213	How Many Tables
B	POJ 1962	Corporative Network
C	UESTC 1328	卿学姐与诡异村庄
D	POJ 1182	食物链
E	UVA 11631	Dark roads
F	CodeForces 472D	Design Tutorial: Inverse the Problem

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":149411,"title":"CQUPT 集训队专题训练（并查集/生成树）","type":0,"openness":0,"authStatus":1,"begin":1485964800000,"end":1486137600000,"createTime":1485948299000,"started":true,"ended":true,"managerId":44245,"managerName":"cqupt","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":19354,"title":"How Many Tables","oj":"HDU","probNum":"1213","num":"A","publicDescId":3107206738359983,"publicDescVersion":1713629424000,"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":17127,"title":"Corporative Network","oj":"POJ","probNum":"1962","num":"B","publicDescId":3152944818368386,"publicDescVersion":1713916459000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"30000 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+2004\"\u003eSoutheastern Europe 2004\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":381608,"title":"卿学姐与诡异村庄","oj":"UESTC","probNum":"1328","num":"C","publicDescId":3268755275192446,"publicDescVersion":1713385321000,"properties":[{"title":"Time limit","content":"1500 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"2016 UESTC Training for Data Structures","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":14789,"title":"食物链","oj":"POJ","probNum":"1182","num":"D","publicDescId":3166324600228015,"publicDescVersion":1713890235000,"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\u003dNoi+01\"\u003eNoi 01\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":27908,"title":"Dark roads","oj":"UVA","probNum":"11631","num":"E","publicDescId":3129729239156038,"publicDescVersion":1713803483000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":53715,"title":"Design Tutorial: Inverse the Problem","oj":"CodeForces","probNum":"472D","num":"F","publicDescId":3283421610986558,"publicDescVersion":1713506101000,"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/472\"\u003eCodeforces Round 270\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    dsu\r\n\n\r\n    shortest paths\r\n\n\r\n    trees\r\n\n\r\n    *1900\r\n","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.9.10 (7.3.9, 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.19.5","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]}],"problemsHash":"789b5a6eb937a4a01c4f1b28fe6ed680","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}