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

Everything right, yet getting TLE in graph problem!
Автор code_warrior, история, 6 лет назад, По-английски

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!

  • Проголосовать: нравится
  • -12
  • Проголосовать: не нравится

»
6 лет назад, скрыть # |
 
Проголосовать: нравится +1 Проголосовать: не нравится

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.

→ Ответить
  • »
    »
    6 лет назад, скрыть # ^ |
    ← Rev. 3  
    Проголосовать: нравится 0 Проголосовать: не нравится

    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

    → Ответить