In the last div 4, my solution for the problem E Binary Inversions link to problemgot skipped due to the similarity of code from the user merahijalwa/181973274. first of all I don't know him and the similarity in code is due to code available in the geeks for geeks platform for counting the number of inversions in the array link to code from geeks for geeks website .
please consider this as this is a legit case and this is fist time i am going to reach pupil rank. please MikeMirzayanov , mesanu , flamestorm consider this case as my case is completely legit and nor i have use any online ides. If anyone know how to contact codeforces team..please comment.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
31:32:30
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
31:32:30
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 10:02:30 (g1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by puspendra_09 (previous revision, new revision, compare).
Auto comment: topic has been updated by puspendra_09 (previous revision, new revision, compare).
tbh u dont require that merge sort inversion finder thing. as the array was a binary one.
I had already solved by making a suffix array containing the count of 0 and then iterating over the original array if the current element is 1 in the original array adding the element at the suffix index and even i had the same idea during the contest but due i thought it is valid to use code available before the contest so that's why i used it.
Maybe It got skipped, not because you copied from GFG , but the other guy also copied for GFG , and solution of both of you matched.
i don't know if its your case but whats wrong with those people in this thread copying solutions which published before the contest is not against the rules are those people are numb or what?
Auto comment: topic has been updated by puspendra_09 (previous revision, new revision, compare).
Auto comment: topic has been updated by puspendra_09 (previous revision, new revision, compare).