Problem 2260. GJam 2011 Africa Qual A: Maximum Loop Size

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This Challenge is derived from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/837485/dashboard\"><w:r><w:t>GJam 2011 Africa: Closing the Loop</w:t></w:r></w:hyperlink><w:r><w:t>. Small Case Google Code Jam 2014 Kicks Off its Qualifier round April 11.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam\"><w:r><w:t>GJam Registration</w:t></w:r></w:hyperlink><w:r><w:t>. The Test Suite, at the bottom, contains a full GJam file input read, process, and Output example.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Create the maximum length Loop of alternating Segment types (0 or 1). Return Maximum Length. Segment connection Knots reduce the Length by 1, including the end to the start knot. If no valid loop can be created then return 0.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> M, 2xN matrix of [Lengths(1:N);Types(1:N)], Types are 0 or 1</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> L, maximum Loop Length of valid alternating segment types</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r><w:r><w:t> M=[6 1 7 3;1 0 1 0], L=13</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Additional GJam solutions can be found at</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://go-hero.net/jam\"><w:r><w:t>Example GJam Matlab solutions</w:t></w:r></w:hyperlink><w:r><w:t>. Select Find Solutions, change Language to Matlab. There were only 50 Qualifier Matlab entrants in 2013 and a mere 2 Matlab users achieved round 2.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This Challenge is derived from <a href = "http://code.google.com/codejam/contest/837485/dashboard">GJam 2011 Africa: Closing the Loop</a>. Small Case
Google Code Jam 2014 Kicks Off its Qualifier round April 11. <a href = "http://code.google.com/codejam">GJam Registration</a>. The Test Suite, at the bottom, contains a full GJam file input read, process, and Output example.Create the maximum length Loop of alternating Segment types (0 or 1). Return Maximum Length. Segment connection Knots reduce the Length by 1, including the end to the start knot. 
If no valid loop can be created then return 0.Input: M, 2xN matrix of [Lengths(1:N);Types(1:N)], Types are 0 or 1Output: L, maximum Loop Length of valid alternating segment typesExample:
M=[6 1 7 3;1 0 1 0], L=13Additional GJam solutions can be found at <a href = "http://go-hero.net/jam">Example GJam Matlab solutions</a>. Select Find Solutions, change Language to Matlab. There were only 50 Qualifier Matlab entrants in 2013 and a mere 2 Matlab users achieved round 2.

Solve

Solution Stats

24 Solutions
13 Solvers

Last Solution submitted on Nov 24, 2018

Last 200 Solutions

Solution Comments

Solution 424332

2 Comments

2 Comments

J.R.! Menzinger on 31 Mar 2014

you only need to substract 1 inside the sum ;-)

Guillaume on 1 Apr 2014

Indeed!

Problem Recent Solvers13

Problem Tags

Problem 2260. GJam 2011 Africa Qual A: Maximum Loop Size

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers13

Suggested Problems

More from this Author236

Problem Tags

Problem 2260. GJam 2011 Africa Qual A: Maximum Loop Size

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers13

Suggested Problems

More from this Author236

Problem Tags

Players