I am getting tle in SPOJ GCDEX despite following 'A Dance with mobius function' blog. Please help.
My Solution: https://pastebin.com/TyQzd9Aw
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 25.09.2026 09:28:49 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by JacobianDet (previous revision, new revision, compare).
I've noticed that your approach has complexity O(nlogn + sqrt(n)*T), I don't really know why exactly it still gives TLE even with some optimizations I made (even memoizing answers doesn't work), but I think there is an approach to get O(nlogn + T) complexity, maybe the upper bound for the value of sqrt(n)*T makes it hard to pass the strict Time Limit.
Your Solution with some optimizations (still TLE :( ):
https://pastebin.com/B2RKyUhV
My solution for the problem in O(nlogn + T):
https://pastebin.com/tC0CtDAJ
Thanks, this got AC. But why is the blog method not working.
Blog : https://www.quora.com/profile/Surya-Kiran/Posts/A-Dance-with-Mobius-Function
Well, I think it's because the post is from 2015 and the problem time limit was continuously updated, at the end of the statement it's announced that some AC solutions may get TLE after it.
Anyways, if the starting solution didn't pass the time limit, you'd need to improve any part of the algorithm that may cause it: In this case, the complexity per query might ruin the execution time so it's the first candidate.
My solutions preprocess each n and gets
in a sieve style. After that just makes preffix sums to get the outer sum for each n and that would be the answer for each one.
It just goes one step further that the blog's solution.
Thanks, I get that now