Need help to solve SPOJ SID problem

Блог пользователя wadhwasahil

Автор wadhwasahil, история, 11 лет назад, По-английски

problem link I am doing this question using AVL tree but I am not able to handle the duplicate values in the input. First , I thought of using a vector for each node but that will turn out to be a TLE. Any help would be really appreciated.

Thanks in advance.

avl, binary search tree, spoj

wadhwasahil
11 лет назад
6

Комментарии (5)

Показать архивные | Написать комментарий?

fresher96

11 лет назад, скрыть # |

use queue in each node to store the ranks

→ Ответить

wadhwasahil

11 лет назад, скрыть # ^ |

but how will I delete a node ? I mean, if I have a node A (val=10 & rank=1,3,5,10) and its in-order successor node B(val=12 & rank=2,4) . So I have to copy the entire node(val and queue) of node B to node A. Won't it lead to TLE?

→ Ответить

fresher96

11 лет назад, скрыть # ^ |

yes you are right, i'm sorry.

i did the implementation and it gives TL on test 3. so there must be another way.

→ Ответить

fresher96

11 лет назад, скрыть # ^ |

← Rev. 2 →

seems like O(nlgn + mlg(n+m)) can't fit in the time limit! after some thinking, i approach a way simpler solution, it works as follows:

q[x] is a queue that stores all the ranks for value x, to answer query I x just do q[x].push(currentRank) the other queries are the same, you may refer to the code. However it stills TL on the third test. the solution seems to be a way harder.

→ Ответить