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?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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?
Name |
---|
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.
Sometimes, just sometimes, you are more useful than those LooOoooOoOOooOoLoOoOoOOoOooOoOOLoOOoOoOoOoOooOoLs.
Keep it up.
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?
What a keyboard warrior.
Your if constraint in dfs function is incorrect.
Instead of
if(adj[node][i]!=p&&!visited[node])
, You can change it intoif(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)
Thank you. Im going to kill myself now
Are you alive Chi?
well thanks to those dumb avenging thingy guys i cant be dead anymore now