tag:blogger.com,1999:blog-29632375.post4858221232337104426..comments2023-06-19T19:45:40.281-07:00Comments on vexorian's blog: Google codejam round 1AUnknownnoreply@blogger.comBlogger2125tag:blogger.com,1999:blog-29632375.post-26169331020516625322012-04-28T04:57:34.795-07:002012-04-28T04:57:34.795-07:00The analysis is up and it is very detailed.
I rea...The analysis is up and it is very detailed.<br /><br />I really just couldn't do much about it, I think that there are time in which you can consider a car to be in whatever lane is the most convenient. For example, if you catch a collision, you could verify if there was enough time for a change of lanes and if there was, ignore the collision, and repeat for all the collisions sorted in ascending order, but that's just for the small case.vexoriannoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-2845699888547677172012-04-28T01:35:46.738-07:002012-04-28T01:35:46.738-07:00I haven't really thought about problem C, but ...I haven't really thought about problem C, but on the first look, it seemed an implementation heavy problem. What are your thoughts on it? As for B, I'd take a dp or math problem over a greedy one any time.Vinay Emanihttp://www.facebook.com/vinayemaninoreply@blogger.com