Codeforces исполнилось 10 лет! Мы рады анонсировать краудфандинг-кампанию. Поздравьте нас по ссылке ×

WA in ACM ICPC Latin Regional Contest [Greedy][Editorial]

Правка en3, от proofbycontradiction, 2018-09-26 15:49:03

I am trying to solve Problem M: Counting Marbles. I am writing an editorial in case somebody might need it after me, and I am also trying to ask for help in spotting the error in my code.

We are essentially trying to write the smallest base-365 number with the marbles. So we must minimize the earlier digits as much as possible.

Use a priority queue with the tops of the stack, and whenever you use a marble, remove it from the priority queue and put the next element in the queue instead. Please see my solution for one such implementation.

Help: My solution is able to run on the sample test cases, but I'm getting WA (could somebody take a look at this)?

My solution:
Problem Statement:

EDIT: This editorial is incorrect.

Теги debug, latin america regional, editorial


  Rev. Язык Кто Когда Δ Комментарий
en3 Английский proofbycontradiction 2018-09-26 15:49:03 43 Tiny change: 'al.pdf\n\n' -> 'al.pdf\n\n\n\n**EDIT:** This editorial is incorrect. '
en2 Английский proofbycontradiction 2018-09-26 13:17:00 18 Tiny change: 'om/VnKScW \nProblem' -> 'om/VnKScW \nProblem'
en1 Английский proofbycontradiction 2018-09-26 13:15:31 913 Initial revision (published)