April (US Open) 2014 Silver Problem 2: Dueling GPSs

Result: incomplete

I've never implemented Dijkstra's algorithm before, and I couldn't do it in time.

gpsduel.cpp

March 2014 Silver Problem 2: The Lazy Cow

Result: 5/10 *****ttttt

Silver is significantly more difficult than bronze.

lazy.cpp

February 2014 Bronze Problem 2: Auto-complete

Result: 7/10 *****tt**t

Just sort the entries, but also store the original position, then process the requests.

auto.cpp

January 2014 Bronze Problem 2: Bessie Slows Down

Result: 1/10 *xxxxxxxxx

My solution is O(N log N), but I somehow made an error somewhere (probably rounding errors).

slowdown.cpp

December 2013 Bronze Problem 2: Cow Baseball

Result: 1/10 *xxxxxxxxx

N² log N time might be too slow.

baseball.cpp

November 2013 Bronze Problem 2: Goldilocks and the N Cows

Result: 7/10 *******ttt

I think that testing every boundary line might be slow, but it's the only way I can think of that does it completely.

milktemp.cpp

February 2013 Bronze Problem 2: Cow Crossings

Result: 2/15 *xx*xxxxxxttttt

I realized that I have made a mistake by not checking subsequent cows against cows that have already collided. Example: Cow 1 collides with Cow 2, so they are both marked as collided. Cow 3 will not be checked against Cow 2.

crossings.cpp

December 2012 Bronze Problem 2: Scrambled Letters

Result: 1/10 *xxxxxtttt (5 wrong answers, 4 timeouts)

November 2012 Bronze Problem 2: Typo

Result: 6/10 ******tttt (4 timeouts)

O(N²) is too slow…