2021_GDUT_新生专题训练_数据结构

Begin: 1614007500000

2021_GDUT_新生专题训练_数据结构

End: 1616599500000

Elapsed:

Remaining:

#	Origin	Title
A	OpenJ_Bailian 3704	扩号匹配问题
B	OpenJ_Bailian 4099	队列和栈
C	HihoCoder 1460	Smallest Substring
D	CodeForces 1072D	Minimum path
E	CodeForces 7D	Palindrome Degree
F	HDU 1506	Largest Rectangle in a Histogram
G	LibreOJ 2362	蚯蚓
H	CodeForces 500B	New Year Permutation
I	LibreOJ 6278	数列分块入门 2
J	LibreOJ 2758	年轮蛋糕

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":424167,"title":"2021_GDUT_新生专题训练_数据结构","type":0,"openness":0,"authStatus":1,"begin":1614007500000,"end":1616599500000,"createTime":1614007369000,"started":true,"ended":true,"managerId":102656,"managerName":"wuruzhao","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":523208,"title":"扩号匹配问题","oj":"OpenJ_Bailian","probNum":"3704","num":"A","publicDescId":3355790526855302,"publicDescVersion":1714203450000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","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":607654,"title":"队列和栈","oj":"OpenJ_Bailian","probNum":"4099","num":"B","publicDescId":3377032323380474,"publicDescVersion":1714530403000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","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":618080,"title":"Smallest Substring","oj":"HihoCoder","probNum":"1460","num":"C","publicDescId":3375592555816768,"publicDescVersion":1660111875000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"hihoCoder太阁最新面经算法竞赛20","spoiler":true}],"weight":1,"submitTips":"HihoCoder is down.","submitMethods":[false,false,false]},{"pid":1973109,"title":"Minimum path","oj":"CodeForces","probNum":"1072D","num":"D","publicDescId":2842130825537459,"publicDescVersion":1713958004000,"properties":[{"title":"Time limit","content":"1500 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/1072\"\u003eCodeforces Round 517 (Div. 2, based on Technocup 2019 Elimination Round 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    dp\r\n\n\r\n    graphs\r\n\n\r\n    greedy\r\n\n\r\n    sortings\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/62594\" title\u003d\"Технокубок 2019 — Отборочный Раунд 2 (и открытые рейтинговые раунды Codeforces Round 517 Div.1, Div.2)\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(ru)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/62612\" title\u003d\"Разбор задач Отборочного Раунда 2 Технокубка 2019 и Codeforces Round #517\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(ru)\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":20907,"title":"Palindrome Degree","oj":"CodeForces","probNum":"7D","num":"E","publicDescId":3111484819800944,"publicDescVersion":1714747045000,"properties":[{"title":"Time limit","content":"1000 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/7\"\u003eCodeforces Beta Round 7\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    hashing\r\n\n\r\n    strings\r\n\n\r\n    *2200\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.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":24533,"title":"Largest Rectangle in a Histogram","oj":"HDU","probNum":"1506","num":"F","publicDescId":3101491605041836,"publicDescVersion":1714230418000,"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":3654150,"title":"蚯蚓","oj":"LibreOJ","probNum":"2362","num":"G","publicDescId":3014177220699830,"publicDescVersion":1713318536000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"NOIP2016","spoiler":true},{"title":"Tags","content":"2016; 哈夫曼编码; NOIP","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,true]},{"pid":99903,"title":"New Year Permutation","oj":"CodeForces","probNum":"500B","num":"H","publicDescId":3274078819558732,"publicDescVersion":1714834139000,"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/500\"\u003eGood Bye 2014\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    dsu\r\n\n\r\n    graphs\r\n\n\r\n    greedy\r\n\n\r\n    math\r\n\n\r\n    sortings\r\n\n\r\n    *1600\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/15513\" title\u003d\"Tutorial 2\" target\u003d\"_blank\"\u003eTutorial 2 \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/15488\" title\u003d\"Tutorial 1\" target\u003d\"_blank\"\u003eTutorial 1 \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":3187582,"title":"数列分块入门 2","oj":"LibreOJ","probNum":"6278","num":"I","publicDescId":2890902318776704,"publicDescVersion":1714452366000,"properties":[{"title":"Time limit","content":"500 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"数据结构; 分块及按大小分类; hzwer 题集","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":3169536,"title":"年轮蛋糕","oj":"LibreOJ","probNum":"2758","num":"J","publicDescId":2887327641124519,"publicDescVersion":1713527250000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"JOI 2014 Final","spoiler":true},{"title":"Tags","content":"二分; 2014; 前缀和; JOI","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,true]}],"problemsHash":"a7fbcfe5e03f4284fffe1098c9905437","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}