drastogi21's blog

By drastogi21, 7 weeks ago, In English,

Hi Codeforces Community,

Are you rated 2100 or higher? If yes, then it must be frustrating waiting for rated contests. I thus, bring to you a serious (not troll) proposal for Div 1.5 contests and some small changes in contest setups. Note that, I have also prepared a contest and know very well how hard it is to come up with interesting and novel ideas, so this is by no means a blog where I'm just criticizing setters that they are not setting frequent contests.

Why Division 1.5?

The frequency of Div. 1's is extremely low is compared to Div. 2. Moreover, coming up with the last problem of a Div. 1 round is extremely hard. If you have got good enough ideas (up to let's say Div 1 D), you still get to make the contest!

How does it benefit the contestants?

Well, more contests are always fun!

How does it benefit the setters?

Read the answer to the 1st question.

Rated Range?

Let's make it rated for up to 2600.

But you know, anyone will become red, blah blah blah, rating inflation blah blah!!

It would still be hard if you're competing with GM participants. The number of participants who this division excludes is somewhere around 80-100. If you're already experiencing a huge delta in these rounds (let's say < 10 rank), you would get somewhere around rank 50 in a Div. 1 contest, which is still sufficient to reach 2800.

Two more things:

1.) Lots of contests these days have 6-7 problems. Can we just settle for 5 problems per division like the good old days? Solving many problems in a contest feels like a chore and it would mean more contests in which you can spread out your problems.

2.) Please start taking individual problem proposals, if a setter only has a good Div1C idea, he can still combine it with other setters' problems for a contest. And what will that mean for us? More contests!! Yay!.

Feel free to suggest anything in the comments.

Read more »

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

By drastogi21, history, 2 months ago, In English,

Why is the following true? I cannot understand the intuition behind it.

The weighted maximum independent in a bipartite graph is calculated as follows, connect a dummy source vertex to all left vertices with edge capacity equal to the weights of these nodes in the original graph, do the same with right vertices, and the dummy sink. And for each edge in the original graph, connect the nodes of this edge with infinite capacity in the flow graph. The answer is: (sum of weights of nodes — the maximum flow of this flow graph).

Read more »

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

By drastogi21, 7 months ago, In English,

The website states that the contest will take place on 14-15th Jan 2020. However, I had a few questions in mind.

  • How to register (on Baylor or otherwise)?
  • Has anybody received anything official (any invitation mail etc.)?
  • What is the exact venue?

If somebody knows the answer to at least one of these questions, please answer. With so few days left for the contest and no news whatsoever from anywhere else, it would be extremely helpful.

Read more »

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

By drastogi21, 10 months ago, In English,

I was wondering if there is a way to see the test cases of Kickstart? I kept getting WA in the problem C (Spectating Villages) of Kickstart Round F. I even wrote a stress-tester for it. I wasn't able to find any test case where the output of my brute soln (the one which passed C-small) and dp soln differed (I ran roughly 1500 test cases).

Edit : Turns out it was a stupid bug. I did figure it out.

Read more »

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

By drastogi21, 12 months ago, In English,

Hi, Codeforces Community!

Codefest'19 — a diverse roster of high-quality programming competitions by Department of Computer Science and Engineering, IIT(BHU), Varanasi is excited to present Perplexed — the constrained programming event.

Perplexed is one of the most innovative events of CodeFest, whose target is not only gauge a contestant's coding abilities but also how one tackles different situations and constraints. The problemset will include all mind-boggling coding problems, ranging from code obfuscation to language constraints, character limits etc

The contest will take place at HackerRank. This contest will be an individual event with a duration of 2 hours 30 minutes, from Aug/23/2019 20:00 IST. With the creativity that the problems will naturally encourage and INR 50,000 at stake, there is absolutely no reason for a programmer to not give this one a shot!

The contest has been prepared by Enigma27, navpun31, _shanky, hitman623 and me (drastogi21).

UPD1: The contest will start in about an hour.

UPD2: The contest will start in about 15 minutes.

UPD3: The contest has ended.

UPD4: The editorial has been published. You can find the solutions to the problem at HackerRank itself. Feel free to discuss the problems in the comments.

Prizes -

1st Prize-Rs.20000

2nd Prize-Rs.12000

3rd Prize-Rs.8000

1st in India-Rs.6000

1st in IIT(BHU)-Rs.3000

1st in 1/2 year in IIT(BHU)-Rs.1000

UPD: The issue in the checker has been resolved. Following are the winners of the contest. Congrats!

1. .I.

2. JeffreyHo

3. dvshah

First place in India: nishank.suresh

Read more »

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