Comments
0

Very nice implementation this!! Much better than what i have written.
0

https://codeforces.me/contest/2117/submission/323528702

Someone please check if this solution for problem E is hackable. Thanks!
0

Hi! I noticed this as well, but (forgive me if this question seems stupid) is there any way I can use this observation to solve the question?

Thanks!
On Tanzim_bn → Problem of the Year 2024, 22 months ago
0

Indeed, this is one of the best questions I came across this year.
0

For those who are content with offline algorithm for Salary Queries
+13

For people in Indian time zone, he does have 449 day streak. Your time zone is probably different.
0

https://codeforces.me/contest/2050/submission/295436206

Your solution with a slight change.

Do let me know if you can't figure it out.
On Maaxle → CSES Range Queries solutions, 23 months ago
0

Oh ok. Thanks!!
On Maaxle → CSES Range Queries solutions, 23 months ago
0

Is there anywhere I can learn about this technique and maybe practice some more problems related to this technique?
-16

Alternate Solution for C in O(n) time -> https://codeforces.me/contest/2026/submission/288737415
0

Thanks for the suggestion. I will try this out
0

https://codeforces.me/contest/1955/submission/288436719

I have done the exact same thing! Any idea why my code gives a TLE?

What is it I am missing?
On FBI → Codeforces Round 981 (Div. 3), 2 years ago
0

Yes, but I thought that since I am using map, so maybe there might be some testcase that can cause a TLE? 1983ms runtime on a qn with 2s limit seems hackable no?
On FBI → Codeforces Round 981 (Div. 3), 2 years ago
0

Can someone please hack this solution?

https://codeforces.me/contest/2033/submission/287788123

Thanks!
On FBI → Codeforces Round 981 (Div. 3), 2 years ago
+1

Given the constraints you can simply use a vector to do what you are doing with the unordered map.

For your reference : https://codeforces.me/contest/2033/submission/287790082

Hope it helps!!
0

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

WOW!! That was a very dumb mistake.

Thanks a lot, understood my mistake now.
0

Watch Shayan's Stream. He says that it is a famous prob. Many in the comments were also saying the same.
+4

People are saying that problem B is quite a famous and standard prob. Can someone suggest some sources where I can make myself familiar with more of these famous and standard problems? Thanks!
0

Option 2 because I get a 1/1000 probability to live the way I do forever..
0

https://cp-algorithms.com/graph/2SAT.html

This is where I learned 2-SAT. Came across this concept while solving the CSES problem set.
0

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

Thanks! I got the mistake now.

0

Oh Ok. I'll check your solution
0

It is a simple recursion problem. Assuming you understand basic recursion, this should help you understand https://atcoder.jp/contests/abc374/submissions/58460153
+4

This is probably the stupidest comment i have seen on this platform.
0

Since its 2.5 hrs instead of 2, is it safe to assume that the contest might be a little harder than usual?
0

Apart from E which question needed Binary Search?
0

D was not so easy, but at the the same time, it should not have taken me a whole half hour to solve.

And if you are wondering how so many people submitted D, the solution for D was -

1) -> Easily solvable by chatgpt. The problem setters did not check to see if chatgpt was able to solve the prob or not.

2) -> Leaked within the first 10 minutes of the contest(I think) because, I have know a noob guy from my college, who does not have any clue about even basic BFS and DFS, but submitted the B,C and D within 13 minutes!!

So yeah, that should answer your question.
0

Thank you very much!! I understood now.
0

https://codeforces.me/contest/2010/submission/278562743

This is my submission for C1

Can someone please explain why my answer for test case 114 is wrong?? Cause it seems correct to me..
0

Thanks bro
0

Can you share the link for this well known problem if you have it?? Thanks!!
0

joto ami jani ar shunechi, all you need to do now is just practice more and more and spam as many practice questions as you can. Skillwise I think you are already specialist level. I think you have solved enough 800 level difficulty probs. Maybe shift focus to 1000-1400 range difficulty probs?

Also I think learning a bit of DP would help.

All the best!! Hope you reach specialist soon!!
0

https://codeforces.me/contest/1983/submission/269611660 This is my submission for problem C. Can someone point out what is wrong in my code??