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

GL & HF.

# | User | Rating |
---|---|---|

1 | Benq | 3797 |

2 | tourist | 3723 |

3 | Radewoosh | 3720 |

4 | ecnerwala | 3579 |

5 | ksun48 | 3463 |

6 | Um_nik | 3457 |

7 | maroonrk | 3446 |

8 | jiangly | 3432 |

9 | Petr | 3370 |

10 | scott_wu | 3350 |

# | User | Contrib. |
---|---|---|

1 | 1-gon | 208 |

2 | awoo | 184 |

2 | rng_58 | 184 |

4 | Errichto | 182 |

5 | SecondThread | 177 |

6 | maroonrk | 176 |

6 | Radewoosh | 176 |

6 | -is-this-fft- | 176 |

9 | Um_nik | 173 |

10 | antontrygubO_o | 169 |

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

GL & HF.

Good luck guys!:D

Thank you )

The contest in Gym: 2015 Google Code Jam Round 1B (GCJ 15 Round 1B).

Will Round 1A also appear in a Gym? If not Mike, could someone with trainer permissions add it? Thanks.

Can someone help me, how can I see failing test case? Thanks

edit:I found the problem 5 3 9 -> 3 (I had 4)5 3 9 -> 3 is correct

x is where the neighbor located, and o is empty space

xox

oxo

xox

oxo

xxx

which is the best strategy to get minimum possible unhappiness (3).

Hmm, seriously, I have no idea about A and B. I just wrote brute force and guessed the pattern.

You make it sound too simple...

congratulations

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?

Graph is bipartite. Let me denote

L,Ras two parts of graph where every edge is b