| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
Looking for a solution to task C of the recent atcoder grand contest since the editorial given is only in Japanese. I tried converting it to english but it's a very bad conversion.
I cannot understand how you can verify in O(N) if its possible to satisfy the given condition by using at max X distinct characters. (the check(X) function used in Binary search)
You may watch Petr's screencast with commentary for hints:
AtCoder Grand Contest 029 screencast with commentary
Sorry for the delay, we'll finish it within this week.
Inside the binary search, basically, we decide S1, S2, ... greedily. S1 should be the lexicographically minimum string of length A1. Then, S2 should be the lexicographically minimum string of length A2 that is greater than S1. But we need to do this efficiently.
how do you guys think? its so frustating for me to think the solution of problem c.I tried for 2 hour and nothing come up with solution.
its so frustating for me to think the solution of problem c
ask god why he gave you a less intelligent brain. lol. do you really have to beat yourself up over this? Everyone has his/her own strengths. Go and find yours.
I wondered what is your real account