Rating changes for the last round are temporarily rolled back. They will be returned soon. ×

### Chi's blog

By Chi, history, 15 months ago, ,

I tried solving problem 321C — Ciel the commander with centroid decomposition. I think thats what many people did and got an AC with, but my submission got a TLE. Could anyone tell me why did it exceed the time limit?

• +27

 » 15 months ago, # | ← Rev. 3 →   +12 assuming your D&C algo is correct, you can try using edge list instead of adj list. That means just use a primitive array to store edges.Also, dont use long long everywhere. just use it where necessary. It causes unnecessary computation.
•  » » 15 months ago, # ^ |   +4 Sometimes, just sometimes, you are more useful than those LooOoooOoOOooOoLoOoOoOOoOooOoOOLoOOoOoOoOoOooOoLs. Keep it up.
•  » » » 15 months ago, # ^ |   +31 LooOoOoOOoLoOoOoOooOooOoOooooLooOooooOOoOooOoooL. ROFL. LMAO.It depends on the kind of blog post that I am commenting on. If people making stupid blog posts, they deserve to get stupid comments. If they make a genuine effort to write a proper blog, then they'll deserve a proper reply. Fair enough?
 » 15 months ago, # |   +27 Your if constraint in dfs function is incorrect.Instead of if(adj[node][i]!=p&&!visited[node]), You can change it into if(adj[node][i]!=p&&!visited[adj[node][i]])If the test case is star graph, then for each vertex your dfs will iterate M edges. So the complexity for dfs only is O(NM)
•  » » 15 months ago, # ^ |   0 Thank you. Im going to kill myself now
•  » » » 12 months ago, # ^ |   +4 Are you alive Chi?
•  » » » » 10 months ago, # ^ |   +6 well thanks to those dumb avenging thingy guys i cant be dead anymore now