code_warrior's blog

Everything right, yet getting TLE in graph problem!
By code_warrior, history, 4 years ago, In English

I tried my lot to debug why my code for the probem "Beautiful Graph" ig giving me a TLE. I have just used dfs .PLease someone reply if one can help me out! This is the problem . This is my code!

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

»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Well ,I resolved the issue by myself. Actually, clearing all the adjacency vector and setting the mark/visited boolean array from one to 300005 in each iteration was causing TLE. I should have done it only upto given n. Got AC after setting it! Hope, it will help others.

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 3   Vote: I like it 0 Vote: I do not like it

    Thanks for sharing your experience. Note that the C++ class constructors/destructors and dynamic-memory management functions can do the mark/visited and adjacency vector initialization and clearing automatically if these objects are declared locally inside the solve() function. Check the following code for an example.

    86144300

    → Reply