Problem link: http://www.spoj.com/problems/PATULJCI/
Solution link: http://ideone.com/NqSI3j
Verdict: TLE
I tried to use Mo's algorithm and segment tree to solve the problem. How do I further optimize my solution? Any help is really appreciated.
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | Qingyu | 153 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Data Structure problem (SPOJ PATULJCI — Snow White and the N dwarfs)
Problem link: http://www.spoj.com/problems/PATULJCI/
Solution link: http://ideone.com/NqSI3j
Verdict: TLE
I tried to use Mo's algorithm and segment tree to solve the problem. How do I further optimize my solution? Any help is really appreciated.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 |
![]() |
Tobby_And_Friends | 2017-01-12 04:28:59 | 325 | Initial revision (published) |
Name |
---|