Sunday, July 9, 2017

A Dublin week

The June 5 - June 11 week was dominated by the main Google Code Jam elimination rounds.

First off, Code Jam Round 3 took place on Saturday (problems, results, top 5 on the left, analysis). The top 26 have qualified for the finals in Dublin, and kevinsogo was the only contestant to solve the very tricky last problem and still have time left for two more - congratulations on the first place!

I have contributed to the constructive problem trend with problem B: you are given a directed graph with at most n<=1000 vertices, and need to output any nowhere-zero flow in it with edge flows not exceeding n2 by absolute value. Seymour's theorem shows that we can actually make do with values between -6 and 6, but such frugality was not required :)

One day later, not just two, but 21 more tickets to Dublin were up for grabs in Distributed Code Jam Round 2 (problems, results, top 5 on the left, analysis). Solving everything was not required to qualify, but it was certainly required to get into the screenshot on the left. Congratulations to fagu on being the fastest!

Thanks for reading, and check back for the next week's summary!

No comments:

Post a Comment