Ferrarixxx's blog

Problem D WA on Test Case 5, Please Help (U_U)
By Ferrarixxx, history, 4 years ago, In English

Hi, Thanks for opening this Link :)

Heres the Problem Link: Problem D Link
My Submission Link: Please Click Me

I have Commented my logic which is same as that of editorial Very simple

Thanks For Reading

Hoping for a Prompt Reply.

  • Vote: I like it
  • +5
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
4 years ago, # |
  Vote: I like it +8 Vote: I do not like it

in your dfs when you write x * (n — x) % mod , this is wrong becuase you want the maximum of them and if x * (n — x) == mod -> you set it as 0, which could be the maximum. just remove the % mod in your dfs and catch overflow when you want to add to your final answer

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    and there is no need to use map for edges value. you can represent each edge as the number of the lower node in the dfs(because each node has a unique parent)

    → Reply