Comments
0

can anyone please tell me why this code(link )for F gives tle while this code(link) passes? Unordered map is faster on average than map right?
0

I'm sorry but didn't understand what you mean by 1 2 and 3 in that array. Basically I did a bfs on each connected components and assigned 0 or 1 color to each node and took the maximum of two colors for each connected components. Can you please tell me what is wrong with my methodology here.
0

Can you please tell me what is wrong with my code. I also used bipartite graph and took max of two colors for every connected component. https://ideone.com/cKVuu2
On pashka → EDU: Two Pointers Method, 5 years ago
0

Bitmasking dp please
0

Can anyone please explain problem E. And also some of the topics related to it, which might help in solving it.
0

can you please share your code for this question if possible. I've almost understood your code but that will make it more clear.
0

https://mirror.codeforces.com/contest/1401/submission/90728899 can anyone tell me what is wrong with my code.
0

Can someone please explain the problem D. I wasn't able to understand it from editorial.