My solution, zeddie/118430828 matches coincidently to skylag/118435215. I really don't know how this happened, I just followed the standard procedure of solving the sliding windows and it worked fine.

I have messaged him just to know how this happened. Let's see how this happened.

OH MY GOOODDDD

What the hell is this. :(

It's compiler issue, you are using an out dated compiler.

Check this: https://ideone.com/jFV2pg

Also, that is not correct value of LONG_MAX. The value you have provided is value of INT_MAX.

Yes, my question is why do I get WA when I use value of LINF as LONG_MAX and AC when I use value of LINF as 1e18.

In problem G:

Here is link to my AC solution.

Here is link to my WA on test case 122 solution, it's exactly similar to previous solution, only difference is value of LINF as LONG_MAX.

Can anyone explain, why this error is caused????

Ow!

Didn't know there are such things on Codeforces:xd

Anyways, I've updated the link to solution, please see if you can find the error.

Auto comment: topic has been updated by zeddie (previous revision, new revision, compare).

Ohk, Yes I get your point. Thanks a lot for explanation.

In question C, I got WA on test case 5. Here is link to my WA solution: here
Here is link to Accepted solution: here

Can anyone help me, what's the difference in both of dfs? Everything else is exact same.

Hey, Thanks for putting all of these. But I am clear with the theory part, I am just not able to find my way with questions. Most of the time, I am not able to solve questions even with editorials too.

Nice content and website works great as well.

Shit, I didn't know that. Thanks a lot.

Sorry, I have updated the link, he also used Floyd Warshall but it's working totally fine.

This is the link to the solution

I don't understand, can you explain?

Oh this is great, I don't know why I didn't found it. Thanks Kartik

10 submissions threshold, That means -500 already, time penalty extras.

it's still not good, but ofc better than current situation.

Check this codeforces visualizer

It's lot more informative, as compared to codedrill, It also lets you compare two codeforces accounts.

Okay, lemme give some time to 1700 rated dfs questions, either way, I will learn something.

I'll be straightforward and honest to you, There is NO trick.

All you have to do is solve questions of basic topics like Implementation, Greedy, Binary Search, Two pointers, sorting. Try these topics, solve 50 questions for each of them in the rating range of 1200-1400.

Eventually, in couple of months, you'll see that your contest performance has increased to a very well extent, and you have grown pretty good.

That's exactly what I did, First I read a few articles about basic concepts of DP. Then I tried examples.

Still, What dp concepts are you suggesting, I might have missed few of those.

From the last 6-8 months, I have been solving questions of various topics from problem sets. And, I believe I have established a good grip on fundamental topics. Currently, topics like Graph and DP are the only obstacles.

So, my question is, If I am supposed to take a break from DP, then what are you recommending me to solve?

I am solving simpler ones.

In yesterday's contest, I used Ideone.com for coding solutions for the problems of the ongoing contest. And today I received a mail, that says, My solution is plagiarised as it significantly matches someone else's solution as well.

I was in a hurry, so used Ideone publicly and unfortunately, someone copied it even though I made solution from the scratch without any help

Hell of a bragworthy inspiration.

Now, I'll share this blog and do Step-3

I agree. Many times stories have been confusing, and those extra details that are not even remotely related to the question, they are super irritating.

This is what I have been exactly looking for. Thanks a ton!!!

It worked, Thank you so much! :-)

Auto comment: topic has been updated by zeddie (previous revision, new revision, compare).