SampleSolutionsCentral Europe Regional Contest 2007.ppt

SampleSolutionsCentral Europe Regional Contest 2007 B: Billboard Billboard – Problem Billboard – Main Idea Billboard – Main Idea Billboard – Main Idea Billboard – Main Idea Billboard – Solution C: Phone Cell Cell – Problem Cell – Simple Solution Cell –Solution Cell –Solution H: Hexagon Hexagon – Idea Hexagon – Solution Hexagon –Solution II K: Keys Keys – Idea Keys – Idea L: Logic Logic – Problem Logic – Potential Pitfalls Logic – Potential Pitfalls N: Numbers Numbers – Solution Numbers – Solution P: Polygon Polygon – Problem Polygon – Idea Polygon – Idea Polygon – Idea Polygon – Solution Polygon – Solution R: Roshambo S: Robotic Sort Sort – Problem Sort – Another Approach Sort – Solution Sort – Solution II W: Water Water – Problem Water – Idea Water – Solution Water – Solution Water – Solution Water – Solution Statistics = Find their horizontal neighbor 1 3 2 4 5 6 7 8 Sort by Y = vertical neighbor 1 5 3 7 4 6 2 8 Now, each vertex knows its neighbors Start with the first, and walk around Count Left / Right turns Left Right ? = counter-clockwise R L L L L L R Naive approach – reverse in an array Little bit better: remember reversed Quadratic time ? 100 0002 ? 6 8 2 1 7 4 5 3 6 8 2 3 5 4 7 1 Double-linked list Problem finding the ?forward direction“ 5 4 7 1 2 8 3 5 4 7 1 2 8 3 Combined solution: use both Linked list + array of reversed The array time: O(rev_before) After SQRT(n) steps: reorder ? n.SQRT(n) time Other possibilities - ??? Heap Interval Trees … ? Find the Center of Mass Amount of water with the lowest center Split the glass into horizontal slices Volume of one slice: π.r2.d Center of Mass of the glass Weighted average of all slices Add the water “slowly” Center of water mass * * Test all existing subsets 2256 possibilities for the 16x16 board ? What if we somehow knew the tapped tiles in the first row? x x x We can try what happens with the row WOW! It is easy to find the second one! x x x We can try what happens with the row WOW! It is easy