### halin.george's blog

By halin.george, 6 years ago,

Code Jam Round 1B starts in a few hours(19:00 MSK).

GL & HF.

• +43

 » 6 years ago, # |   +7 Good luck guys!:D
•  » » 6 years ago, # ^ |   +2 Thank you )
 » 6 years ago, # |   +34 The contest in Gym: 2015 Google Code Jam Round 1B (GCJ 15 Round 1B).
•  » » 6 years ago, # ^ |   +12 Will Round 1A also appear in a Gym? If not Mike, could someone with trainer permissions add it? Thanks.
•  » » 6 years ago, # ^ | ← Rev. 2 →   +5 Can someone help me, how can I see failing test case? Thanksedit: I found the problem 5 3 9 -> 3 (I had 4)
•  » » » 6 years ago, # ^ |   +13 5 3 9 -> 3 is correctx is where the neighbor located, and o is empty spacexox oxo xox oxo xxxwhich is the best strategy to get minimum possible unhappiness (3).
 » 6 years ago, # |   +191 Hmm, seriously, I have no idea about A and B. I just wrote brute force and guessed the pattern.
•  » » 6 years ago, # ^ |   +29 You make it sound too simple...congratulations
•  » » 6 years ago, # ^ |   +5 I reduced this problem to the following one. Select M edges from the graph so that they have minimal number of incident vertices, but did not know how to solve it. Any ideas how one can tackle this problem?
•  » » » 6 years ago, # ^ |   0 Graph is bipartite. Let me denote L, R as two parts of graph where every edge is b