Dontony's blog

By Dontony, history, 14 months ago, In English

Hi, I got this rules from the official ICPC site.Can anyone confirm whether I am eligible or not.I graduated on June,2023.Had participated in the Kanpur-Mathura 2022-23 regionals.(I am actually not sure and don't want to ruin participation for my junior teammates so asking for help).

Thanks in advance.

Full text and comments »

  • Vote: I like it
  • +4
  • Vote: I do not like it

By Dontony, history, 2 years ago, In English

Hello everyone, I am finding difficulty in understanding the editorial of problem B from the recent Atcoder regular contest 150.Can you guys provide their own way of solving this problem or explain the editorial in a more detailed way.? Thanks. Problem Link:- https://atcoder.jp/contests/arc150/tasks/arc150_b

Full text and comments »

  • Vote: I like it
  • +4
  • Vote: I do not like it

By Dontony, history, 3 years ago, In English

Q:You are given an array of n elements. Now, there are 2 types of queries on the array. 1) Change the element at index i to some new element(say x). 2)Given l and r ,find the number of subarrays in range l to r having sum divisible by 3. The number of queries can be upto 1e5 and also size of the array can be upto 1e5.

This is not from some ongoing coding contest. I found this question on gfg from a company's interview experience. Link to that blog:- https://www.geeksforgeeks.org/nutanix-interview-experience-for-mts-intern-off-campus-2021/

Full text and comments »

  • Vote: I like it
  • +2
  • Vote: I do not like it

By Dontony, history, 3 years ago, In English

Can anyone explain to me why I am getting TLE in this problem:- https://codeforces.me/contest/1526/problem/D. Here is my submission:- https://codeforces.me/contest/1526/submission/117731679. I just iterated over all the 24 permutations of "ANOT" and then formed the string and found the minimum swaps required for this string in O(n).(the counting part is taken from GFG which works in O(n)).

Thank you.

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

Can anyone expain to me why I am getting Memory Limit Exceeded in this problem:- https://codeforces.me/contest/29/problem/D. Here is the link to my submission:- https://codeforces.me/contest/29/submission/111265225.

I just computed the path between each pair of nodes (by inserting 1 at the front and 1 at the back of the leaf list) using lca technique. But getting MLE. Any help? Thanks for devoting your time in reading this.

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

Recently my simple code in sublime text is taking up a lot of time to compile and run. Like for simple taking input an array and then printing it, sublime is taking about 7-8 secs. It doesn't always happen but when it happens during a short contest it's frustating. Can anyone suggest me ways to decrease the compile time? Thanks for noticing this blog.

Full text and comments »

  • Vote: I like it
  • +11
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

Can you guys tell me what rating is necessary for accessing the proposing a contest feature? I am a little confused. I am able to access it but my friend https://codeforces.me/profile/Favorite_number7 who has the same color as mine is not able to access it. Thanks.

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

I am been trying to check my delta change for today's contest after the round but it seems CF predictor is broken. Can anyone confirm if they are having the same problem?

Full text and comments »

  • Vote: I like it
  • +28
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

I have reached blue recently, but as you can see from my rating graph it consists of lots of inflection points. I think my practice strategy is not much effective .So, can you guys share your practice strategy after becoming expert for further progress. Also what new topics to learn and what learned topics to focus on the most. It would be really helpful. Thanks in advance.

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

I tried to solve the problem B of today's educational round 94 using binary_search but couldn't figure out a way to find the good equation.As the tags also consist of binary_search,I think some people may have done it using binary_search. Can you guys share your binary search approach here? Thank you.

Full text and comments »

  • Vote: I like it
  • +1
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

I am not able to find any bug in my code of today's contest 662Div2 problem B.Here is my submission:- https://codeforces.me/contest/1393/submission/89277043.Any kind of help is much appreciated.

Thank you.

Full text and comments »

  • Vote: I like it
  • +2
  • Vote: I do not like it

By Dontony, history, 4 years ago, In English

I am getting TLE on the codeforces problem Two Divisors from the recent educational contest. Link to the problem:- https://codeforces.me/problemset/problem/1366/D. Link to my submission:- https://codeforces.me/contest/1366/submission/83516292. Please suggest ways to optimize it.

Thank you.

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it

By Dontony, history, 5 years ago, In English

Can we create an array of size 1e6+1 in C++(in my IDE the code crashes),by any methods,or, using vectors would be better? Please comment on this!Thanks.

Full text and comments »

  • Vote: I like it
  • -12
  • Vote: I do not like it

By Dontony, history, 5 years ago, In English

I new to this community.So,I am not getting why I am getting TLE on test 4 of Codeforces problem Xenia and Colorful Gems. Link to my TLE solution:- https://codeforces.me/contest/1336/submission/77683830.

Please help someone!Thanks.

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it