lyashenkogs / googlehashcode2017 Goto Github PK

Remove unvalid slice from start positions if it's steps == 0 and turn their to pizza

Refactor getAllAvailableSteps so it shud get start positions and output slices.
If some start position slice hasn't any available steps and it is valid -> remove this slice from start positions and add it to output.

Implement BFS algorithm to our problem and describe it in our's wiki. I would like to suggest use draw.io. See #7 for example

Google checks sent result files online. So to avoid unit test writing we will write a test on Selenium WebDriver that sends results to the submission page
and parse scores

Performance measures show huge overhead on logging and getAllAvailableSteps method.

The project was run via:

mvn exec:java -Dexec.mainClass="com.google.hashcode.App"

finished with exeption:
medium.in exeption.txt

Estimate for the end of refactoring -> 1 hour to perform pizza slicing for all the pizzas'

Solution:

• decrease logging for big slices. Put an if to toString methods based on an entity size
• perform method getAvailableSteps for a part of start positions. //TODO more precise description and a diagram

The issue implementation shouldn't break the algorithm fo example.in file!

Google requires a specific output format. See task description.
Our inner format is List <List<Cell>> that represents a list of slices.

• create a List that represents example output see example output.txt
• create a Formatter.class that will produce this example text representation from List<List<Cell>>

All infrastructure issues are almost completed, so it's time to implement the actual algorithm. See TaskDescription.pdf. An MVP is an algorithm that slices the example.in and passes checks on the task submission page.

Write method, that run input method in 4 threads.

like:
Map availableSteps = getAllAvailableSteps(...)

shoud look like:
Map availableSteps = multiThreadStart(getAllAvailableSteps(...))