RAD's blog

Codeforces Beta Round 31 (Div. 2, Codeforces format)
By RAD, 16 years ago, translation, In English
Hello everyone on Codeforces Beta Round 31 (Div. 2, Codeforces format)

Round was prepared by: Mike Mirzayanov, Dmitry Matov, Max Ivanov and me.

Good luck!
Artem Rakhov and Codeforces team

  • Vote: I like it
  • -3
  • Vote: I do not like it

Comments Comments (42)
| Write comment?
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
I was getting PE on the problem D, I cant figure it out why! Can I put end lines on the outputs?
→ Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
i failed D at test 9. does anyone have some test case?
→ Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Hello! I have a question. Can somebody give me some "difficults" test cases for problem E? I have Wrong Answear on test 11 and I have no ideea why. Thank you very much
→ Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Hey can someone give test num 26 for problem E. Thanks :)
→ Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
I cant figure what is wrong with my D :/, tried a lot of tests here and all of them are ok, does anyone knows the test number 4? (its giving me PE, but I guess its WA)
→ Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
D test 9....anyone have the test case ?
→ Reply
  • 16 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it
    Some big test. The answer is 0.
    → Reply
    • 16 years ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it
      How can it be 0?

      "It is guaranteed that the set of breaks is correct, i.e. there is some order of the given breaks that each next break divides exactly one part of the bar into two non-empty parts.
      Output

      Output n + 1 numbers — areas of the resulting parts in the increasing order."

      N is at least 1, and you cant break it on empty parts!

      → Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Can problem D be done with DFS/BFS ? We have a break as a wall between two pieces .
→ Reply
  • 16 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it
    You could simplify the problem int the following way: 
    extend our map to the sizes (2N)x(2N). Now you may use the whole rows and columns for a walls.

    → Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
Can anybody explain how problem E is solved please?

I'm using DP. The parameters are (index, player1 result, player2 result, nTurns for player1, nTurns for player2)

but I'm memorizing only on index and player1 result, as the rest can be calculated through those two. Player1 result is too large so i'm memorizing in map. Sure that gives me TLE on test case 14.

What can I do? Thanks very much.
→ Reply
  • 16 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it
    Try DP: d[nTurns1][nTurns2] = maximum_possible_sum. Note that we can rid of the other parameters: at current step d[nTurns1][nTurns2] we select whom to give (nTurns1+nTurns2)-th digit of the number. It's easy to understand that following strategy doesn't depend on current digits, so we can add 10^{n-nTurns1} * s[nTurns1+nTurns2] to the value d[nTurns1+1][nTurns2] to best answer if we give current digit to Homer. Similar formula is in the case of Marge. Select maximum of these two values to obtain value for current d[nTurns1][nTurns2].
    → Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
what is the test case 8 of problem b????? please give with its answer too. :(
→ Reply
16 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
what is the test case 11 of problem E?????
→ Reply
»
19 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

E doesn't deserve 2400

→ Reply
»
7 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

isnt there any editorial for this round?

→ Reply