Can you tell why my top down dp giving the memory limit exceed ??for problem E

Great contest d is really a nice one div2

thanks for your reply i definately look into my debugging skill i changed one thing cout<<(*it) by changing this why its accepted RE code link https://mirror.codeforces.com/contest/1468/submission/102338964

accepted code https://mirror.codeforces.com/contest/1468/submission/102364359

Can you tell is that something with syntex when i was getting RE??

https://mirror.codeforces.com/contest/1468/submission/102338964 can you please tell why it is giving runtime error on test 46 i am not able to figure it out my mistake

https://mirror.codeforces.com/contest/1468/submission/102338964 can you tell why it is giving runtime error in test 46 not able to figure it out..

https://mirror.codeforces.com/contest/1468/submission/102338964 Can you tell why this is giving runtime error in test 46 I am not able to figure it out..

Jurys anser is 1 1 2 0 1 0 and yours is 1 2 3 0 1 0

can you explain leaf trick bit more i didnt get that??

declare your array globally or declare your array with number of elements because in every test case array is initialising with 0 and if test case is 1000 then 2*100000*1000 will be 200000000 will give tle

ohk thanks

can you tell your aprroach for problem f??

great

what is your test case??

so creating map will add to complexity??

https://mirror.codeforces.com/contest/1454/submission/99432026 can you tell why this is giving tle for b??

https://mirror.codeforces.com/contest/1454/submission/99432026 can you tell why this was giving tle its O(n) solution for problem B

If in C problem if we have to minimize the number of steps performed then how we can do this??

which colour is winning state in this??

ohk thanks for explaining

so in one iteration we calculate all f[i] and then check sum of all character f[i] should be 0?? so it means f[i] can also be negative??

if in c problem z can also be converted to a then how can we do that ??

how this is working correctly??

But in this algo we were checking by setting l and traversing how can we guarantee about r may be at some point sum increase but then after that other point the r has higher msb then sum can fall in between also ?

How we got the intution that for particular l we have to iterate till sum less then 2^(k+1) ??

Can you explain your approach for problem E??

I didnt get why we reversing the array in the E problem as we fixing left point then it will automaticlly calculate all possible r ??

I have question that the game s going on sequential way like if citizen go to level 2and then in next step bandid go to level 2 then it will not catch them ?? or it will only catch when it only at leaves??

Can you tell your approach for D and the theoram mentioned in editoriol standard in cp??

Yess i got it thats silly mistake thanks for your time

where to put this line?? my dp state storing sum of numbers why to store with mod??

No it showing wrong answer on test case 4??

https://mirror.codeforces.com/contest/1433/submission/96212192 Can you tell me where i am doing wrong in my code for problem F??

https://mirror.codeforces.com/contest/1433/submission/96212192 Can you tell me whwre i am doing wrong in my dp code ??for problem F

but how do we find that sequence what you searched in google specicifically??

Can you tell what is OEIS and how we can get anser from that??

In which question max flow and min cut are usefull??

Ohk so if I make edges undirected for each I with I+1 only then it will work so i can decrease each edge for each m??

So if I add for only for one position (I+1) then that will not work??

Why with i-1 is it necessary for adding i-1?? Why it will come forward after going to backward is it not optimal to add only I+1th edge??

You wrote every teleport connected to two nearest 2 row wise teleport if some teleport is index i to which which it connected??

What are the prerequisite to learn it??

Is maxflow minflow some algo?? Related to graph??

I know what is vector I k saying what is use of that in the code logic I want

Can you tell in problem E editorial what is the use of ord vector??

Indeed

Can you tell is problem D is some standard type based because getting that intution was tough at first tym as mentioned in solution

Is D problem has to be solved in that way how to get that intution someone should have solved 1 question at least of that type I think

Nicely written keep making these type of blogs for upcoming contests also

So it means who has high processor laptop dont need to worry about time complexity??

What is intel vectorization and why this O(n^2) solution passing??

Yess C1 by dp will work.. And is there any specific reason for giving ai values from 1 to n??

Yess if we go by approach for maxima and minima approach for C1 problem then will it work??

Can you tell if the elements of array in C1 are not distinct what will happen??

great initiative is it paid or free??

So first we are decreasing all array element by 1??

Neil can you clear how you made this formula ai * n + bi because if at some indexes if both ai and bi are N then it can overshoot N^2 isn't the size of array should be (N^2+N) both for upper bound?? Correct me where I am wrong I m confused in it..

Ohk thanks for your time....

So in my while loop I should make a if condition if the input string is correct then I will continue loop and if it's incorrect I should return 0?? In this way it will work or different syntax I should prefer for this??

Can you guide me how to fix it?? It's my first interactive problem...

https://mirror.codeforces.com/contest/1363/submission/82288453 can anyone tell me why i am getting memory limit exceeded in my code?? i have submitted 10 times not able to figure it out please help??

i havenot done graph till now...i have done trees and after seeing this i thought it can be done by trees and i was troubling which type of implimentation of tree is this is it bfs of graph implimentation?? i should red graph first then try this question?? any suggestions welcome...

can anybody explain how to solve problem E i am not getting it as i want to know how to things will work on tree can anybody show tree diagram??