Problem 1870. GJam:2013 World B: MAD Drummer

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 the</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>Google Code Jam 2013 World Championship</w:t></w:r></w:hyperlink><w:r><w:t>. The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/2437491/dashboard#s=p1\"><w:r><w:t>Problem B Drummer</w:t></w:r></w:hyperlink><w:r><w:t> is modified for Cody. The Google question story is to find the Drummer with the Best Beat based on the Minimum Absolute Delta metric. The MAD (aka LAD) is more complicated than LMSF.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The challenge is to produce a series that has a Minimum Absolute Delta from a series of increasing values. The user series is of the form b,b+K,b+2*k,b+3*k,...,b+(N-1)*k for a set of N values.</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> v ; A vector of two to ten integers of increasing values</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> MAD ; the Minimum Absolute Delta of the optimum sequence from given values.</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>Accuracy:</w:t></w:r><w:r><w:t> &lt;2e-6</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>Examples:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[[10 70] {0}\n[0 10 19 30] {0.5}\n[2 5 10 15 20 24]{0.75}]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/2437491/dashboard#s=a&amp;a=1\"><w:r><w:t>Drummer Analysis</w:t></w:r></w:hyperlink><w:r><w:t> may be of help. The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/2437491/scoreboard?c=2437491#\"><w:r><w:t>Champions solutions</w:t></w:r></w:hyperlink><w:r><w:t> can be seen at the Contest Scoreboard if a user profile is created. Java and C appear to dominate. Code Jam entries can be entered at</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/2437491/dashboard#s=p1\"><w:r><w:t>Drummer Solve B-small</w:t></w:r></w:hyperlink><w:r><w:t>.</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>Best Time: 24 minutes</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 the <a href = "http://code.google.com/codejam/">Google Code Jam 2013 World Championship</a>. The <a href = "http://code.google.com/codejam/contest/2437491/dashboard#s=p1">Problem B Drummer</a> is modified for Cody. The Google question story is to find the Drummer with the Best Beat based on the Minimum Absolute Delta metric. The MAD (aka LAD) is more complicated than LMSF.The challenge is to produce a series that has a Minimum Absolute Delta from a series of increasing values. The user series is of the form b,b+K,b+2*k,b+3*k,...,b+(N-1)*k for a set of N values.Input: v ; A vector of two to ten integers of increasing valuesOutput: MAD ; the Minimum Absolute Delta of the optimum sequence from given values.Accuracy: &lt;2e-6Examples:<pre class="language-matlab">[10 70] {0}
[0 10 19 30] {0.5}
[2 5 10 15 20 24]{0.75}
</pre>The <a href = "http://code.google.com/codejam/contest/2437491/dashboard#s=a&a=1">Drummer Analysis</a> may be of help. The <a href = "http://code.google.com/codejam/contest/2437491/scoreboard?c=2437491#">Champions solutions</a> can be seen at the Contest Scoreboard if a user profile is created. Java and C appear to dominate. Code Jam entries can be entered at <a href = "http://code.google.com/codejam/contest/2437491/dashboard#s=p1">Drummer Solve B-small</a>.Best Time: 24 minutes

This Challenge is derived from the <http://code.google.com/codejam/ Google Code Jam 2013 World Championship>. The <http://code.google.com/codejam/contest/2437491/dashboard#s=p1 Problem B Drummer> is modified for Cody. The Google question story is to find the Drummer with the Best Beat based on the Minimum Absolute Delta metric. The MAD (aka LAD) is more complicated than LMSF.

The challenge is to produce a series that has a  Minimum Absolute Delta from a series of increasing values. The user series is of the form b,b+K,b+2*k,b+3*k,...,b+(N-1)*k for a set of N values.

*Input:* v ;  A vector of two to ten integers of increasing values

*Output:* MAD ; the Minimum Absolute Delta of the optimum sequence from given values.

*Accuracy:* <2e-6

*Examples:*

[10 70] {0}
  [0 10 19 30] {0.5}
  [2 5 10 15 20 24]{0.75}

The <http://code.google.com/codejam/contest/2437491/dashboard#s=a&a=1 Drummer Analysis> may be of help. The <http://code.google.com/codejam/contest/2437491/scoreboard?c=2437491# Champions solutions> can be seen at the Contest Scoreboard if a user profile is created. Java and C appear to dominate. Code Jam entries can be entered at <http://code.google.com/codejam/contest/2437491/dashboard#s=p1 Drummer Solve B-small>.

*Best Time: 24 minutes*

Solve

Solution Stats

23 Solutions
5 Solvers

Last Solution submitted on Aug 15, 2019

Last 200 Solutions

Problem Comments

Solution Comments

Solution 318007

1 Comment

1 Comment

Richard Zapor on 11 Sep 2013

It appears that Alfonso took 7 minutes to solve this challenge.

Solution 317997

1 Comment

1 Comment

Alfonso Nieto-Castanon on 12 Sep 2013

very clever simplifications (constant term in linear model is irrelevant, and optimal slope can only take a discrete set of values)

Solution 317607

1 Comment

1 Comment

Richard Zapor on 11 Sep 2013

Tobias took at least 2 minutes to solve this challenge with Matlab. An elegant usage of a function and a Matlab optimization function. This solution also crushed the GJam BigDataset in 1.2 seconds.

Problem Recent Solvers5

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1870. GJam:2013 World B: MAD Drummer

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 1870. GJam:2013 World B: MAD Drummer

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players