Comments
0

orz
0

Bruh. Will have to check this out then. Thanks. Can I fix this by just changing my compiler type while submitting codes? I don't want to mess with my local system setup right now. I'm asking this so that I can use better compilers if I'm ever getting TLE because of something like this, while not having to change my local setup right now.
0

Doesn't that give TLE? As you mentioned 2 * 1e5 * 1024 > 1e8. I implemented it 330934118. It doesn't work.

Idea is to have a bunch of test cases, all with n < 1024, but the sum of n over all test cases becomes 2e5.

This way, even if we consider unique values only, the worst case is 2e5 * 1023. Which is giving TLE.
0

Idea is to have a bunch of test cases, all with n < 1024, but the sum of n over all test cases becomes 2e5.

This way, even if we consider unique values only, the worst case is 2e5 * 1023. Which is giving TLE.
0

Doesn't that give TLE? As you mentioned 2 * 1e5 * 1024 > 1e8.

I implemented it 330934118. It doesn't work.
0

(Problem D)Can someone help me understand why my submission is TLE? I thought it is O(n) or O(nLogn). Idea is to calculate the largest diameter(while also making sure we pick the lexicographically largest nodes if tie), detach all the branches and compute the diameters of those branches too(recursively)

CODE : https://mirror.codeforces.com/contest/2107/submission/318555860