Yokohama National Univ. Competitive Programming Club2019 VC 031 B Div. 1

Begin: 1576294200000

Yokohama National Univ. Competitive Programming Club2019 VC 031 B Div. 1

End: 1576305000000

Elapsed:

Remaining:

#	Origin	Title
A	CodeForces 1272B	Snow Walking Robot
B	CodeForces 1272C	Yet Another Broken Keyboard
C	CodeForces 1272D	Remove One Element
D	CodeForces 1272E	Nearest Opposite Parity
E	Aizu 1360	Bringing Order to Disorder
F	Aizu 2681	Parentheses

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":348312,"title":"Yokohama National Univ. Competitive Programming Club2019 VC 031 B Div. 1","type":0,"openness":0,"authStatus":1,"begin":1576294200000,"end":1576305000000,"createTime":1576251567000,"started":true,"ended":true,"managerId":223726,"managerName":"ynu_z","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":2987876,"title":"Snow Walking Robot","oj":"CodeForces","probNum":"1272B","num":"A","publicDescId":2897743475617109,"publicDescVersion":1715132944000,"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/1272\"\u003eCodeforces Round 605 (Div. 3)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    constructive algorithms\r\n\n\r\n    greedy\r\n\n\r\n    implementation\r\n\n\r\n    *1200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/72086\" title\u003d\"Codeforces Round #605 (Div. 3)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/72132\" title\u003d\"Codeforces Round #605 (Div. 3) Editorial\" 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":2987668,"title":"Yet Another Broken Keyboard","oj":"CodeForces","probNum":"1272C","num":"B","publicDescId":2897724358014855,"publicDescVersion":1715418617000,"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/1272\"\u003eCodeforces Round 605 (Div. 3)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    combinatorics\r\n\n\r\n    dp\r\n\n\r\n    implementation\r\n\n\r\n    *1200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/72086\" title\u003d\"Codeforces Round #605 (Div. 3)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/72132\" title\u003d\"Codeforces Round #605 (Div. 3) Editorial\" 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":2987672,"title":"Remove One Element","oj":"CodeForces","probNum":"1272D","num":"C","publicDescId":2897727499742674,"publicDescVersion":1715394227000,"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/1272\"\u003eCodeforces Round 605 (Div. 3)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    brute force\r\n\n\r\n    dp\r\n\n\r\n    *1500\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/72086\" title\u003d\"Codeforces Round #605 (Div. 3)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/72132\" title\u003d\"Codeforces Round #605 (Div. 3) Editorial\" 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":2987667,"title":"Nearest Opposite Parity","oj":"CodeForces","probNum":"1272E","num":"D","publicDescId":2897695715170680,"publicDescVersion":1715451725000,"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/1272\"\u003eCodeforces Round 605 (Div. 3)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    graphs\r\n\n\r\n    shortest paths\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/72086\" title\u003d\"Codeforces Round #605 (Div. 3)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/72132\" title\u003d\"Codeforces Round #605 (Div. 3) Editorial\" 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":365248,"title":"Bringing Order to Disorder","oj":"Aizu","probNum":"1360","num":"E","publicDescId":3266410246878559,"publicDescVersion":1715131111000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2015, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":419023,"title":"Parentheses","oj":"Aizu","probNum":"2681","num":"F","publicDescId":3258350126708029,"publicDescVersion":1714926180000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM-ICPC Japan Alumni Group Spring Contest 2013","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]}],"problemsHash":"926a462379f5f6eab798599a06922727","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}