Problem 534. Find best domino orientation

Created by Doug Hull

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>Given a list of pairs, find the orientation they should be placed in a line, such that the sum of the absolute values of the differences is zero.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Zero means do not invert, One means invert in the order vector.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[list = [1 2\n        4 2\n        2 3\n\norder = [0 1 1]\n\nyields: [1 2][2 4][3 2]\n    or: abs(2-2) + abs(4-3)\n    or:        0 + 1\n    or: 1]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>There is a unique solution to this problem where the final score is minimized.</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>"}]}

Solve

Solution Stats

603 Solutions
230 Solvers

Last Solution submitted on Aug 01, 2020

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

Jean-Marie Sainthillier on 6 Aug 2012

No unique solution. For me it is the last solution of the permutation matrix.

Doug Hull on 7 Aug 2012

For which test statement is there not a unique solution? We need to fix the test suite if there are two answers of same score.

Jean-Marie Sainthillier on 7 Aug 2012

Sorry, it was a mistake.

Andrew Newell on 9 Jan 2015

The statement of the problem is incorrect: "the sum of the absolute values of the differences is zero." You want the smallest sum, but it isn't necessarily zero.

Raihan Ahmed on 6 Jan 2016

Is there any size constraint on this problem ? My solution is not getting accepted ...

Solution Comments

Solution 550812

2 Comments

2 Comments

Jon on 30 Dec 2014

Best solution without lookup table

Ramoflaple on 7 Jul 2015

Never thought for-loop can be used for a matrix.

Solution 73793

2 Comments

2 Comments

Albert Yam on 10 Apr 2012

Aww.. ran out of memory.

Albert Yam on 10 Apr 2012

%the part of the code i cut out, should work in theory ..

fliplist = fliplr(list);
idx = triu(ones(length(list)),0);
for j = 1:length(idx)
idx2 = unique(perms(idx(j,:)),'rows');
[a b] = size(idx2);
for i = 1 : a
idxi = boolean(idx2(i,:)');
list2 = list;
list2(idxi,:) = fliplist(idxi,:);
list2 = list2';
list2 = list2(:);
dlist = abs(diff(list2));
val2 = sum(dlist(2:2:end));
if val2 < val
val = val2;
orientation = idxi';
end
if val == 0
return
end
end
end

Problem Recent Solvers230

Problem Tags

contest

Problem 534. Find best domino orientation

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers230

Suggested Problems

More from this Author52

Problem Tags

Problem 534. Find best domino orientation

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers230

Suggested Problems

More from this Author52

Problem Tags

Players