559B - Equivalent Strings what is causing Time Limit ? - And what is the best solution to avoid TL ? - solution http://mirror.codeforces.com/contest/559/submission/13479349
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.11.2024 23:01:26 (j1).
Десктопная версия, переключиться на мобильную.
При поддержке
my solution http://mirror.codeforces.com/contest/559/submission/13479349
Auto comment: topic has been updated by Emsawy (previous revision, new revision, compare).
Auto comment: topic has been updated by Emsawy (previous revision, new revision, compare).
ur doing it in o(n2)
well there is a solution like urs that the only difference is u can find if two strings are the same with hash
I reads about hash but i can`t understand the relation between hash and the problem . but , I used the array of char instead of strings and get AC http://mirror.codeforces.com/contest/559/submission/13719791
could you illustrate the relation between hash and the problem and send me your code for it .
well if tow strings are equal then their hash is equal ! and as hash is only a number u can check it in O(1)
thanks, I will try to do that .