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
Rating changes for last rounds are temporarily rolled back. They will be returned soon.
→ Pay attention
Before contest
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
14:24:06
Register now »
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
14:24:06
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | Kevin114514 | 3678 |
| 3 | VivaciousAubergine | 3647 |
| 4 | jiangly | 3582 |
| 5 | strapple | 3515 |
| 6 | tourist | 3473 |
| 7 | Radewoosh | 3418 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | turmax | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/23/2026 03:10:54 (g2).
Desktop version, switch to mobile version.
Supported by
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 .