| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Hello everyone can someone explain this to me:
In this problem https://codeforces.net/contest/1512/problem/C
I have to construct a palindrome with limited 0 and 1s
The problem doesn't state that if we have remaining a or b (remaining 0 or 1 to add) the solution must return -1
and also in the image I sent,there is one case(1) that allow a or b to be remaining (a>0 or b>0) in the end
My main queston is:How in the sixth case we should return -1 contrarly to the seventh case?
I cannot yet finish a whole contest when i have been programming since long ago.I turned just yet to problemsets in order to improve.Except the lack of skills or knowledge I also feel intimidated by some problems.I have read a competitive programming book but it did just teach me some basic stuff like dynamic programming orbacktrackng which i haven't yet used in any problemin this competitive world.I must get better if anyone got any advice or wants to co-code during sundays I am up for it!!
