Sad_reacts_only's blog

By Sad_reacts_only, 3 years ago, In English

Sorry for my poor English.

I am talking only from Div2 perspective as I think Div1 contest are still ok from this point of view.

During 2020 codeforces moved from having problems with variation over known algorithms and data structures to constructive heavy contests. I am not saying that having constructive problems are bad but their amount is way too high and I guess most of us will agree that now a days problems on topics like binary search, DP, Graphs or segment tree or other data structures etc are almost extinct in Div2 rounds.

Lets take last Div2 Codeforces Round 696 (Div. 2) as an example someone who knows programming language and basic number theory could solve problems till E and can get 1st rank. So in theory someone could become a master or International Master with just number theory and programming language knowledge.

I used to like constructive problems a lot (Actually one of my stronger topics) but now a days there are just so much constructive problems that they are just more or less becoming boring in my personal opinion.

I would like to present my points why this is wrong

  • Sometimes many problems are just checking too much cases or having just one observation. It just makes the contest that who can observe something quickly other than visualising the problems from different angels and brainstorming.
  • Variety of problems in a contest are decreasing
  • Contests are lacking a main thing that you can learn new topics by upsolving problems and reading editorials as now most of them are based on few observations which are less likely to repeat or generalised. Now you can learn new topics only through Div1 contests or through only last few problems of Div2.
  • People reach div1 without having too much experience of basic data structures and algorithms and then have to solve problems that require good experience over those topics and in turn creates knowledge gap.

I would like to ask contest admins to also look a contest from a perspective that is it teaching some new topics to someone who is just starting and also people to practice common topics to get a stronger grasp on them. Having too much constructive problems neglects this aspect of contest.

Full text and comments »

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

By Sad_reacts_only, history, 4 years ago, In English

I have made a submission to problem — 1398G - Running Competition My submission — 90009972

According to me, it's time complexity is O(n^2 / 32) and n is 2*10^5. Then why it's not TLE? or am I calculating the time complexity wrong?

Full text and comments »

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

By Sad_reacts_only, history, 4 years ago, In English

Can someone provide me links to Problems on Open and Close Interval Trick of DP?

Full text and comments »

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

By Sad_reacts_only, history, 4 years ago, In English

Why there are two contest namely Codeforces Round #607 and Round #608 in one day with such less time gap. Does anyone knows the reason behind this?. Personally i would have preferred one contest on 15 and one on 16.

Edit- also both of them have unusual start time.

Full text and comments »

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

By Sad_reacts_only, history, 5 years ago, In English

We are glad to announce CodeYaan 1.0 the official coding contest of Concetto IIT(ISM) Dhanbad 19 in Association with CodeISM.

Start Time: https://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeYaan+1.0&iso=20191017T2130&p1=1603&ah=2&am=30

Duration: 2:30 Hours

Number of Tasks: 5-7

Writer: Sad_reacts_only, anakin-skywalker-, DEVV5, som, dlp__302, apurvmayank, shivansh5 and Suyash Srivastava

Register at: http://tiny.cc/CodeYaan

Contest link- https://www.hackerrank.com/codeyaan-1-0-div1

Participation criteria- Any individual with a Knack of Programming

Prizes - 1st place — INR 5,000

2nd place — INR 3,000

3rd place — INR 2,000

Top 10 participants will get exciting goodies

for detailed description click on the link below:-

https://drive.google.com/file/d/13Sq058RE7AADvqP0myWxO9YQBDBEA9if/view?fbclid=IwAR1CPEgTXMrFoEEBVdasmr8miqGqOi6vKdaAQRMr2jKFKlsqQkNWjKzySas

We are looking forward to your participation!

Upd:- Winners of Div1

1st- ankurdua15

2nd- amnesiac_dusk

3rd- aniket9465

Congratulations to all the winners.

Full text and comments »

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

By Sad_reacts_only, history, 5 years ago, In English

Can anyone provide a link to a good tutorial to learn trie data structure?

Full text and comments »

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