| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
|
0
Thanks bro |
|
0
Dear Codeforces Team, I recently received a warning about similarity for my submission (ID: 365892617) on problem 2207C. I want to clarify that I solved the problem by myself and didn’t copy or share code with anyone. My idea was based on understanding how the water spreads. Basically, water in a segment depends on the highest dirt level in between, because that blocks the flow. So I tried to think in terms of segments and how much area gets blocked instead of directly counting water. First I considered placing one drain, where I take all reachable water from both sides of that point. Then for two drains, I tried splitting the array into parts and handling left side, right side, and the middle carefully depending on the highest point in between. Since the same type of observation comes naturally from the problem, I think many people might have used a similar approach. But I wrote the solution myself during contest and didn’t use any outside help. I respect Codeforces rules and fair play, and I would never intentionally do anything wrong. So I request you to please review my submission again and reconsider this warning, as it affects my account. Thank you for your time. |
|
0
hey gr8 can you publish it so that dont have to load it again and again after restarting firefox https://extensionworkshop.com/documentation/develop/extensions-and-the-add-on-id/ |
| Название |
|---|


