Hello everyone!! this is my first time trying Lazy updates and i\'m getting incorrect results for problem http://www.spoj.com/problems/HORRIBLE/ .
output of test cases through my code:
80
408
though correct output is
80
508
here is my code : http://ideone.com/Yb0ZVO
thanks a lot!
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | AmShZ | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 134 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.10.2026 03:39:03 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
use http://paste.ubuntu.com :Dubuntu pastebin
Is this link broken ?? http://ideone.com/Yb0ZVO
line 78-81 in update function
deleted,
write
my english cant enough for explain
By doing this test cases passed. But, On spoj it is giving runtime error (SIGSEGV) :(
and can you explain the reason for doing so??
ur segtree size is too small need to be 4*N so take segtree[100005*4] , and watch long long int
http://paste.ubuntu.com/8420003/
your code is not passing the updated values to child nodes neither in update nor in query function. So, can you explain?
His code actually does except it is not clear. I ran it on my machine and it seems to work fine. However, I do not recommend such a implementation as it lacks clarity in the propagation. My implementation is as follows:
http://ideone.com/WA9fS8
My down method is where I pass the updated values to the next child nodes.
Hope this helps