Hey can you please explain why you are updating link[last] to node in line number 49 of your code.

I did bfs after putting all empty cells in set rowwise and column wise and deleting cells from set after pushing in bfs queue but got TLE on test 6

was O(N*M*2*log(n*m)*8) too much for D

Codeforces is not so strict with time limits :D until you are writing some sub-optimal solution in which case you need to edit this #define int long long

Same happened with me in B i just looped from a+1 to b without noticing constraints lost 50 points :(

I use this, It save me from overflows :D

Solution was O(1) answer is always Karen :D

O(N^2*6) DP getting TLE in C but O(N^2) Pascal's trangle passing :( too strict time limit

Thanks

No mention of winners :( . Don't know I will ever come under 5 or not again :(

What would happen if two person attempt to hack a code simultaneously when there is a queue on hacks ??

Experiencing Queue on hacks for the first time

Is TOPCODER Arena Down???

but same code is ac in g++5.1 and wa in g++ 14 i have given links in my comment above

sqrt ac in g++5.1

same code giving ac with g++ 5.1 and wa with g++14 what's this ??? ac code wa code what's the problem

i solved it using binary search and got ac :)