_Halabi's blog

WA
By _Halabi, history, 2 days ago, In English

i tried to solve this problem but i have WA 19 , many trials without result so i hope some one can help me <3

my solutin idea : 

for each u  we preprocess it that we store for it the 1<<k elemnt after  u in valid sequence    dp[u][k]  and sum untill this elemnt   sum[u][k]  >>  so we can ans queryies about u in log time

submission : 268374991

  • Vote: I like it
  • -1
  • Vote: I do not like it

»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by _Halabi (previous revision, new revision, compare).

→ Reply
»
42 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Bro put some link Or something

→ Reply