halin.george's blog

By halin.george, 6 years ago, In English

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

GL & HF.

 
 
 
 
  • Vote: I like it
  • +43
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +7 Vote: I do not like it

Good luck guys!:D

»
6 years ago, # |
  Vote: I like it +34 Vote: I do not like it
  • »
    »
    6 years ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

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

  • »
    »
    6 years ago, # ^ |
    Rev. 2   Vote: I like it +5 Vote: I do not like it

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

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

    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it +13 Vote: I do not like it

      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).

»
6 years ago, # |
  Vote: I like it +191 Vote: I do not like it

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

  • »
    »
    6 years ago, # ^ |
      Vote: I like it +29 Vote: I do not like it

    You make it sound too simple...
    congratulations

  • »
    »
    6 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    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, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Graph is bipartite. Let me denote L, R as two parts of graph where every edge is b