Hello everyone on Codeforces Beta Round 31 (Div. 2, Codeforces format)

Good luck!

Artem Rakhov and Codeforces team

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

1 | tourist | 3557 |

2 | Radewoosh | 3468 |

3 | Um_nik | 3429 |

4 | Petr | 3354 |

5 | Benq | 3286 |

6 | mnbvmar | 3280 |

7 | LHiC | 3276 |

8 | wxhtxdy | 3258 |

9 | ecnerwala | 3214 |

10 | yutaka1999 | 3190 |

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

1 | Errichto | 191 |

2 | Radewoosh | 180 |

3 | tourist | 173 |

4 | Vovuh | 167 |

5 | antontrygubO_o | 166 |

6 | PikMike | 164 |

7 | rng_58 | 160 |

8 | majk | 157 |

9 | Um_nik | 155 |

9 | 300iq | 155 |

Hello everyone on Codeforces Beta Round 31 (Div. 2, Codeforces format)

Good luck!

Artem Rakhov and Codeforces team

Announcement of Codeforces Beta Round #31 (Div. 2, Codeforces format)

Announcement of Codeforces Beta Round #31 (Div. 2, Codeforces format)

↑

↓

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/23/2019 04:33:59 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

I think it is a terrible bug.~

The text say, Breaks are given in arbitrary order.

will some test case like this?

2 2 2

0 1 1 1

1 0 1 2

I make one more for loop to calculate by force, then i got an Accept.

3

000999

?

The input example:

1234

The total is: 12 + 34?

Thx:)

"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

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!

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.

this contest has the useful

Can someone explain me the strategy behind the problem D?